./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b6873ae1a0d665798beb3dd9c0c48e89806da7dd46f1d2066800a52e0a2aa51 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:35:19,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:35:19,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:35:19,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:35:19,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:35:19,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:35:19,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:35:19,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:35:19,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:35:19,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:35:19,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:35:19,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:35:19,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:35:19,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:35:19,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:35:19,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:35:19,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:35:19,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:35:19,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:35:19,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:35:19,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:35:20,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:35:20,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:35:20,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:35:20,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:35:20,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:35:20,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:35:20,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:35:20,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:35:20,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:35:20,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:35:20,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:35:20,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:20,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:20,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:20,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:20,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:20,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:20,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:20,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:20,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:20,020 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:35:20,055 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:20,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:20,056 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:20,056 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:20,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:20,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:20,058 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:20,058 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:20,058 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:20,059 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:20,059 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:20,060 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:20,060 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:20,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:20,060 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:20,060 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:20,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:20,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:20,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:20,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:20,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:20,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:20,062 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:20,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:20,062 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:20,062 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:20,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:20,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:20,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:20,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:20,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:20,064 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:20,065 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b6873ae1a0d665798beb3dd9c0c48e89806da7dd46f1d2066800a52e0a2aa51 [2022-02-21 04:35:20,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:20,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:20,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:20,326 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:20,327 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:20,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2022-02-21 04:35:20,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ddf2c79/43548c8fb3a040d79015462a7d0d0290/FLAG129d9b0dd [2022-02-21 04:35:20,883 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:20,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2022-02-21 04:35:20,894 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ddf2c79/43548c8fb3a040d79015462a7d0d0290/FLAG129d9b0dd [2022-02-21 04:35:21,382 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ddf2c79/43548c8fb3a040d79015462a7d0d0290 [2022-02-21 04:35:21,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:21,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:21,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:21,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:21,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:21,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:21" (1/1) ... [2022-02-21 04:35:21,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b821e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:21, skipping insertion in model container [2022-02-21 04:35:21,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:21" (1/1) ... [2022-02-21 04:35:21,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:21,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:21,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:21,745 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:21,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:21,835 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:21,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:21 WrapperNode [2022-02-21 04:35:21,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:21,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:21,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:21,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:21,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:21" (1/1) ... [2022-02-21 04:35:21,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:21" (1/1) ... [2022-02-21 04:35:21,909 INFO L137 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2022-02-21 04:35:21,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:21,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:21,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:21,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:21,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:21" (1/1) ... [2022-02-21 04:35:21,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:21" (1/1) ... [2022-02-21 04:35:21,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:21" (1/1) ... [2022-02-21 04:35:21,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:21" (1/1) ... [2022-02-21 04:35:21,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:21" (1/1) ... [2022-02-21 04:35:21,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:21" (1/1) ... [2022-02-21 04:35:21,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:21" (1/1) ... [2022-02-21 04:35:21,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:21,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:21,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:21,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:21,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:21" (1/1) ... [2022-02-21 04:35:21,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:21,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:21,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:22,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:35:22,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:22,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:22,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:22,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:22,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:22,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:22,135 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:22,137 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:22,287 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:22,292 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:22,292 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 04:35:22,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:22 BoogieIcfgContainer [2022-02-21 04:35:22,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:22,294 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:22,294 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:22,297 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:22,298 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:22,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:21" (1/3) ... [2022-02-21 04:35:22,299 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b0abd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:22, skipping insertion in model container [2022-02-21 04:35:22,300 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:22,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:21" (2/3) ... [2022-02-21 04:35:22,300 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b0abd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:22, skipping insertion in model container [2022-02-21 04:35:22,300 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:22,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:22" (3/3) ... [2022-02-21 04:35:22,302 INFO L388 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcpy-alloca-2.i [2022-02-21 04:35:22,352 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:22,353 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:22,353 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:22,353 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:22,353 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:22,353 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:22,354 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:22,354 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:22,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:22,395 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:22,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:22,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:22,399 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:22,399 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:22,399 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:22,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:22,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:22,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:22,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:22,403 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:22,403 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:22,408 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 11#L523true assume !(main_~length1~0#1 < 1); 12#L523-2true assume !(main_~length2~0#1 < 1); 13#L526-1true assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 3#L534-3true [2022-02-21 04:35:22,409 INFO L793 eck$LassoCheckResult]: Loop: 3#L534-3true assume !!(main_~i~0#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 10#L534-2true main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3#L534-3true [2022-02-21 04:35:22,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:22,414 INFO L85 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2022-02-21 04:35:22,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:22,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724068494] [2022-02-21 04:35:22,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:22,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,516 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,556 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:22,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:22,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2022-02-21 04:35:22,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:22,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026249065] [2022-02-21 04:35:22,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:22,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,584 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,593 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:22,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:22,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1806939692, now seen corresponding path program 1 times [2022-02-21 04:35:22,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:22,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952823402] [2022-02-21 04:35:22,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:22,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,625 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,643 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:23,063 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:23,064 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:23,064 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:23,064 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:23,064 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:23,065 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,065 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:23,065 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:23,065 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcpy-alloca-2.i_Iteration1_Lasso [2022-02-21 04:35:23,065 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:23,065 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:23,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,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 04:35:23,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 04:35:23,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,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 04:35:23,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,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 04:35:23,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,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 04:35:23,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 04:35:23,715 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:23,718 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:23,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:23,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:23,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:35:23,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:23,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:23,778 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:23,806 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 04:35:23,806 INFO L444 ModelExtractionUtils]: 8 out of 28 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-02-21 04:35:23,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:23,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:35:23,823 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:23,840 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 04:35:23,841 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:23,842 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length1~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~nondetString~0#1.base)_1 + 1*ULTIMATE.start_main_~length1~0#1 + 1*ULTIMATE.start_main_~nondetString~0#1.offset >= 0] [2022-02-21 04:35:23,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:35:23,955 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2022-02-21 04:35:23,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:23,968 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;" "main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2022-02-21 04:35:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:24,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:24,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 04:35:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:24,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:24,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {26#unseeded} is VALID [2022-02-21 04:35:24,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {26#unseeded} is VALID [2022-02-21 04:35:24,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~length1~0#1 < 1); {26#unseeded} is VALID [2022-02-21 04:35:24,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#unseeded} assume !(main_~length2~0#1 < 1); {26#unseeded} is VALID [2022-02-21 04:35:24,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#unseeded} assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; {75#(and unseeded (>= (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) |ULTIMATE.start_main_~nondetString~0#1.offset|) 0))} is VALID [2022-02-21 04:35:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:24,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 04:35:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:24,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:24,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {76#(and (>= (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) |ULTIMATE.start_main_~nondetString~0#1.offset|) 0) (>= oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|))))} assume !!(main_~i~0#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; {96#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (>= (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) |ULTIMATE.start_main_~nondetString~0#1.offset|) 0) (>= oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|))))} is VALID [2022-02-21 04:35:24,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (>= (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) |ULTIMATE.start_main_~nondetString~0#1.offset|) 0) (>= oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|))))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {78#(and (or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|)))) unseeded) (>= (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) |ULTIMATE.start_main_~nondetString~0#1.offset|) 0))} is VALID [2022-02-21 04:35:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:24,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:24,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:24,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,209 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:24,211 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,324 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 50 transitions. Complement of second has 7 states. [2022-02-21 04:35:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:24,325 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:24,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:24,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:24,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:24,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,331 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:24,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:24,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:24,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2022-02-21 04:35:24,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:24,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:24,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:24,335 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:24,338 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:35:24,338 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,339 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:24,340 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:24,340 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 50 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:24,341 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:24,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:24,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:24,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:24,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:24,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:24,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:24,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:24,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:24,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:24,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 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 39 letters. Loop has 39 letters. [2022-02-21 04:35:24,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 39 letters. [2022-02-21 04:35:24,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 39 letters. Loop has 39 letters. [2022-02-21 04:35:24,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:24,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:24,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:24,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:24,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:24,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:24,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:24,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:24,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:24,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:24,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:24,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:24,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:24,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:24,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:24,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:24,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:24,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:24,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:24,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:24,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:24,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:24,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:24,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:24,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:24,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:24,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:24,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:24,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:24,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:24,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:24,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:24,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:24,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:24,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:24,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:24,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,367 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-02-21 04:35:24,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:24,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:24,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:35:24,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:24,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:24,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 12 states and 16 transitions. [2022-02-21 04:35:24,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 04:35:24,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 04:35:24,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2022-02-21 04:35:24,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:24,382 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 04:35:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2022-02-21 04:35:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 04:35:24,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:24,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,402 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,404 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:24,407 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 04:35:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 04:35:24,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:24,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:24,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 16 transitions. [2022-02-21 04:35:24,408 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 16 transitions. [2022-02-21 04:35:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:24,409 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 04:35:24,409 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 04:35:24,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:24,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:24,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:24,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-02-21 04:35:24,412 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 04:35:24,412 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 04:35:24,412 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:24,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 04:35:24,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:24,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:24,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:24,413 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:24,414 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:24,414 INFO L791 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 155#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 156#L523 assume !(main_~length1~0#1 < 1); 157#L523-2 assume !(main_~length2~0#1 < 1); 158#L526-1 assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 150#L534-3 assume !(main_~i~0#1 < main_~length2~0#1 - 1); 151#L534-4 call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcpy } true;cstrcpy_#in~to#1.base, cstrcpy_#in~to#1.offset, cstrcpy_#in~from#1.base, cstrcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstrcpy_#res#1.base, cstrcpy_#res#1.offset;havoc cstrcpy_#t~pre2#1.base, cstrcpy_#t~pre2#1.offset, cstrcpy_#t~pre3#1.base, cstrcpy_#t~pre3#1.offset, cstrcpy_#t~mem4#1, cstrcpy_~to#1.base, cstrcpy_~to#1.offset, cstrcpy_~from#1.base, cstrcpy_~from#1.offset, cstrcpy_~save~0#1.base, cstrcpy_~save~0#1.offset;cstrcpy_~to#1.base, cstrcpy_~to#1.offset := cstrcpy_#in~to#1.base, cstrcpy_#in~to#1.offset;cstrcpy_~from#1.base, cstrcpy_~from#1.offset := cstrcpy_#in~from#1.base, cstrcpy_#in~from#1.offset;cstrcpy_~save~0#1.base, cstrcpy_~save~0#1.offset := cstrcpy_~to#1.base, cstrcpy_~to#1.offset; 159#L517-4 [2022-02-21 04:35:24,414 INFO L793 eck$LassoCheckResult]: Loop: 159#L517-4 call cstrcpy_#t~mem4#1 := read~int(cstrcpy_~from#1.base, cstrcpy_~from#1.offset, 1);call write~int(cstrcpy_#t~mem4#1, cstrcpy_~to#1.base, cstrcpy_~to#1.offset, 1); 160#L517-1 assume !!(0 != cstrcpy_#t~mem4#1);havoc cstrcpy_#t~mem4#1; 161#L517-3 cstrcpy_#t~pre2#1.base, cstrcpy_#t~pre2#1.offset := cstrcpy_~from#1.base, 1 + cstrcpy_~from#1.offset;cstrcpy_~from#1.base, cstrcpy_~from#1.offset := cstrcpy_~from#1.base, 1 + cstrcpy_~from#1.offset;havoc cstrcpy_#t~pre2#1.base, cstrcpy_#t~pre2#1.offset;cstrcpy_#t~pre3#1.base, cstrcpy_#t~pre3#1.offset := cstrcpy_~to#1.base, 1 + cstrcpy_~to#1.offset;cstrcpy_~to#1.base, cstrcpy_~to#1.offset := cstrcpy_~to#1.base, 1 + cstrcpy_~to#1.offset;havoc cstrcpy_#t~pre3#1.base, cstrcpy_#t~pre3#1.offset; 159#L517-4 [2022-02-21 04:35:24,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:24,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1806939634, now seen corresponding path program 1 times [2022-02-21 04:35:24,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:24,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883409655] [2022-02-21 04:35:24,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:24,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:24,436 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:24,450 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:24,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:24,451 INFO L85 PathProgramCache]: Analyzing trace with hash 66694, now seen corresponding path program 1 times [2022-02-21 04:35:24,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:24,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925208561] [2022-02-21 04:35:24,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:24,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:24,459 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:24,465 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:24,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:24,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1713552629, now seen corresponding path program 1 times [2022-02-21 04:35:24,466 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:24,466 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947050568] [2022-02-21 04:35:24,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:24,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:24,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {193#true} is VALID [2022-02-21 04:35:24,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {193#true} is VALID [2022-02-21 04:35:24,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {193#true} assume !(main_~length1~0#1 < 1); {193#true} is VALID [2022-02-21 04:35:24,634 INFO L290 TraceCheckUtils]: 3: Hoare triple {193#true} assume !(main_~length2~0#1 < 1); {193#true} is VALID [2022-02-21 04:35:24,635 INFO L290 TraceCheckUtils]: 4: Hoare triple {193#true} assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; {195#(and (or (= |ULTIMATE.start_main_~length2~0#1| 1) (not (= (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0)) (= (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0)))} is VALID [2022-02-21 04:35:24,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {195#(and (or (= |ULTIMATE.start_main_~length2~0#1| 1) (not (= (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0)) (= (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0)))} assume !(main_~i~0#1 < main_~length2~0#1 - 1); {196#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1))} is VALID [2022-02-21 04:35:24,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1))} call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcpy } true;cstrcpy_#in~to#1.base, cstrcpy_#in~to#1.offset, cstrcpy_#in~from#1.base, cstrcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstrcpy_#res#1.base, cstrcpy_#res#1.offset;havoc cstrcpy_#t~pre2#1.base, cstrcpy_#t~pre2#1.offset, cstrcpy_#t~pre3#1.base, cstrcpy_#t~pre3#1.offset, cstrcpy_#t~mem4#1, cstrcpy_~to#1.base, cstrcpy_~to#1.offset, cstrcpy_~from#1.base, cstrcpy_~from#1.offset, cstrcpy_~save~0#1.base, cstrcpy_~save~0#1.offset;cstrcpy_~to#1.base, cstrcpy_~to#1.offset := cstrcpy_#in~to#1.base, cstrcpy_#in~to#1.offset;cstrcpy_~from#1.base, cstrcpy_~from#1.offset := cstrcpy_#in~from#1.base, cstrcpy_#in~from#1.offset;cstrcpy_~save~0#1.base, cstrcpy_~save~0#1.offset := cstrcpy_~to#1.base, cstrcpy_~to#1.offset; {197#(= (select (select |#memory_int| |ULTIMATE.start_cstrcpy_~from#1.base|) |ULTIMATE.start_cstrcpy_~from#1.offset|) 0)} is VALID [2022-02-21 04:35:24,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {197#(= (select (select |#memory_int| |ULTIMATE.start_cstrcpy_~from#1.base|) |ULTIMATE.start_cstrcpy_~from#1.offset|) 0)} call cstrcpy_#t~mem4#1 := read~int(cstrcpy_~from#1.base, cstrcpy_~from#1.offset, 1);call write~int(cstrcpy_#t~mem4#1, cstrcpy_~to#1.base, cstrcpy_~to#1.offset, 1); {198#(= |ULTIMATE.start_cstrcpy_#t~mem4#1| 0)} is VALID [2022-02-21 04:35:24,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {198#(= |ULTIMATE.start_cstrcpy_#t~mem4#1| 0)} assume !!(0 != cstrcpy_#t~mem4#1);havoc cstrcpy_#t~mem4#1; {194#false} is VALID [2022-02-21 04:35:24,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {194#false} cstrcpy_#t~pre2#1.base, cstrcpy_#t~pre2#1.offset := cstrcpy_~from#1.base, 1 + cstrcpy_~from#1.offset;cstrcpy_~from#1.base, cstrcpy_~from#1.offset := cstrcpy_~from#1.base, 1 + cstrcpy_~from#1.offset;havoc cstrcpy_#t~pre2#1.base, cstrcpy_#t~pre2#1.offset;cstrcpy_#t~pre3#1.base, cstrcpy_#t~pre3#1.offset := cstrcpy_~to#1.base, 1 + cstrcpy_~to#1.offset;cstrcpy_~to#1.base, cstrcpy_~to#1.offset := cstrcpy_~to#1.base, 1 + cstrcpy_~to#1.offset;havoc cstrcpy_#t~pre3#1.base, cstrcpy_#t~pre3#1.offset; {194#false} is VALID [2022-02-21 04:35:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:24,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:24,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947050568] [2022-02-21 04:35:24,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947050568] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:24,641 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:24,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 04:35:24,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055608960] [2022-02-21 04:35:24,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:24,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:24,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 04:35:24,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 04:35:24,749 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:24,944 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 04:35:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:35:24,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:24,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2022-02-21 04:35:24,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:24,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 13 states and 16 transitions. [2022-02-21 04:35:24,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 04:35:24,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 04:35:24,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2022-02-21 04:35:24,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:24,960 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-02-21 04:35:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2022-02-21 04:35:24,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-02-21 04:35:24,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:24,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,961 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,962 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:24,962 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 04:35:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-21 04:35:24,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:24,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:24,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 16 transitions. [2022-02-21 04:35:24,963 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 16 transitions. [2022-02-21 04:35:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:24,964 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 04:35:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-21 04:35:24,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:24,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:24,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:24,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-02-21 04:35:24,966 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 04:35:24,966 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 04:35:24,966 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:24,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-02-21 04:35:24,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:24,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:24,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:24,967 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:24,967 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:24,968 INFO L791 eck$LassoCheckResult]: Stem: 225#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 226#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 227#L523 assume !(main_~length1~0#1 < 1); 228#L523-2 assume !(main_~length2~0#1 < 1); 229#L526-1 assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 221#L534-3 assume !!(main_~i~0#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 222#L534-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 223#L534-3 assume !(main_~i~0#1 < main_~length2~0#1 - 1); 224#L534-4 call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcpy } true;cstrcpy_#in~to#1.base, cstrcpy_#in~to#1.offset, cstrcpy_#in~from#1.base, cstrcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstrcpy_#res#1.base, cstrcpy_#res#1.offset;havoc cstrcpy_#t~pre2#1.base, cstrcpy_#t~pre2#1.offset, cstrcpy_#t~pre3#1.base, cstrcpy_#t~pre3#1.offset, cstrcpy_#t~mem4#1, cstrcpy_~to#1.base, cstrcpy_~to#1.offset, cstrcpy_~from#1.base, cstrcpy_~from#1.offset, cstrcpy_~save~0#1.base, cstrcpy_~save~0#1.offset;cstrcpy_~to#1.base, cstrcpy_~to#1.offset := cstrcpy_#in~to#1.base, cstrcpy_#in~to#1.offset;cstrcpy_~from#1.base, cstrcpy_~from#1.offset := cstrcpy_#in~from#1.base, cstrcpy_#in~from#1.offset;cstrcpy_~save~0#1.base, cstrcpy_~save~0#1.offset := cstrcpy_~to#1.base, cstrcpy_~to#1.offset; 230#L517-4 [2022-02-21 04:35:24,968 INFO L793 eck$LassoCheckResult]: Loop: 230#L517-4 call cstrcpy_#t~mem4#1 := read~int(cstrcpy_~from#1.base, cstrcpy_~from#1.offset, 1);call write~int(cstrcpy_#t~mem4#1, cstrcpy_~to#1.base, cstrcpy_~to#1.offset, 1); 231#L517-1 assume !!(0 != cstrcpy_#t~mem4#1);havoc cstrcpy_#t~mem4#1; 232#L517-3 cstrcpy_#t~pre2#1.base, cstrcpy_#t~pre2#1.offset := cstrcpy_~from#1.base, 1 + cstrcpy_~from#1.offset;cstrcpy_~from#1.base, cstrcpy_~from#1.offset := cstrcpy_~from#1.base, 1 + cstrcpy_~from#1.offset;havoc cstrcpy_#t~pre2#1.base, cstrcpy_#t~pre2#1.offset;cstrcpy_#t~pre3#1.base, cstrcpy_#t~pre3#1.offset := cstrcpy_~to#1.base, 1 + cstrcpy_~to#1.offset;cstrcpy_~to#1.base, cstrcpy_~to#1.offset := cstrcpy_~to#1.base, 1 + cstrcpy_~to#1.offset;havoc cstrcpy_#t~pre3#1.base, cstrcpy_#t~pre3#1.offset; 230#L517-4 [2022-02-21 04:35:24,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1302257236, now seen corresponding path program 1 times [2022-02-21 04:35:24,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:24,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117664269] [2022-02-21 04:35:24,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:24,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:24,987 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,000 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:25,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:25,004 INFO L85 PathProgramCache]: Analyzing trace with hash 66694, now seen corresponding path program 2 times [2022-02-21 04:35:25,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:25,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092563667] [2022-02-21 04:35:25,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:25,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,012 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,019 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:25,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash -894230189, now seen corresponding path program 1 times [2022-02-21 04:35:25,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:25,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831321464] [2022-02-21 04:35:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,060 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,085 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:25,778 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:25,778 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:25,778 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:25,778 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:25,778 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:25,778 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:25,778 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:25,778 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:25,778 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcpy-alloca-2.i_Iteration3_Lasso [2022-02-21 04:35:25,779 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:25,779 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:25,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:25,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:25,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:25,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:25,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:25,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:25,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:26,396 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:26,398 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:26,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:26,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:26,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:26,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:26,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:26,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:26,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:26,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:26,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:26,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:26,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:26,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:26,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:27,038 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:27,038 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:27,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:27,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:27,044 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:27,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:35:27,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:27,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:27,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:27,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:27,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:27,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:27,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:27,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:27,070 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:27,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:27,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:27,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:27,097 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:27,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:35:27,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:27,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:27,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:27,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:27,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:27,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:27,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:27,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:27,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:27,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:27,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:27,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:27,180 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:27,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:35:27,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:27,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:27,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:27,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:27,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:27,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:27,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:27,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:27,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:27,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:27,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:27,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:27,209 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:27,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:35:27,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:27,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:27,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:27,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:27,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:27,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:27,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:27,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:27,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:27,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:27,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:27,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:27,236 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:27,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:35:27,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:27,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:27,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:27,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:27,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:27,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:27,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:27,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:27,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:27,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:27,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:27,301 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:27,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:35:27,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:27,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:27,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:27,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:27,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:27,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:27,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:27,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:27,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:27,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:27,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:27,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:27,333 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:27,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:35:27,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:27,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:27,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:27,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:27,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:27,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:27,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:27,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:27,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:27,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:27,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:27,364 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:27,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:35:27,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:27,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:27,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:27,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:27,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:27,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:27,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:27,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:27,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:27,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:27,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:27,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:27,396 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:27,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:35:27,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:27,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:27,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:27,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:27,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:27,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:27,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:27,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:27,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:27,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:27,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:27,428 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:27,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:35:27,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:27,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:27,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:27,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:27,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:27,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:27,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:27,475 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:27,516 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-02-21 04:35:27,516 INFO L444 ModelExtractionUtils]: 26 out of 46 variables were initially zero. Simplification set additionally 17 variables to zero. [2022-02-21 04:35:27,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:27,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:27,518 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:27,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:35:27,551 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:27,569 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:27,570 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:27,570 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcpy_~to#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc7#1.base)_2) = -1*ULTIMATE.start_cstrcpy_~to#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc7#1.base)_2 Supporting invariants [] [2022-02-21 04:35:27,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:27,662 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2022-02-21 04:35:27,677 INFO L390 LassoCheck]: Loop: "call cstrcpy_#t~mem4#1 := read~int(cstrcpy_~from#1.base, cstrcpy_~from#1.offset, 1);call write~int(cstrcpy_#t~mem4#1, cstrcpy_~to#1.base, cstrcpy_~to#1.offset, 1);" "assume !!(0 != cstrcpy_#t~mem4#1);havoc cstrcpy_#t~mem4#1;" "cstrcpy_#t~pre2#1.base, cstrcpy_#t~pre2#1.offset := cstrcpy_~from#1.base, 1 + cstrcpy_~from#1.offset;cstrcpy_~from#1.base, cstrcpy_~from#1.offset := cstrcpy_~from#1.base, 1 + cstrcpy_~from#1.offset;havoc cstrcpy_#t~pre2#1.base, cstrcpy_#t~pre2#1.offset;cstrcpy_#t~pre3#1.base, cstrcpy_#t~pre3#1.offset := cstrcpy_~to#1.base, 1 + cstrcpy_~to#1.offset;cstrcpy_~to#1.base, cstrcpy_~to#1.offset := cstrcpy_~to#1.base, 1 + cstrcpy_~to#1.offset;havoc cstrcpy_#t~pre3#1.base, cstrcpy_#t~pre3#1.offset;" [2022-02-21 04:35:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:27,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:27,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:27,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:27,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {268#unseeded} is VALID [2022-02-21 04:35:27,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {268#unseeded} is VALID [2022-02-21 04:35:27,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {268#unseeded} assume !(main_~length1~0#1 < 1); {268#unseeded} is VALID [2022-02-21 04:35:27,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {268#unseeded} assume !(main_~length2~0#1 < 1); {268#unseeded} is VALID [2022-02-21 04:35:27,805 INFO L290 TraceCheckUtils]: 4: Hoare triple {268#unseeded} assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; {373#(and (= |ULTIMATE.start_main_~nondetArea~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|) unseeded)} is VALID [2022-02-21 04:35:27,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {373#(and (= |ULTIMATE.start_main_~nondetArea~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|) unseeded)} assume !!(main_~i~0#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; {373#(and (= |ULTIMATE.start_main_~nondetArea~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|) unseeded)} is VALID [2022-02-21 04:35:27,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {373#(and (= |ULTIMATE.start_main_~nondetArea~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|) unseeded)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {373#(and (= |ULTIMATE.start_main_~nondetArea~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|) unseeded)} is VALID [2022-02-21 04:35:27,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {373#(and (= |ULTIMATE.start_main_~nondetArea~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|) unseeded)} assume !(main_~i~0#1 < main_~length2~0#1 - 1); {373#(and (= |ULTIMATE.start_main_~nondetArea~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|) unseeded)} is VALID [2022-02-21 04:35:27,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {373#(and (= |ULTIMATE.start_main_~nondetArea~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|) unseeded)} call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcpy } true;cstrcpy_#in~to#1.base, cstrcpy_#in~to#1.offset, cstrcpy_#in~from#1.base, cstrcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstrcpy_#res#1.base, cstrcpy_#res#1.offset;havoc cstrcpy_#t~pre2#1.base, cstrcpy_#t~pre2#1.offset, cstrcpy_#t~pre3#1.base, cstrcpy_#t~pre3#1.offset, cstrcpy_#t~mem4#1, cstrcpy_~to#1.base, cstrcpy_~to#1.offset, cstrcpy_~from#1.base, cstrcpy_~from#1.offset, cstrcpy_~save~0#1.base, cstrcpy_~save~0#1.offset;cstrcpy_~to#1.base, cstrcpy_~to#1.offset := cstrcpy_#in~to#1.base, cstrcpy_#in~to#1.offset;cstrcpy_~from#1.base, cstrcpy_~from#1.offset := cstrcpy_#in~from#1.base, cstrcpy_#in~from#1.offset;cstrcpy_~save~0#1.base, cstrcpy_~save~0#1.offset := cstrcpy_~to#1.base, cstrcpy_~to#1.offset; {352#(and unseeded (= |ULTIMATE.start_cstrcpy_~to#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|))} is VALID [2022-02-21 04:35:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:27,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:27,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:27,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:27,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#(and (= |ULTIMATE.start_cstrcpy_~to#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcpy_~to#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|))))} call cstrcpy_#t~mem4#1 := read~int(cstrcpy_~from#1.base, cstrcpy_~from#1.offset, 1);call write~int(cstrcpy_#t~mem4#1, cstrcpy_~to#1.base, cstrcpy_~to#1.offset, 1); {386#(and (<= (+ |ULTIMATE.start_cstrcpy_~to#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcpy_~to#1.base|)) (= |ULTIMATE.start_cstrcpy_~to#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcpy_~to#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|))))} is VALID [2022-02-21 04:35:27,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#(and (<= (+ |ULTIMATE.start_cstrcpy_~to#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcpy_~to#1.base|)) (= |ULTIMATE.start_cstrcpy_~to#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcpy_~to#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|))))} assume !!(0 != cstrcpy_#t~mem4#1);havoc cstrcpy_#t~mem4#1; {386#(and (<= (+ |ULTIMATE.start_cstrcpy_~to#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcpy_~to#1.base|)) (= |ULTIMATE.start_cstrcpy_~to#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcpy_~to#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|))))} is VALID [2022-02-21 04:35:27,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#(and (<= (+ |ULTIMATE.start_cstrcpy_~to#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcpy_~to#1.base|)) (= |ULTIMATE.start_cstrcpy_~to#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcpy_~to#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|))))} cstrcpy_#t~pre2#1.base, cstrcpy_#t~pre2#1.offset := cstrcpy_~from#1.base, 1 + cstrcpy_~from#1.offset;cstrcpy_~from#1.base, cstrcpy_~from#1.offset := cstrcpy_~from#1.base, 1 + cstrcpy_~from#1.offset;havoc cstrcpy_#t~pre2#1.base, cstrcpy_#t~pre2#1.offset;cstrcpy_#t~pre3#1.base, cstrcpy_#t~pre3#1.offset := cstrcpy_~to#1.base, 1 + cstrcpy_~to#1.offset;cstrcpy_~to#1.base, cstrcpy_~to#1.offset := cstrcpy_~to#1.base, 1 + cstrcpy_~to#1.offset;havoc cstrcpy_#t~pre3#1.base, cstrcpy_#t~pre3#1.offset; {355#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcpy_~to#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|))))) (= |ULTIMATE.start_cstrcpy_~to#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|))} is VALID [2022-02-21 04:35:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:27,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:27,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:27,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:27,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,922 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 04:35:27,923 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:27,960 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 15 states and 19 transitions. Complement of second has 5 states. [2022-02-21 04:35:27,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:27,960 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:27,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:27,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:27,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:27,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:27,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:27,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:27,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:27,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2022-02-21 04:35:27,964 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:27,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:27,964 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:27,967 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:27,967 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:27,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:27,968 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:27,968 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 19 transitions. cyclomatic complexity: 6 [2022-02-21 04:35:27,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. cyclomatic complexity: 6 [2022-02-21 04:35:27,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:27,968 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:35:27,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:27,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:27,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:27,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:27,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:27,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:27,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2022-02-21 04:35:27,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters. [2022-02-21 04:35:27,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 15 letters. [2022-02-21 04:35:27,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:35:27,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:35:27,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:35:27,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:27,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:27,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:27,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:27,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:27,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:27,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:27,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 3 letters. [2022-02-21 04:35:27,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:27,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:27,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 3 letters. [2022-02-21 04:35:27,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:27,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:27,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:27,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:27,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,978 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-02-21 04:35:27,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:27,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:27,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2022-02-21 04:35:27,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:27,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. cyclomatic complexity: 6 [2022-02-21 04:35:27,980 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:27,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2022-02-21 04:35:27,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:35:27,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:35:27,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:35:27,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:27,980 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:27,980 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:27,981 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:27,981 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:27,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:35:27,981 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:27,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:27,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:35:27 BoogieIcfgContainer [2022-02-21 04:35:27,987 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:35:27,987 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:35:27,987 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:35:27,988 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:35:27,988 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:22" (3/4) ... [2022-02-21 04:35:27,990 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:35:27,990 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:35:27,992 INFO L158 Benchmark]: Toolchain (without parser) took 6605.22ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 51.7MB in the beginning and 85.2MB in the end (delta: -33.5MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-02-21 04:35:27,992 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 86.0MB. Free memory was 40.7MB in the beginning and 40.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:27,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.29ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.6MB in the beginning and 72.4MB in the end (delta: -20.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:27,993 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.25ms. Allocated memory is still 104.9MB. Free memory was 72.4MB in the beginning and 70.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:27,993 INFO L158 Benchmark]: Boogie Preprocessor took 57.62ms. Allocated memory is still 104.9MB. Free memory was 70.4MB in the beginning and 68.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:27,994 INFO L158 Benchmark]: RCFGBuilder took 325.07ms. Allocated memory is still 104.9MB. Free memory was 68.6MB in the beginning and 57.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:35:27,994 INFO L158 Benchmark]: BuchiAutomizer took 5692.46ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 56.8MB in the beginning and 85.2MB in the end (delta: -28.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:27,995 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 125.8MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:27,997 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.21ms. Allocated memory is still 86.0MB. Free memory was 40.7MB in the beginning and 40.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.29ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.6MB in the beginning and 72.4MB in the end (delta: -20.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.25ms. Allocated memory is still 104.9MB. Free memory was 72.4MB in the beginning and 70.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.62ms. Allocated memory is still 104.9MB. Free memory was 70.4MB in the beginning and 68.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 325.07ms. Allocated memory is still 104.9MB. Free memory was 68.6MB in the beginning and 57.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5692.46ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 56.8MB in the beginning and 85.2MB in the end (delta: -28.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 125.8MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * to + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 37 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital165 mio100 ax111 hnf100 lsp84 ukn87 mio100 lsp50 div100 bol100 ite100 ukn100 eq179 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 122ms VariablesStem: 8 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:35:28,034 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