./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/cstrncat-alloca-1.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/cstrncat-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 6371c4611e316d2d263767edd018a520ca95364feb4c5ab9be1def305b667b3d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:32:21,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:32:21,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:32:21,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:32:21,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:32:21,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:32:21,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:32:21,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:32:21,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:32:21,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:32:21,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:32:21,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:32:21,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:32:21,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:32:21,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:32:21,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:32:21,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:32:21,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:32:21,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:32:21,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:32:21,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:32:21,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:32:21,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:32:21,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:32:21,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:32:21,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:32:21,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:32:21,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:32:21,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:32:21,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:32:21,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:32:21,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:32:21,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:32:21,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:32:21,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:32:21,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:32:21,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:32:21,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:32:21,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:32:21,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:32:21,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:32:21,535 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:32:21,560 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:32:21,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:32:21,561 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:32:21,561 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:32:21,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:32:21,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:32:21,562 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:32:21,562 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:32:21,563 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:32:21,563 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:32:21,563 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:32:21,564 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:32:21,564 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:32:21,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:32:21,564 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:32:21,564 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:32:21,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:32:21,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:32:21,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:32:21,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:32:21,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:32:21,565 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:32:21,565 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:32:21,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:32:21,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:32:21,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:32:21,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:32:21,567 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:32:21,568 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:32:21,569 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6371c4611e316d2d263767edd018a520ca95364feb4c5ab9be1def305b667b3d [2022-02-21 03:32:21,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:32:21,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:32:21,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:32:21,793 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:32:21,794 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:32:21,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/cstrncat-alloca-1.i [2022-02-21 03:32:21,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c4ffd38/ff97f8e188634f32be229d479ee1f6c7/FLAG559a800d2 [2022-02-21 03:32:22,184 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:32:22,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/cstrncat-alloca-1.i [2022-02-21 03:32:22,195 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c4ffd38/ff97f8e188634f32be229d479ee1f6c7/FLAG559a800d2 [2022-02-21 03:32:22,594 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c4ffd38/ff97f8e188634f32be229d479ee1f6c7 [2022-02-21 03:32:22,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:32:22,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:32:22,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:22,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:32:22,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:32:22,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:22" (1/1) ... [2022-02-21 03:32:22,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f35da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:22, skipping insertion in model container [2022-02-21 03:32:22,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:22" (1/1) ... [2022-02-21 03:32:22,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:32:22,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:32:22,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:22,859 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:32:22,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:22,920 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:32:22,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:22 WrapperNode [2022-02-21 03:32:22,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:22,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:22,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:32:22,922 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:32:22,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:22" (1/1) ... [2022-02-21 03:32:22,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:22" (1/1) ... [2022-02-21 03:32:22,965 INFO L137 Inliner]: procedures = 111, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2022-02-21 03:32:22,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:22,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:32:22,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:32:22,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:32:22,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:22" (1/1) ... [2022-02-21 03:32:22,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:22" (1/1) ... [2022-02-21 03:32:22,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:22" (1/1) ... [2022-02-21 03:32:22,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:22" (1/1) ... [2022-02-21 03:32:22,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:22" (1/1) ... [2022-02-21 03:32:22,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:22" (1/1) ... [2022-02-21 03:32:22,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:22" (1/1) ... [2022-02-21 03:32:22,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:32:22,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:32:22,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:32:22,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:32:23,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:22" (1/1) ... [2022-02-21 03:32:23,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:23,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:23,024 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 03:32:23,026 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 03:32:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:32:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:32:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:32:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:32:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:32:23,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:32:23,111 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:32:23,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:32:23,342 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:32:23,346 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:32:23,346 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:32:23,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:23 BoogieIcfgContainer [2022-02-21 03:32:23,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:32:23,349 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:32:23,349 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:32:23,351 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:32:23,352 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:23,352 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:32:22" (1/3) ... [2022-02-21 03:32:23,356 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63a579e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:23, skipping insertion in model container [2022-02-21 03:32:23,356 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:23,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:22" (2/3) ... [2022-02-21 03:32:23,356 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63a579e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:23, skipping insertion in model container [2022-02-21 03:32:23,357 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:23,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:23" (3/3) ... [2022-02-21 03:32:23,358 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrncat-alloca-1.i [2022-02-21 03:32:23,389 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:32:23,389 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:32:23,389 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:32:23,389 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:32:23,389 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:32:23,390 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:32:23,390 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:32:23,390 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:32:23,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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 03:32:23,432 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:32:23,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:23,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:23,437 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:32:23,437 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:32:23,437 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:32:23,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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 03:32:23,443 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:32:23,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:23,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:23,444 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:32:23,445 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:32:23,451 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 16#L564true assume !(main_~length1~0#1 < 1); 17#L564-2true assume !(main_~length2~0#1 < 1); 6#L567-1true assume !(main_~n~0#1 < 1); 18#L570-1true assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~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_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset, cstrncat_#t~mem2#1, cstrncat_#t~post7#1, cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset, cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset, cstrncat_#t~mem5#1, cstrncat_#t~short6#1, cstrncat_#t~mem9#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; 9#L550-3true [2022-02-21 03:32:23,452 INFO L793 eck$LassoCheckResult]: Loop: 9#L550-3true call cstrncat_#t~mem2#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); 19#L550-1true assume !!(0 != cstrncat_#t~mem2#1);havoc cstrncat_#t~mem2#1;cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post3#1.base, 1 + cstrncat_#t~post3#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset; 9#L550-3true [2022-02-21 03:32:23,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2022-02-21 03:32:23,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:23,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048759833] [2022-02-21 03:32:23,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:23,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:23,611 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:23,674 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:23,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:23,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2022-02-21 03:32:23,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:23,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042838718] [2022-02-21 03:32:23,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:23,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:23,695 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:23,705 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:23,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:23,707 INFO L85 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2022-02-21 03:32:23,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:23,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225363155] [2022-02-21 03:32:23,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:23,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:23,757 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:23,774 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:24,415 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:24,415 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:24,416 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:24,416 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:24,416 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:24,416 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:24,416 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:24,416 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:24,417 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncat-alloca-1.i_Iteration1_Lasso [2022-02-21 03:32:24,417 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:24,417 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:24,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:24,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:25,299 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:25,301 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:25,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,304 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 03:32:25,309 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 03:32:25,310 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 03:32:25,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:25,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:25,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:25,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:32:25,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,368 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 03:32:25,372 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 03:32:25,372 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 03:32:25,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:25,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:25,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:25,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,406 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 03:32:25,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,408 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 03:32:25,409 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 03:32:25,410 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 03:32:25,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:25,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:25,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:25,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:32:25,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,448 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 03:32:25,448 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 03:32:25,450 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 03:32:25,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:25,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:25,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,489 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 03:32:25,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,491 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 03:32:25,492 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 03:32:25,494 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 03:32:25,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:25,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:25,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:25,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,519 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 03:32:25,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,521 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 03:32:25,521 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 03:32:25,523 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 03:32:25,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:25,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:25,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:25,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,556 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 03:32:25,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,557 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 03:32:25,564 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 03:32:25,565 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 03:32:25,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:25,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:25,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:25,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:25,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,592 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 03:32:25,593 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 03:32:25,595 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 03:32:25,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:25,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:25,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,633 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 03:32:25,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,635 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 03:32:25,635 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 03:32:25,637 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 03:32:25,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:25,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:25,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:25,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,661 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 03:32:25,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,663 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 03:32:25,663 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 03:32:25,666 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 03:32:25,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:25,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:25,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:25,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,700 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 03:32:25,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,701 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 03:32:25,701 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 03:32:25,729 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 03:32:25,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:25,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:25,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:25,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,764 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 03:32:25,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,765 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 03:32:25,766 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 03:32:25,768 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 03:32:25,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:25,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:25,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,801 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 03:32:25,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,803 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 03:32:25,803 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 03:32:25,805 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 03:32:25,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:25,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:25,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:25,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 03:32:25,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,830 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 03:32:25,831 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 03:32:25,832 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 03:32:25,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:25,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:25,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:25,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,881 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 03:32:25,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,883 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 03:32:25,884 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 03:32:25,886 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 03:32:25,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:25,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:25,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:25,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,925 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 03:32:25,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,927 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 03:32:25,927 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 03:32:25,929 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 03:32:25,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:25,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:25,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:25,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,953 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 03:32:25,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,954 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 03:32:25,955 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 03:32:25,956 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 03:32:25,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:25,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:25,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:25,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:25,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:25,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:25,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:25,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:25,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 03:32:25,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:25,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:25,993 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 03:32:25,994 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 03:32:25,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 03:32:26,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:26,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:26,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:26,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:26,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:26,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:26,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:26,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:26,019 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 03:32:26,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:26,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:26,021 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 03:32:26,024 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 03:32:26,024 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 03:32:26,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:26,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:26,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:26,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:26,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:26,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:26,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:26,062 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 03:32:26,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:26,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:26,063 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 03:32:26,082 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 03:32:26,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:26,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:26,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:26,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:26,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:26,089 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 03:32:26,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:26,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:26,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:26,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:26,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:26,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:26,127 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 03:32:26,131 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 03:32:26,132 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 03:32:26,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:26,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:26,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:26,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:26,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:26,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:26,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:26,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:26,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:32:26,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:26,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:26,168 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 03:32:26,170 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 03:32:26,171 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 03:32:26,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:26,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:26,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:26,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:26,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:26,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:26,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:26,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:26,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:26,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:26,212 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 03:32:26,213 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 03:32:26,214 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 03:32:26,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:26,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:26,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:26,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:26,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:26,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:26,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:26,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:26,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:26,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:26,256 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 03:32:26,257 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 03:32:26,258 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 03:32:26,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:26,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:26,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:26,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:26,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:26,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:26,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:26,299 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 03:32:26,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:26,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:26,301 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 03:32:26,302 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 03:32:26,303 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 03:32:26,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:26,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:26,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:26,310 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:32:26,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:26,311 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:32:26,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:26,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:26,330 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 03:32:26,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:26,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:26,331 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 03:32:26,332 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 03:32:26,333 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 03:32:26,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:26,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:26,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:26,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:26,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:26,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:26,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:26,362 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 03:32:26,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:26,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:26,363 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 03:32:26,364 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 03:32:26,391 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 03:32:26,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:26,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:26,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:26,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:26,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:26,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:26,414 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:26,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:32:26,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:26,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:26,431 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 03:32:26,432 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 03:32:26,433 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 03:32:26,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:26,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:26,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:26,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:26,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:26,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:26,480 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:26,531 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:32:26,531 INFO L444 ModelExtractionUtils]: 16 out of 55 variables were initially zero. Simplification set additionally 36 variables to zero. [2022-02-21 03:32:26,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:26,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:26,555 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 03:32:26,573 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 03:32:26,574 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:26,602 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:26,603 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:26,603 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncat_~s~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_1) = -1*ULTIMATE.start_cstrncat_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_1 Supporting invariants [] [2022-02-21 03:32:26,624 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 03:32:26,665 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2022-02-21 03:32:26,671 INFO L390 LassoCheck]: Loop: "call cstrncat_#t~mem2#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1);" "assume !!(0 != cstrncat_#t~mem2#1);havoc cstrncat_#t~mem2#1;cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post3#1.base, 1 + cstrncat_#t~post3#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset;" [2022-02-21 03:32:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:26,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:26,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:32:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:26,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:26,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {28#unseeded} is VALID [2022-02-21 03:32:26,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {28#unseeded} is VALID [2022-02-21 03:32:26,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#unseeded} assume !(main_~length1~0#1 < 1); {28#unseeded} is VALID [2022-02-21 03:32:26,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#unseeded} assume !(main_~length2~0#1 < 1); {28#unseeded} is VALID [2022-02-21 03:32:26,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#unseeded} assume !(main_~n~0#1 < 1); {28#unseeded} is VALID [2022-02-21 03:32:26,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#unseeded} assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~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_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset, cstrncat_#t~mem2#1, cstrncat_#t~post7#1, cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset, cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset, cstrncat_#t~mem5#1, cstrncat_#t~short6#1, cstrncat_#t~mem9#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; {87#(and (= |ULTIMATE.start_cstrncat_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) unseeded)} is VALID [2022-02-21 03:32:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:26,764 WARN L261 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:32:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:26,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:26,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {88#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_cstrncat_~s~0#1.offset|))) (= |ULTIMATE.start_cstrncat_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrncat_#t~mem2#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); {111#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_cstrncat_~s~0#1.offset|))) (= |ULTIMATE.start_cstrncat_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_cstrncat_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrncat_~s~0#1.base|)))} is VALID [2022-02-21 03:32:26,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {111#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_cstrncat_~s~0#1.offset|))) (= |ULTIMATE.start_cstrncat_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_cstrncat_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrncat_~s~0#1.base|)))} assume !!(0 != cstrncat_#t~mem2#1);havoc cstrncat_#t~mem2#1;cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post3#1.base, 1 + cstrncat_#t~post3#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset; {90#(and (= |ULTIMATE.start_cstrncat_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_cstrncat_~s~0#1.offset|))))))} is VALID [2022-02-21 03:32:26,793 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 03:32:26,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:26,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:26,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:26,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,845 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 03:32:26,847 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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 has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:26,965 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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 has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 73 transitions. Complement of second has 8 states. [2022-02-21 03:32:26,965 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 03:32:26,965 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:26,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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 03:32:26,967 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:32:26,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:26,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:26,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:26,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:32:26,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:26,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:26,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 73 transitions. [2022-02-21 03:32:26,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:26,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:26,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:26,974 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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 03:32:26,976 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:32:26,977 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:32:26,978 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:26,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:32:26,983 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:26,984 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 73 transitions. cyclomatic complexity: 27 [2022-02-21 03:32:26,984 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:26,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:26,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:26,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:26,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:26,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:26,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:26,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:32:26,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:32:26,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:32:26,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 50 letters. Loop has 50 letters. [2022-02-21 03:32:26,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 50 letters. [2022-02-21 03:32:26,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 50 letters. Loop has 50 letters. [2022-02-21 03:32:26,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:32:26,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:32:26,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:32:26,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:26,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:26,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:26,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:26,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:26,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:26,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:26,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:26,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:26,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:26,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:26,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:26,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:27,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:27,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:27,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:27,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:27,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:27,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:27,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:27,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:27,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:27,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:27,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:27,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:27,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:32:27,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:32:27,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:32:27,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:32:27,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:32:27,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:32:27,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:27,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:27,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:27,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,007 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-02-21 03:32:27,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:27,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:27,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:27,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 73 transitions. cyclomatic complexity: 27 [2022-02-21 03:32:27,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:27,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 20 states and 27 transitions. [2022-02-21 03:32:27,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:32:27,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:32:27,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2022-02-21 03:32:27,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:27,029 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 03:32:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2022-02-21 03:32:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-21 03:32:27,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:27,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 27 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 03:32:27,046 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 27 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 03:32:27,048 INFO L87 Difference]: Start difference. First operand 20 states and 27 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 03:32:27,050 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:27,051 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 03:32:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-02-21 03:32:27,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:27,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:27,053 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 20 states and 27 transitions. [2022-02-21 03:32:27,054 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 20 states and 27 transitions. [2022-02-21 03:32:27,055 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:27,060 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2022-02-21 03:32:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2022-02-21 03:32:27,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:27,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:27,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:27,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:27,061 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 03:32:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-02-21 03:32:27,062 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:32:27,062 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:32:27,062 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:32:27,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-02-21 03:32:27,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:27,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:27,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:27,063 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:27,063 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:27,063 INFO L791 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 188#L564 assume !(main_~length1~0#1 < 1); 189#L564-2 assume !(main_~length2~0#1 < 1); 186#L567-1 assume !(main_~n~0#1 < 1); 187#L570-1 assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~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_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset, cstrncat_#t~mem2#1, cstrncat_#t~post7#1, cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset, cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset, cstrncat_#t~mem5#1, cstrncat_#t~short6#1, cstrncat_#t~mem9#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; 190#L550-3 call cstrncat_#t~mem2#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); 191#L550-1 assume !(0 != cstrncat_#t~mem2#1);havoc cstrncat_#t~mem2#1; 184#L552-4 cstrncat_#t~short6#1 := 0 != cstrncat_~n#1; 185#L552 assume !cstrncat_#t~short6#1; 193#L552-2 assume !!cstrncat_#t~short6#1;havoc cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset;havoc cstrncat_#t~mem5#1;havoc cstrncat_#t~short6#1;cstrncat_#t~post7#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post7#1 - 1;havoc cstrncat_#t~post7#1;cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post8#1.base, 1 + cstrncat_#t~post8#1.offset;havoc cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset; 194#L552-4 cstrncat_#t~short6#1 := 0 != cstrncat_~n#1; 183#L552 [2022-02-21 03:32:27,063 INFO L793 eck$LassoCheckResult]: Loop: 183#L552 assume !cstrncat_#t~short6#1; 177#L552-2 assume !!cstrncat_#t~short6#1;havoc cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset;havoc cstrncat_#t~mem5#1;havoc cstrncat_#t~short6#1;cstrncat_#t~post7#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post7#1 - 1;havoc cstrncat_#t~post7#1;cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post8#1.base, 1 + cstrncat_#t~post8#1.offset;havoc cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset; 178#L552-4 cstrncat_#t~short6#1 := 0 != cstrncat_~n#1; 183#L552 [2022-02-21 03:32:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2022-02-21 03:32:27,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:27,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675638989] [2022-02-21 03:32:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:27,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {303#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {303#true} is VALID [2022-02-21 03:32:27,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {303#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {303#true} is VALID [2022-02-21 03:32:27,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {303#true} assume !(main_~length1~0#1 < 1); {303#true} is VALID [2022-02-21 03:32:27,126 INFO L290 TraceCheckUtils]: 3: Hoare triple {303#true} assume !(main_~length2~0#1 < 1); {303#true} is VALID [2022-02-21 03:32:27,126 INFO L290 TraceCheckUtils]: 4: Hoare triple {303#true} assume !(main_~n~0#1 < 1); {303#true} is VALID [2022-02-21 03:32:27,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {303#true} assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~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_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset, cstrncat_#t~mem2#1, cstrncat_#t~post7#1, cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset, cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset, cstrncat_#t~mem5#1, cstrncat_#t~short6#1, cstrncat_#t~mem9#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; {303#true} is VALID [2022-02-21 03:32:27,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {303#true} call cstrncat_#t~mem2#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); {303#true} is VALID [2022-02-21 03:32:27,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {303#true} assume !(0 != cstrncat_#t~mem2#1);havoc cstrncat_#t~mem2#1; {303#true} is VALID [2022-02-21 03:32:27,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {303#true} cstrncat_#t~short6#1 := 0 != cstrncat_~n#1; {303#true} is VALID [2022-02-21 03:32:27,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {303#true} assume !cstrncat_#t~short6#1; {305#(not |ULTIMATE.start_cstrncat_#t~short6#1|)} is VALID [2022-02-21 03:32:27,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {305#(not |ULTIMATE.start_cstrncat_#t~short6#1|)} assume !!cstrncat_#t~short6#1;havoc cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset;havoc cstrncat_#t~mem5#1;havoc cstrncat_#t~short6#1;cstrncat_#t~post7#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post7#1 - 1;havoc cstrncat_#t~post7#1;cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post8#1.base, 1 + cstrncat_#t~post8#1.offset;havoc cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset; {304#false} is VALID [2022-02-21 03:32:27,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {304#false} cstrncat_#t~short6#1 := 0 != cstrncat_~n#1; {304#false} is VALID [2022-02-21 03:32:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:27,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:27,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675638989] [2022-02-21 03:32:27,128 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675638989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:27,128 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:27,128 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:32:27,128 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081427697] [2022-02-21 03:32:27,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:27,130 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:32:27,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:27,131 INFO L85 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2022-02-21 03:32:27,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:27,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141763597] [2022-02-21 03:32:27,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:27,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:27,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {306#true} assume !cstrncat_#t~short6#1; {308#(not |ULTIMATE.start_cstrncat_#t~short6#1|)} is VALID [2022-02-21 03:32:27,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {308#(not |ULTIMATE.start_cstrncat_#t~short6#1|)} assume !!cstrncat_#t~short6#1;havoc cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset;havoc cstrncat_#t~mem5#1;havoc cstrncat_#t~short6#1;cstrncat_#t~post7#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post7#1 - 1;havoc cstrncat_#t~post7#1;cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post8#1.base, 1 + cstrncat_#t~post8#1.offset;havoc cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset; {307#false} is VALID [2022-02-21 03:32:27,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#false} cstrncat_#t~short6#1 := 0 != cstrncat_~n#1; {307#false} is VALID [2022-02-21 03:32:27,144 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 03:32:27,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:27,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141763597] [2022-02-21 03:32:27,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141763597] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:27,147 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:27,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:32:27,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386190498] [2022-02-21 03:32:27,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:27,148 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:32:27,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:27,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:32:27,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:32:27,151 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 03:32:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:27,176 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-02-21 03:32:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:32:27,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 03:32:27,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:27,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2022-02-21 03:32:27,181 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:27,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2022-02-21 03:32:27,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:32:27,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:32:27,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:32:27,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:27,181 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:27,181 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:27,181 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:27,181 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:32:27,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:32:27,181 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:27,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:27,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:32:27 BoogieIcfgContainer [2022-02-21 03:32:27,186 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:32:27,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:32:27,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:32:27,187 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:32:27,187 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:23" (3/4) ... [2022-02-21 03:32:27,189 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:32:27,189 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:32:27,190 INFO L158 Benchmark]: Toolchain (without parser) took 4592.52ms. Allocated memory was 88.1MB in the beginning and 155.2MB in the end (delta: 67.1MB). Free memory was 51.1MB in the beginning and 74.8MB in the end (delta: -23.6MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2022-02-21 03:32:27,190 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 88.1MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:27,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.13ms. Allocated memory was 88.1MB in the beginning and 127.9MB in the end (delta: 39.8MB). Free memory was 50.9MB in the beginning and 96.5MB in the end (delta: -45.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:32:27,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.08ms. Allocated memory is still 127.9MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:27,195 INFO L158 Benchmark]: Boogie Preprocessor took 23.03ms. Allocated memory is still 127.9MB. Free memory was 94.4MB in the beginning and 92.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:27,195 INFO L158 Benchmark]: RCFGBuilder took 358.10ms. Allocated memory is still 127.9MB. Free memory was 92.7MB in the beginning and 78.9MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:32:27,195 INFO L158 Benchmark]: BuchiAutomizer took 3837.36ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 78.5MB in the beginning and 74.8MB in the end (delta: 3.7MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2022-02-21 03:32:27,195 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 155.2MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:27,196 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 88.1MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.13ms. Allocated memory was 88.1MB in the beginning and 127.9MB in the end (delta: 39.8MB). Free memory was 50.9MB in the beginning and 96.5MB in the end (delta: -45.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.08ms. Allocated memory is still 127.9MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.03ms. Allocated memory is still 127.9MB. Free memory was 94.4MB in the beginning and 92.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 358.10ms. Allocated memory is still 127.9MB. Free memory was 92.7MB in the beginning and 78.9MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3837.36ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 78.5MB in the beginning and 74.8MB in the end (delta: 3.7MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 155.2MB. Free memory is still 74.8MB. 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 3.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 34 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital195 mio100 ax109 hnf100 lsp88 ukn78 mio100 lsp51 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:32:27,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:27,443 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