./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrncmp_mixed_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-15/cstrncmp_mixed_alloca.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 8073940322b86f31cbfc905281bb42e15edc78a9ca8cdc6bd61dc1df37f3cf2e --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 01:43:21,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:43:21,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:43:21,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:43:21,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:43:21,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:43:21,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:43:21,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:43:21,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:43:21,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:43:21,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:43:21,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:43:21,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:43:21,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:43:21,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:43:21,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:43:21,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:43:21,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:43:21,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:43:21,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:43:21,597 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:43:21,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:43:21,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:43:21,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:43:21,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:43:21,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:43:21,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:43:21,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:43:21,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:43:21,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:43:21,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:43:21,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:43:21,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:43:21,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:43:21,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:43:21,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:43:21,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:43:21,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:43:21,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:43:21,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:43:21,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:43:21,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:43:21,623 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-22 01:43:21,654 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:43:21,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:43:21,655 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:43:21,655 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:43:21,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:43:21,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:43:21,657 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:43:21,657 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:43:21,658 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:43:21,658 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:43:21,659 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:43:21,659 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:43:21,659 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:43:21,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:43:21,669 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:43:21,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:43:21,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:43:21,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:43:21,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:43:21,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:43:21,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:43:21,671 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:43:21,671 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:43:21,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:43:21,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:43:21,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:43:21,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:43:21,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:43:21,675 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:43:21,675 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 -> 8073940322b86f31cbfc905281bb42e15edc78a9ca8cdc6bd61dc1df37f3cf2e [2022-07-22 01:43:21,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:43:21,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:43:21,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:43:21,986 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:43:21,986 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:43:21,987 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncmp_mixed_alloca.i [2022-07-22 01:43:22,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1668835c/bc79f4632873413a82ca084be3a97ae0/FLAG76bd279b5 [2022-07-22 01:43:22,497 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:43:22,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncmp_mixed_alloca.i [2022-07-22 01:43:22,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1668835c/bc79f4632873413a82ca084be3a97ae0/FLAG76bd279b5 [2022-07-22 01:43:22,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1668835c/bc79f4632873413a82ca084be3a97ae0 [2022-07-22 01:43:22,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:43:22,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:43:22,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:43:22,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:43:22,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:43:22,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:43:22" (1/1) ... [2022-07-22 01:43:22,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f35b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:22, skipping insertion in model container [2022-07-22 01:43:22,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:43:22" (1/1) ... [2022-07-22 01:43:22,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:43:22,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:43:22,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:43:22,930 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:43:22,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:43:23,000 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:43:23,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:23 WrapperNode [2022-07-22 01:43:23,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:43:23,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:43:23,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:43:23,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:43:23,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:23" (1/1) ... [2022-07-22 01:43:23,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:23" (1/1) ... [2022-07-22 01:43:23,061 INFO L137 Inliner]: procedures = 153, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 109 [2022-07-22 01:43:23,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:43:23,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:43:23,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:43:23,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:43:23,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:23" (1/1) ... [2022-07-22 01:43:23,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:23" (1/1) ... [2022-07-22 01:43:23,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:23" (1/1) ... [2022-07-22 01:43:23,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:23" (1/1) ... [2022-07-22 01:43:23,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:23" (1/1) ... [2022-07-22 01:43:23,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:23" (1/1) ... [2022-07-22 01:43:23,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:23" (1/1) ... [2022-07-22 01:43:23,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:43:23,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:43:23,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:43:23,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:43:23,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:23" (1/1) ... [2022-07-22 01:43:23,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:23,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:23,132 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-07-22 01:43:23,135 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-07-22 01:43:23,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 01:43:23,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 01:43:23,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 01:43:23,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 01:43:23,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:43:23,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:43:23,219 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:43:23,221 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:43:23,463 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:43:23,468 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:43:23,468 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 01:43:23,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:43:23 BoogieIcfgContainer [2022-07-22 01:43:23,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:43:23,470 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:43:23,470 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:43:23,473 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:43:23,473 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:43:23,473 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:43:22" (1/3) ... [2022-07-22 01:43:23,474 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@500111b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:43:23, skipping insertion in model container [2022-07-22 01:43:23,474 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:43:23,474 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:43:23" (2/3) ... [2022-07-22 01:43:23,475 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@500111b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:43:23, skipping insertion in model container [2022-07-22 01:43:23,475 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:43:23,475 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:43:23" (3/3) ... [2022-07-22 01:43:23,476 INFO L354 chiAutomizerObserver]: Analyzing ICFG cstrncmp_mixed_alloca.i [2022-07-22 01:43:23,515 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:43:23,516 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:43:23,516 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:43:23,516 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:43:23,516 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:43:23,516 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:43:23,516 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:43:23,517 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:43:23,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:23,537 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-22 01:43:23,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:43:23,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:43:23,556 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 01:43:23,557 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:43:23,557 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:43:23,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:23,559 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-22 01:43:23,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:43:23,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:43:23,560 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 01:43:23,560 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:43:23,570 INFO L752 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~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 3#L383true assume !(main_~length1~0#1 < 1); 11#L383-2true assume !(main_~length2~0#1 < 1); 12#L386-1true call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 24#L391-3true [2022-07-22 01:43:23,570 INFO L754 eck$LassoCheckResult]: Loop: 24#L391-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; 5#L391-2true main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; 24#L391-3true [2022-07-22 01:43:23,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:23,575 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-07-22 01:43:23,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:23,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258466181] [2022-07-22 01:43:23,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:23,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:23,688 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:23,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:23,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:23,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-07-22 01:43:23,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:23,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877156971] [2022-07-22 01:43:23,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:23,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:23,757 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:23,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:23,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:23,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-07-22 01:43:23,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:23,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105446900] [2022-07-22 01:43:23,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:23,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:23,812 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:23,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:24,194 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:43:24,195 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:43:24,195 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:43:24,195 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:43:24,195 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:43:24,196 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:24,196 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:43:24,196 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:43:24,196 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_mixed_alloca.i_Iteration1_Lasso [2022-07-22 01:43:24,196 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:43:24,197 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:43:24,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:24,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:24,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:24,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:24,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:24,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:24,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:24,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:24,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:24,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:24,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:24,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:24,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:24,681 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:43:24,685 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:43:24,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:24,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:24,691 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-07-22 01:43:24,702 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-07-22 01:43:24,703 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-07-22 01:43:24,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:24,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:24,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:24,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:24,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:24,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:24,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:24,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:24,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:24,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:24,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:24,756 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-07-22 01:43:24,766 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-07-22 01:43:24,766 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-07-22 01:43:24,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:24,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:24,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:24,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:24,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:24,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:24,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:24,824 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-07-22 01:43:24,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:24,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:24,826 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-07-22 01:43:24,833 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-07-22 01:43:24,834 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-07-22 01:43:24,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:24,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:24,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:24,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:24,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:24,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:24,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:24,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:24,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:24,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:24,882 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-07-22 01:43:24,885 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-07-22 01:43:24,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-07-22 01:43:24,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:24,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:24,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:24,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:24,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:24,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:24,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:24,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:24,915 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-07-22 01:43:24,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:24,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:24,916 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-07-22 01:43:24,917 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-07-22 01:43:24,918 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-07-22 01:43:24,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:24,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:24,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:24,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:24,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:24,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:24,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:24,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:24,951 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-07-22 01:43:24,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:24,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:24,953 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-07-22 01:43:24,954 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-07-22 01:43:24,955 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-07-22 01:43:24,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:24,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:24,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:24,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:24,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:24,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:24,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:25,009 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-07-22 01:43:25,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:25,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:25,011 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-07-22 01:43:25,011 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-07-22 01:43:25,017 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-07-22 01:43:25,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:25,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:25,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:25,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:25,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:25,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:25,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:25,070 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-07-22 01:43:25,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:25,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:25,071 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-07-22 01:43:25,072 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-07-22 01:43:25,073 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-07-22 01:43:25,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:25,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:25,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:25,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:25,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:25,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:25,111 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:43:25,150 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-22 01:43:25,150 INFO L444 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-07-22 01:43:25,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:25,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:25,171 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-07-22 01:43:25,235 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-07-22 01:43:25,236 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:43:25,253 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:43:25,254 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:43:25,254 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length1~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-22 01:43:25,280 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-07-22 01:43:25,299 INFO L293 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-07-22 01:43:25,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:25,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:43:25,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:43:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:25,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:43:25,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:43:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:43:25,423 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-07-22 01:43:25,447 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-07-22 01:43:25,448 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:25,486 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 91 transitions. Complement of second has 7 states. [2022-07-22 01:43:25,487 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-07-22 01:43:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-07-22 01:43:25,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 01:43:25,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:43:25,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 01:43:25,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:43:25,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-22 01:43:25,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:43:25,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 91 transitions. [2022-07-22 01:43:25,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-22 01:43:25,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 18 states and 25 transitions. [2022-07-22 01:43:25,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-22 01:43:25,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-22 01:43:25,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-07-22 01:43:25,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:43:25,503 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-22 01:43:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-07-22 01:43:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-22 01:43:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-07-22 01:43:25,523 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-22 01:43:25,523 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-22 01:43:25,523 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:43:25,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-07-22 01:43:25,524 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-22 01:43:25,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:43:25,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:43:25,525 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:43:25,525 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:43:25,525 INFO L752 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 156#L383 assume !(main_~length1~0#1 < 1); 157#L383-2 assume !(main_~length2~0#1 < 1); 169#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 170#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 172#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 162#L396-3 [2022-07-22 01:43:25,525 INFO L754 eck$LassoCheckResult]: Loop: 162#L396-3 assume !!(main_~i~1#1 > 0);call write~int(main_#t~nondet223#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet223#1; 164#L396-2 main_#t~post222#1 := main_~i~1#1;main_~i~1#1 := main_#t~post222#1 - 1;havoc main_#t~post222#1; 162#L396-3 [2022-07-22 01:43:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:25,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-07-22 01:43:25,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:25,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771652417] [2022-07-22 01:43:25,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:25,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:25,541 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:25,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:25,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:25,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-07-22 01:43:25,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:25,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768716247] [2022-07-22 01:43:25,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:25,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:25,557 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:25,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:25,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-07-22 01:43:25,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:25,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611366039] [2022-07-22 01:43:25,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:25,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:25,575 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:25,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:25,904 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:43:25,905 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:43:25,905 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:43:25,905 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:43:25,905 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:43:25,905 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:25,905 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:43:25,905 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:43:25,905 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_mixed_alloca.i_Iteration2_Lasso [2022-07-22 01:43:25,905 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:43:25,905 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:43:25,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:25,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:25,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:25,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:25,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:25,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:26,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:26,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:26,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:26,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:26,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:26,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:26,330 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:43:26,330 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:43:26,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:26,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:26,336 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-07-22 01:43:26,337 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-07-22 01:43:26,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:26,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:26,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:26,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:26,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:26,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:26,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:26,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:26,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:26,387 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-07-22 01:43:26,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:26,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:26,389 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-07-22 01:43:26,398 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-07-22 01:43:26,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:26,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:26,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:26,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:26,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:26,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:26,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:26,409 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-07-22 01:43:26,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:26,442 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-07-22 01:43:26,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:26,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:26,444 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-07-22 01:43:26,445 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-07-22 01:43:26,447 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-07-22 01:43:26,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:26,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:26,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:26,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:26,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:26,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:26,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:26,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:26,495 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-07-22 01:43:26,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:26,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:26,496 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-07-22 01:43:26,498 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-07-22 01:43:26,499 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-07-22 01:43:26,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:26,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:26,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:26,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:26,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:26,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:26,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:26,522 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:26,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:26,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:26,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:26,549 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-07-22 01:43:26,550 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-07-22 01:43:26,552 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-07-22 01:43:26,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:26,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:26,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:26,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:26,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:26,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:26,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:26,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:26,599 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-07-22 01:43:26,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:26,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:26,601 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-07-22 01:43:26,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:43:26,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:26,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:26,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:26,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:26,619 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-07-22 01:43:26,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:26,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:26,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:26,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-22 01:43:26,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:26,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:26,657 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-07-22 01:43:26,658 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-07-22 01:43:26,659 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-07-22 01:43:26,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:26,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:26,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:26,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:26,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:26,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:26,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:26,711 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-07-22 01:43:26,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:26,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:26,714 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-07-22 01:43:26,722 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-07-22 01:43:26,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:26,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:26,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:26,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:26,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:26,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:26,748 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:43:26,749 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-07-22 01:43:26,773 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-22 01:43:26,773 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-22 01:43:26,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:26,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:26,776 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-07-22 01:43:26,779 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-07-22 01:43:26,780 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:43:26,804 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:43:26,804 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:43:26,804 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2022-07-22 01:43:26,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:26,845 INFO L293 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2022-07-22 01:43:26,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:26,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:43:26,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:43:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:26,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:43:26,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:43:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:43:26,909 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-07-22 01:43:26,909 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:26,933 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 40 transitions. Complement of second has 6 states. [2022-07-22 01:43:26,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 01:43:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-07-22 01:43:26,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 01:43:26,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:43:26,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 01:43:26,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:43:26,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-22 01:43:26,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:43:26,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 40 transitions. [2022-07-22 01:43:26,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:43:26,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 19 states and 27 transitions. [2022-07-22 01:43:26,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-22 01:43:26,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-22 01:43:26,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2022-07-22 01:43:26,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:43:26,942 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-07-22 01:43:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2022-07-22 01:43:26,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-22 01:43:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2022-07-22 01:43:26,943 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-07-22 01:43:26,943 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-07-22 01:43:26,943 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:43:26,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2022-07-22 01:43:26,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:43:26,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:43:26,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:43:26,944 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:43:26,944 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:43:26,945 INFO L752 eck$LassoCheckResult]: Stem: 291#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 292#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 287#L383 assume !(main_~length1~0#1 < 1); 288#L383-2 assume !(main_~length2~0#1 < 1); 301#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 302#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 304#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 293#L396-3 assume !(main_~i~1#1 > 0); 294#L396-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 299#L368 assume !(0 == cstrncmp_~n#1); 300#L370-5 [2022-07-22 01:43:26,945 INFO L754 eck$LassoCheckResult]: Loop: 300#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 303#L370-1 assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; 297#L370-3 assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; 298#L371 assume cstrncmp_#t~short210#1; 305#L371-2 assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 300#L370-5 [2022-07-22 01:43:26,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:26,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1595220890, now seen corresponding path program 1 times [2022-07-22 01:43:26,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:26,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186223375] [2022-07-22 01:43:26,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:26,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:26,961 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:26,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:26,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:26,975 INFO L85 PathProgramCache]: Analyzing trace with hash 79307716, now seen corresponding path program 1 times [2022-07-22 01:43:26,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:26,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682372364] [2022-07-22 01:43:26,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:26,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:43:27,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:43:27,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682372364] [2022-07-22 01:43:27,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682372364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:43:27,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:43:27,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 01:43:27,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532517367] [2022-07-22 01:43:27,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:43:27,012 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:43:27,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:43:27,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:43:27,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:43:27,015 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 11 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:43:27,023 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-07-22 01:43:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:43:27,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2022-07-22 01:43:27,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:43:27,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 26 transitions. [2022-07-22 01:43:27,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-22 01:43:27,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-22 01:43:27,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-07-22 01:43:27,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:43:27,026 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-22 01:43:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-07-22 01:43:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-22 01:43:27,027 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-07-22 01:43:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-07-22 01:43:27,028 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-22 01:43:27,028 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-22 01:43:27,028 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:43:27,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-07-22 01:43:27,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:43:27,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:43:27,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:43:27,029 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:43:27,029 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:43:27,030 INFO L752 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 335#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 332#L383 assume !(main_~length1~0#1 < 1); 333#L383-2 assume !(main_~length2~0#1 < 1); 346#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 347#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 349#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 338#L396-3 assume !(main_~i~1#1 > 0); 339#L396-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 344#L368 assume !(0 == cstrncmp_~n#1); 345#L370-5 [2022-07-22 01:43:27,030 INFO L754 eck$LassoCheckResult]: Loop: 345#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 348#L370-1 assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; 342#L370-3 assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; 343#L371 assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; 350#L371-2 assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 345#L370-5 [2022-07-22 01:43:27,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1595220890, now seen corresponding path program 2 times [2022-07-22 01:43:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:27,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979817787] [2022-07-22 01:43:27,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:27,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:27,063 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:27,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:27,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:27,082 INFO L85 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 1 times [2022-07-22 01:43:27,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:27,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017590312] [2022-07-22 01:43:27,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:27,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:27,095 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:27,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:27,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:27,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1988601847, now seen corresponding path program 1 times [2022-07-22 01:43:27,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:27,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281196149] [2022-07-22 01:43:27,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:27,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:27,179 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-07-22 01:43:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:43:27,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:43:27,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281196149] [2022-07-22 01:43:27,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281196149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:43:27,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:43:27,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 01:43:27,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939554322] [2022-07-22 01:43:27,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:43:27,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:43:27,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 01:43:27,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 01:43:27,468 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:43:27,550 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-07-22 01:43:27,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 01:43:27,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2022-07-22 01:43:27,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:43:27,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2022-07-22 01:43:27,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-22 01:43:27,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-22 01:43:27,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2022-07-22 01:43:27,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:43:27,553 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-22 01:43:27,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2022-07-22 01:43:27,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-07-22 01:43:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-07-22 01:43:27,555 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-07-22 01:43:27,561 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-07-22 01:43:27,561 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:43:27,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2022-07-22 01:43:27,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:43:27,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:43:27,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:43:27,562 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:43:27,562 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:43:27,562 INFO L752 eck$LassoCheckResult]: Stem: 403#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 404#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 401#L383 assume !(main_~length1~0#1 < 1); 402#L383-2 assume !(main_~length2~0#1 < 1); 415#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 416#L391-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; 405#L391-2 main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; 406#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 418#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 407#L396-3 assume !(main_~i~1#1 > 0); 408#L396-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 413#L368 assume !(0 == cstrncmp_~n#1); 414#L370-5 [2022-07-22 01:43:27,562 INFO L754 eck$LassoCheckResult]: Loop: 414#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 417#L370-1 assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; 411#L370-3 assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; 412#L371 assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; 419#L371-2 assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 414#L370-5 [2022-07-22 01:43:27,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:27,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1351083896, now seen corresponding path program 1 times [2022-07-22 01:43:27,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:27,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931892735] [2022-07-22 01:43:27,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:27,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:27,578 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:27,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:27,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:27,589 INFO L85 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 2 times [2022-07-22 01:43:27,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:27,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136714329] [2022-07-22 01:43:27,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:27,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:27,596 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:27,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:27,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:27,601 INFO L85 PathProgramCache]: Analyzing trace with hash -350531861, now seen corresponding path program 1 times [2022-07-22 01:43:27,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:27,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014550905] [2022-07-22 01:43:27,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:27,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 01:43:27,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:43:27,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014550905] [2022-07-22 01:43:27,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014550905] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:43:27,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:43:27,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 01:43:27,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570900465] [2022-07-22 01:43:27,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:43:27,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:43:27,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 01:43:27,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-22 01:43:27,894 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:28,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:43:28,017 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-07-22 01:43:28,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 01:43:28,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2022-07-22 01:43:28,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:43:28,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 33 transitions. [2022-07-22 01:43:28,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-07-22 01:43:28,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-07-22 01:43:28,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33 transitions. [2022-07-22 01:43:28,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:43:28,020 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-07-22 01:43:28,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 33 transitions. [2022-07-22 01:43:28,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-22 01:43:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 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-07-22 01:43:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-07-22 01:43:28,023 INFO L392 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-07-22 01:43:28,023 INFO L374 stractBuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-07-22 01:43:28,023 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:43:28,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2022-07-22 01:43:28,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:43:28,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:43:28,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:43:28,024 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:43:28,024 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:43:28,024 INFO L752 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 477#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 474#L383 assume !(main_~length1~0#1 < 1); 475#L383-2 assume !(main_~length2~0#1 < 1); 489#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 490#L391-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; 478#L391-2 main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; 479#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 492#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 480#L396-3 assume !(main_~i~1#1 > 0); 481#L396-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 496#L368 assume !(0 == cstrncmp_~n#1); 495#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 491#L370-1 assume !cstrncmp_#t~short208#1; 485#L370-3 [2022-07-22 01:43:28,024 INFO L754 eck$LassoCheckResult]: Loop: 485#L370-3 assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; 486#L371 assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; 493#L371-2 assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 488#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 494#L370-1 assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; 485#L370-3 [2022-07-22 01:43:28,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:28,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1311502365, now seen corresponding path program 1 times [2022-07-22 01:43:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:28,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300110654] [2022-07-22 01:43:28,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:28,050 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:28,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:28,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:28,073 INFO L85 PathProgramCache]: Analyzing trace with hash 89863848, now seen corresponding path program 3 times [2022-07-22 01:43:28,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:28,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257158791] [2022-07-22 01:43:28,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:28,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:28,079 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:28,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:28,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:28,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1796409332, now seen corresponding path program 1 times [2022-07-22 01:43:28,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:28,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896727666] [2022-07-22 01:43:28,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:28,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 01:43:28,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:43:28,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896727666] [2022-07-22 01:43:28,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896727666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:43:28,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:43:28,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:43:28,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336455270] [2022-07-22 01:43:28,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:43:28,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:43:28,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:43:28,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:43:28,349 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:43:28,354 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-07-22 01:43:28,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:43:28,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2022-07-22 01:43:28,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:43:28,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 23 transitions. [2022-07-22 01:43:28,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-22 01:43:28,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-22 01:43:28,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2022-07-22 01:43:28,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:43:28,356 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-22 01:43:28,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2022-07-22 01:43:28,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-22 01:43:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-22 01:43:28,358 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-22 01:43:28,358 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-22 01:43:28,358 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 01:43:28,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2022-07-22 01:43:28,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:43:28,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:43:28,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:43:28,359 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:43:28,359 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:43:28,359 INFO L752 eck$LassoCheckResult]: Stem: 531#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 532#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 529#L383 assume !(main_~length1~0#1 < 1); 530#L383-2 assume !(main_~length2~0#1 < 1); 543#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 544#L391-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; 533#L391-2 main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; 534#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 546#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 535#L396-3 assume !!(main_~i~1#1 > 0);call write~int(main_#t~nondet223#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet223#1; 536#L396-2 main_#t~post222#1 := main_~i~1#1;main_~i~1#1 := main_#t~post222#1 - 1;havoc main_#t~post222#1; 537#L396-3 assume !(main_~i~1#1 > 0); 538#L396-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 541#L368 assume !(0 == cstrncmp_~n#1); 542#L370-5 [2022-07-22 01:43:28,359 INFO L754 eck$LassoCheckResult]: Loop: 542#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 545#L370-1 assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; 539#L370-3 assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; 540#L371 assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; 547#L371-2 assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 542#L370-5 [2022-07-22 01:43:28,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:28,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1313217430, now seen corresponding path program 1 times [2022-07-22 01:43:28,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:28,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595471582] [2022-07-22 01:43:28,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:28,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:28,371 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:28,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:28,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:28,382 INFO L85 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 4 times [2022-07-22 01:43:28,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:28,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535620522] [2022-07-22 01:43:28,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:28,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:28,386 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:28,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:28,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:28,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1018233459, now seen corresponding path program 1 times [2022-07-22 01:43:28,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:43:28,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985999729] [2022-07-22 01:43:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:43:28,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:43:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:28,404 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:43:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:43:28,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:43:29,383 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:43:29,383 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:43:29,383 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:43:29,383 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:43:29,383 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:43:29,383 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:29,384 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:43:29,384 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:43:29,384 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_mixed_alloca.i_Iteration7_Lasso [2022-07-22 01:43:29,384 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:43:29,384 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:43:29,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:29,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:29,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:29,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:43:30,566 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:43:30,566 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:43:30,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:30,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:30,571 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-07-22 01:43:30,575 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-07-22 01:43:30,575 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-07-22 01:43:30,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:30,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:30,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:30,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:30,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:30,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:30,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:30,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:30,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-22 01:43:30,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:30,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:30,599 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-07-22 01:43:30,599 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-07-22 01:43:30,601 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-07-22 01:43:30,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:30,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:30,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:30,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:30,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:30,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:30,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:30,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:30,622 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-07-22 01:43:30,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:30,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:30,624 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-07-22 01:43:30,625 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-07-22 01:43:30,626 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-07-22 01:43:30,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:30,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:43:30,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:30,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:30,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:30,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:43:30,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:43:30,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:30,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 01:43:30,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:30,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:30,651 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-07-22 01:43:30,651 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-07-22 01:43:30,652 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-07-22 01:43:30,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:30,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:30,659 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 01:43:30,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:30,670 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-22 01:43:30,671 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-22 01:43:30,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:43:30,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 01:43:30,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:30,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:30,700 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-07-22 01:43:30,700 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-07-22 01:43:30,702 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-07-22 01:43:30,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:43:30,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:43:30,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:43:30,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:43:30,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:43:30,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:43:30,747 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:43:30,809 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-07-22 01:43:30,809 INFO L444 ModelExtractionUtils]: 11 out of 52 variables were initially zero. Simplification set additionally 38 variables to zero. [2022-07-22 01:43:30,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:43:30,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:43:30,812 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-07-22 01:43:30,819 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:43:30,827 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-07-22 01:43:30,840 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:43:30,840 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:43:30,840 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s2#1.offset) = 2*ULTIMATE.start_cstrncmp_~s2#1.offset + 1 Supporting invariants [] [2022-07-22 01:43:30,866 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-07-22 01:43:30,935 INFO L293 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2022-07-22 01:43:30,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:43:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:30,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:43:30,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:43:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:43:31,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:43:31,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:43:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:43:31,023 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-07-22 01:43:31,023 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:31,034 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 29 transitions. Complement of second has 6 states. [2022-07-22 01:43:31,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 01:43:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:43:31,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-07-22 01:43:31,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 14 letters. Loop has 5 letters. [2022-07-22 01:43:31,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:43:31,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 5 letters. [2022-07-22 01:43:31,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:43:31,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 14 letters. Loop has 10 letters. [2022-07-22 01:43:31,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:43:31,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2022-07-22 01:43:31,042 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 01:43:31,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2022-07-22 01:43:31,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 01:43:31,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 01:43:31,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 01:43:31,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:43:31,043 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:43:31,043 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:43:31,043 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:43:31,043 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 01:43:31,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 01:43:31,043 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 01:43:31,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 01:43:31,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 01:43:31 BoogieIcfgContainer [2022-07-22 01:43:31,050 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 01:43:31,050 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 01:43:31,050 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 01:43:31,051 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 01:43:31,051 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:43:23" (3/4) ... [2022-07-22 01:43:31,054 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 01:43:31,054 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 01:43:31,055 INFO L158 Benchmark]: Toolchain (without parser) took 8521.85ms. Allocated memory was 50.3MB in the beginning and 117.4MB in the end (delta: 67.1MB). Free memory was 25.8MB in the beginning and 51.2MB in the end (delta: -25.4MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2022-07-22 01:43:31,055 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 50.3MB. Free memory is still 32.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:43:31,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.61ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 25.7MB in the beginning and 40.6MB in the end (delta: -14.8MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2022-07-22 01:43:31,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.92ms. Allocated memory is still 65.0MB. Free memory was 40.6MB in the beginning and 38.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 01:43:31,056 INFO L158 Benchmark]: Boogie Preprocessor took 43.29ms. Allocated memory is still 65.0MB. Free memory was 38.4MB in the beginning and 37.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 01:43:31,056 INFO L158 Benchmark]: RCFGBuilder took 363.31ms. Allocated memory is still 65.0MB. Free memory was 37.1MB in the beginning and 42.2MB in the end (delta: -5.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-07-22 01:43:31,057 INFO L158 Benchmark]: BuchiAutomizer took 7579.57ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 41.9MB in the beginning and 51.2MB in the end (delta: -9.3MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2022-07-22 01:43:31,057 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 117.4MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:43:31,059 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 50.3MB. Free memory is still 32.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.61ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 25.7MB in the beginning and 40.6MB in the end (delta: -14.8MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.92ms. Allocated memory is still 65.0MB. Free memory was 40.6MB in the beginning and 38.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.29ms. Allocated memory is still 65.0MB. Free memory was 38.4MB in the beginning and 37.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 363.31ms. Allocated memory is still 65.0MB. Free memory was 37.1MB in the beginning and 42.2MB in the end (delta: -5.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 7579.57ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 41.9MB in the beginning and 51.2MB in the end (delta: -9.3MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 117.4MB. Free memory is still 51.2MB. 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 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function 2 * s2 + 1 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 6.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 361 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 223 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 159 IncrementalHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 138 mSDtfsCounter, 159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital182 mio100 ax100 hnf100 lsp90 ukn87 mio100 lsp47 div100 bol100 ite100 ukn100 eq175 hnf90 smp98 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-22 01:43:31,093 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-07-22 01:43:31,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE