./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrncmp_malloc.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrncmp_malloc.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 07cafa1f9519843f2b8d909d6b6846450a036212f05cff70dc81df70ec1a4c49 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:13,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:13,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:13,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:13,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:13,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:13,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:13,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:13,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:13,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:13,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:13,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:13,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:13,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:13,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:13,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:13,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:13,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:13,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:13,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:13,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:13,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:13,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:13,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:13,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:13,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:13,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:13,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:13,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:13,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:13,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:13,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:13,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:13,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:13,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:13,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:13,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:13,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:13,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:13,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:13,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:13,151 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:35:13,177 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:13,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:13,178 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:13,178 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:13,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:13,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:13,179 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:13,180 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:13,180 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:13,180 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:13,180 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:13,181 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:13,181 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:13,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:13,181 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:13,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:13,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:13,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:13,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:13,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:13,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:13,182 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:13,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:13,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:13,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:13,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:13,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:13,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:13,184 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:13,184 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 -> 07cafa1f9519843f2b8d909d6b6846450a036212f05cff70dc81df70ec1a4c49 [2022-02-21 03:35:13,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:13,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:13,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:13,402 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:13,402 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:13,403 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncmp_malloc.i [2022-02-21 03:35:13,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/523cb5106/875cabf7f5334b8b8fc15f233c00daab/FLAGce05b83dc [2022-02-21 03:35:13,909 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:13,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncmp_malloc.i [2022-02-21 03:35:13,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/523cb5106/875cabf7f5334b8b8fc15f233c00daab/FLAGce05b83dc [2022-02-21 03:35:13,932 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/523cb5106/875cabf7f5334b8b8fc15f233c00daab [2022-02-21 03:35:13,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:13,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:13,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:13,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:13,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:13,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:13" (1/1) ... [2022-02-21 03:35:13,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18003884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:13, skipping insertion in model container [2022-02-21 03:35:13,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:13" (1/1) ... [2022-02-21 03:35:13,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:13,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:14,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:14,286 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:14,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:14,356 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:14,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:14 WrapperNode [2022-02-21 03:35:14,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:14,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:14,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:14,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:14,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:14" (1/1) ... [2022-02-21 03:35:14,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:14" (1/1) ... [2022-02-21 03:35:14,421 INFO L137 Inliner]: procedures = 152, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2022-02-21 03:35:14,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:14,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:14,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:14,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:14,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:14" (1/1) ... [2022-02-21 03:35:14,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:14" (1/1) ... [2022-02-21 03:35:14,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:14" (1/1) ... [2022-02-21 03:35:14,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:14" (1/1) ... [2022-02-21 03:35:14,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:14" (1/1) ... [2022-02-21 03:35:14,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:14" (1/1) ... [2022-02-21 03:35:14,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:14" (1/1) ... [2022-02-21 03:35:14,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:14,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:14,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:14,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:14,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:14" (1/1) ... [2022-02-21 03:35:14,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,499 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:14,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:35:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:35:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:14,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:14,622 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:14,624 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:14,911 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:14,918 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:14,927 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:35:14,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:14 BoogieIcfgContainer [2022-02-21 03:35:14,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:14,930 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:14,930 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:14,932 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:14,933 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:14,933 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:13" (1/3) ... [2022-02-21 03:35:14,934 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69e9c21d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:14, skipping insertion in model container [2022-02-21 03:35:14,934 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:14,934 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:14" (2/3) ... [2022-02-21 03:35:14,934 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69e9c21d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:14, skipping insertion in model container [2022-02-21 03:35:14,934 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:14,934 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:14" (3/3) ... [2022-02-21 03:35:14,935 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrncmp_malloc.i [2022-02-21 03:35:14,975 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:14,976 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:14,976 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:14,976 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:14,976 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:14,976 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:14,976 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:14,976 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:14,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:15,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:35:15,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:15,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:15,010 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:15,011 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:15,011 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:15,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:15,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:35:15,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:15,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:15,017 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:15,017 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:15,022 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~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~nondet220#1, main_#t~ret221#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_~res~0#1;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; 19#L382true assume !(main_~length1~0#1 < 1); 14#L382-2true assume !(main_~length2~0#1 < 1); 5#L385-1true call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;havoc main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;havoc main_#t~malloc219#1.base, main_#t~malloc219#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet220#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; 12#L367true assume !(0 == cstrncmp_~n#1); 10#L369-5true [2022-02-21 03:35:15,024 INFO L793 eck$LassoCheckResult]: Loop: 10#L369-5true cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 16#L369-1true 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; 9#L369-3true 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; 7#L370true assume cstrncmp_#t~short210#1; 18#L370-2true 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, 1 + cstrncmp_#t~post212#1.offset;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 10#L369-5true [2022-02-21 03:35:15,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:15,028 INFO L85 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2022-02-21 03:35:15,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:15,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731597014] [2022-02-21 03:35:15,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:15,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:15,139 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:15,173 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:15,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:15,176 INFO L85 PathProgramCache]: Analyzing trace with hash 52587176, now seen corresponding path program 1 times [2022-02-21 03:35:15,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:15,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042068618] [2022-02-21 03:35:15,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:15,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; {24#true} is VALID [2022-02-21 03:35:15,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} 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; {24#true} is VALID [2022-02-21 03:35:15,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} 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; {24#true} is VALID [2022-02-21 03:35:15,271 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#true} assume cstrncmp_#t~short210#1; {26#|ULTIMATE.start_cstrncmp_#t~short210#1|} is VALID [2022-02-21 03:35:15,272 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#|ULTIMATE.start_cstrncmp_#t~short210#1|} 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, 1 + cstrncmp_#t~post212#1.offset;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; {25#false} is VALID [2022-02-21 03:35:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:15,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:15,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042068618] [2022-02-21 03:35:15,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042068618] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:15,276 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:15,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:35:15,276 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676971679] [2022-02-21 03:35:15,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:15,281 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:15,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:15,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:35:15,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:35:15,306 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:15,362 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-02-21 03:35:15,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:35:15,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:15,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:15,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2022-02-21 03:35:15,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:35:15,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2022-02-21 03:35:15,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:35:15,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:35:15,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2022-02-21 03:35:15,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:15,384 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 03:35:15,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2022-02-21 03:35:15,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-21 03:35:15,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:15,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:15,403 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:15,404 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:15,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:15,413 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 03:35:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:35:15,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:15,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:15,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 14 transitions. [2022-02-21 03:35:15,415 INFO L87 Difference]: Start difference. First operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 14 transitions. [2022-02-21 03:35:15,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:15,416 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 03:35:15,416 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:35:15,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:15,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:15,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:15,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:15,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2022-02-21 03:35:15,419 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 03:35:15,419 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 03:35:15,419 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:15,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:35:15,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:35:15,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:15,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:15,425 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:15,425 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:15,425 INFO L791 eck$LassoCheckResult]: Stem: 48#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 49#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~nondet220#1, main_#t~ret221#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_~res~0#1;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; 55#L382 assume !(main_~length1~0#1 < 1); 56#L382-2 assume !(main_~length2~0#1 < 1); 50#L385-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;havoc main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;havoc main_#t~malloc219#1.base, main_#t~malloc219#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet220#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; 51#L367 assume !(0 == cstrncmp_~n#1); 52#L369-5 [2022-02-21 03:35:15,426 INFO L793 eck$LassoCheckResult]: Loop: 52#L369-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; 53#L369-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; 46#L369-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; 47#L370 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; 54#L370-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, 1 + cstrncmp_#t~post212#1.offset;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 52#L369-5 [2022-02-21 03:35:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 2 times [2022-02-21 03:35:15,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:15,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812855505] [2022-02-21 03:35:15,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:15,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:15,460 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:15,487 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:15,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:15,488 INFO L85 PathProgramCache]: Analyzing trace with hash 52587238, now seen corresponding path program 1 times [2022-02-21 03:35:15,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:15,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011629648] [2022-02-21 03:35:15,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:15,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:15,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:15,517 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:15,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:15,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2120298631, now seen corresponding path program 1 times [2022-02-21 03:35:15,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:15,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357908845] [2022-02-21 03:35:15,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:15,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:15,563 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:15,595 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:16,260 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:16,261 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:16,261 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:16,261 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:16,261 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:16,261 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,261 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:16,262 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:16,262 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_malloc.i_Iteration2_Lasso [2022-02-21 03:35:16,262 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:16,262 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:16,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:16,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:17,519 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:17,522 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:17,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:17,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:17,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:17,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:17,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:17,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:17,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:17,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:17,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:17,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:17,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:17,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:35:17,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:17,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:35:17,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:17,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:17,571 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:17,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:35:17,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:17,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:17,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:17,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:17,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:17,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:17,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:17,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:17,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:17,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:17,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:17,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:17,602 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:17,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:35:17,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:17,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:17,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:17,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:17,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:17,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:17,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:17,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:17,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:17,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:17,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:17,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:17,645 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:17,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:35:17,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:17,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:17,653 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-02-21 03:35:17,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:17,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:17,661 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-02-21 03:35:17,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:17,675 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:17,683 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:35:17,683 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-02-21 03:35:17,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:17,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:17,686 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:17,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:35:17,688 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:17,710 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:17,710 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:17,710 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~n#1) = 1*ULTIMATE.start_cstrncmp_~n#1 Supporting invariants [] [2022-02-21 03:35:17,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:17,783 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 03:35:17,787 INFO L390 LassoCheck]: Loop: "cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0;" "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;" "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;" "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;" "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, 1 + cstrncmp_#t~post212#1.offset;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset;" [2022-02-21 03:35:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:17,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {88#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {88#unseeded} is VALID [2022-02-21 03:35:17,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {88#unseeded} 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~nondet220#1, main_#t~ret221#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_~res~0#1;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; {88#unseeded} is VALID [2022-02-21 03:35:17,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {88#unseeded} assume !(main_~length1~0#1 < 1); {88#unseeded} is VALID [2022-02-21 03:35:17,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {88#unseeded} assume !(main_~length2~0#1 < 1); {88#unseeded} is VALID [2022-02-21 03:35:17,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {88#unseeded} call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;havoc main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;havoc main_#t~malloc219#1.base, main_#t~malloc219#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet220#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; {88#unseeded} is VALID [2022-02-21 03:35:17,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {88#unseeded} assume !(0 == cstrncmp_~n#1); {88#unseeded} is VALID [2022-02-21 03:35:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:35:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:18,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:18,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {91#(>= oldRank0 |ULTIMATE.start_cstrncmp_~n#1|)} cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; {176#(or (and (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) 0) (not |ULTIMATE.start_cstrncmp_#t~short208#1|) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0)) (and (< 0 oldRank0) |ULTIMATE.start_cstrncmp_#t~short208#1| (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0)))} is VALID [2022-02-21 03:35:18,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#(or (and (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) 0) (not |ULTIMATE.start_cstrncmp_#t~short208#1|) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0)) (and (< 0 oldRank0) |ULTIMATE.start_cstrncmp_#t~short208#1| (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0)))} 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; {180#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0))} is VALID [2022-02-21 03:35:18,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0))} 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; {180#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0))} is VALID [2022-02-21 03:35:18,110 INFO L290 TraceCheckUtils]: 3: Hoare triple {180#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0))} 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; {180#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0))} is VALID [2022-02-21 03:35:18,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {180#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0))} 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, 1 + cstrncmp_#t~post212#1.offset;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; {156#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_cstrncmp_~n#1|)) unseeded)} is VALID [2022-02-21 03:35:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:18,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:18,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:18,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:35:18,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,125 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:35:18,125 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:18,180 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 26 transitions. Complement of second has 6 states. [2022-02-21 03:35:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:18,180 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:18,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. cyclomatic complexity: 4 [2022-02-21 03:35:18,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:18,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:18,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:18,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:18,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:18,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:18,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2022-02-21 03:35:18,183 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:18,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:18,185 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 4 [2022-02-21 03:35:18,186 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:35:18,186 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:18,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:18,187 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:18,187 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 26 transitions. cyclomatic complexity: 6 [2022-02-21 03:35:18,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. cyclomatic complexity: 6 [2022-02-21 03:35:18,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:18,188 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:35:18,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:35:18,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:35:18,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:35:18,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:18,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:18,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:18,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:35:18,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:35:18,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:35:18,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:35:18,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:35:18,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:35:18,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:18,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:18,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:18,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:35:18,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:35:18,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:35:18,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:35:18,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:35:18,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:35:18,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:18,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:18,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:18,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:35:18,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:35:18,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:35:18,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:35:18,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:35:18,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:35:18,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:18,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:18,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:18,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,200 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-02-21 03:35:18,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:35:18,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:35:18,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 10 letters. [2022-02-21 03:35:18,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:18,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. cyclomatic complexity: 6 [2022-02-21 03:35:18,203 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:18,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2022-02-21 03:35:18,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:35:18,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:35:18,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:35:18,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:18,204 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:18,204 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:18,204 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:18,204 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:18,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:35:18,205 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:18,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:18,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:35:18 BoogieIcfgContainer [2022-02-21 03:35:18,211 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:35:18,211 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:35:18,211 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:35:18,212 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:35:18,212 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:14" (3/4) ... [2022-02-21 03:35:18,214 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:35:18,214 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:35:18,215 INFO L158 Benchmark]: Toolchain (without parser) took 4276.36ms. Allocated memory was 83.9MB in the beginning and 146.8MB in the end (delta: 62.9MB). Free memory was 50.7MB in the beginning and 99.0MB in the end (delta: -48.4MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2022-02-21 03:35:18,215 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 53.9MB in the beginning and 53.9MB in the end (delta: 24.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:18,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.91ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 50.7MB in the beginning and 83.2MB in the end (delta: -32.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:35:18,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.84ms. Allocated memory is still 117.4MB. Free memory was 83.2MB in the beginning and 81.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:18,216 INFO L158 Benchmark]: Boogie Preprocessor took 25.09ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 79.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:18,216 INFO L158 Benchmark]: RCFGBuilder took 480.15ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 64.4MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 03:35:18,217 INFO L158 Benchmark]: BuchiAutomizer took 3281.29ms. Allocated memory was 117.4MB in the beginning and 146.8MB in the end (delta: 29.4MB). Free memory was 64.4MB in the beginning and 99.0MB in the end (delta: -34.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:18,217 INFO L158 Benchmark]: Witness Printer took 2.43ms. Allocated memory is still 146.8MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:18,218 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 53.9MB in the beginning and 53.9MB in the end (delta: 24.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.91ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 50.7MB in the beginning and 83.2MB in the end (delta: -32.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.84ms. Allocated memory is still 117.4MB. Free memory was 83.2MB in the beginning and 81.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.09ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 79.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 480.15ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 64.4MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 3281.29ms. Allocated memory was 117.4MB in the beginning and 146.8MB in the end (delta: 29.4MB). Free memory was 64.4MB in the beginning and 99.0MB in the end (delta: -34.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.43ms. Allocated memory is still 146.8MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 34 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital224 mio100 ax100 hnf100 lsp87 ukn86 mio100 lsp47 div100 bol100 ite100 ukn100 eq189 hnf88 smp100 dnf143 smp89 tf100 neg95 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 66ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:35:18,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE