/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:34:44,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:34:44,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:34:44,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:34:44,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:34:44,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:34:44,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:34:44,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:34:44,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:34:44,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:34:44,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:34:44,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:34:44,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:34:44,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:34:44,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:34:44,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:34:44,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:34:44,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:34:44,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:34:44,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:34:44,493 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:34:44,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:34:44,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:34:44,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:34:44,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:34:44,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:34:44,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:34:44,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:34:44,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:34:44,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:34:44,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:34:44,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:34:44,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:34:44,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:34:44,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:34:44,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:34:44,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:34:44,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:34:44,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:34:44,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:34:44,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:34:44,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:34:44,514 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:34:44,545 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:34:44,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:34:44,546 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:34:44,546 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:34:44,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:34:44,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:34:44,547 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:34:44,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:34:44,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:34:44,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:34:44,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:34:44,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:34:44,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:34:44,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:34:44,549 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:34:44,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:34:44,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:34:44,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:34:44,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:34:44,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:34:44,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:34:44,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:34:44,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:34:44,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:34:44,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:34:44,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:34:44,551 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:34:44,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:34:44,552 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:34:44,553 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:34:44,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:34:44,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:34:44,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:34:44,779 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:34:44,780 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:34:44,781 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-04-27 21:34:44,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a0d0c45/9f3463668cb64f4b9bb17d1d97def319/FLAG5b8eeff5c [2022-04-27 21:34:45,219 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:34:45,220 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-04-27 21:34:45,228 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a0d0c45/9f3463668cb64f4b9bb17d1d97def319/FLAG5b8eeff5c [2022-04-27 21:34:45,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a0d0c45/9f3463668cb64f4b9bb17d1d97def319 [2022-04-27 21:34:45,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:34:45,607 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:34:45,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:34:45,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:34:45,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:34:45,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:34:45" (1/1) ... [2022-04-27 21:34:45,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596eb10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:45, skipping insertion in model container [2022-04-27 21:34:45,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:34:45" (1/1) ... [2022-04-27 21:34:45,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:34:45,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:34:45,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2022-04-27 21:34:45,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-04-27 21:34:45,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-04-27 21:34:45,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-04-27 21:34:45,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-04-27 21:34:45,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-04-27 21:34:45,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-04-27 21:34:45,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-04-27 21:34:45,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-04-27 21:34:45,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-04-27 21:34:45,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-04-27 21:34:45,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-04-27 21:34:45,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-04-27 21:34:45,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-04-27 21:34:45,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-04-27 21:34:45,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-04-27 21:34:45,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:34:45,893 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:34:45,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2022-04-27 21:34:45,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-04-27 21:34:45,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-04-27 21:34:45,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-04-27 21:34:45,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-04-27 21:34:45,914 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-04-27 21:34:45,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-04-27 21:34:45,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-04-27 21:34:45,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-04-27 21:34:45,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-04-27 21:34:45,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-04-27 21:34:45,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-04-27 21:34:45,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-04-27 21:34:45,953 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-04-27 21:34:45,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-04-27 21:34:45,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-04-27 21:34:45,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:34:45,970 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:34:45,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:45 WrapperNode [2022-04-27 21:34:45,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:34:45,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:34:45,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:34:45,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:34:45,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:45" (1/1) ... [2022-04-27 21:34:45,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:45" (1/1) ... [2022-04-27 21:34:46,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:45" (1/1) ... [2022-04-27 21:34:46,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:45" (1/1) ... [2022-04-27 21:34:46,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:45" (1/1) ... [2022-04-27 21:34:46,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:45" (1/1) ... [2022-04-27 21:34:46,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:45" (1/1) ... [2022-04-27 21:34:46,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:34:46,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:34:46,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:34:46,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:34:46,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:45" (1/1) ... [2022-04-27 21:34:46,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:34:46,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:34:46,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:34:46,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:34:46,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:34:46,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:34:46,139 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:34:46,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:34:46,139 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:34:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:34:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:34:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:34:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:34:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:34:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:34:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:34:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:34:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:34:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:34:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:34:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:34:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:34:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:34:46,268 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:34:46,270 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:34:46,793 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:34:46,800 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:34:46,800 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 21:34:46,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:34:46 BoogieIcfgContainer [2022-04-27 21:34:46,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:34:46,803 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:34:46,803 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:34:46,815 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:34:46,818 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:34:46" (1/1) ... [2022-04-27 21:34:46,820 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:34:46,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:34:46 BasicIcfg [2022-04-27 21:34:46,920 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:34:46,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:34:46,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:34:46,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:34:46,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:34:45" (1/4) ... [2022-04-27 21:34:46,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a58e625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:34:46, skipping insertion in model container [2022-04-27 21:34:46,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:45" (2/4) ... [2022-04-27 21:34:46,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a58e625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:34:46, skipping insertion in model container [2022-04-27 21:34:46,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:34:46" (3/4) ... [2022-04-27 21:34:46,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a58e625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:34:46, skipping insertion in model container [2022-04-27 21:34:46,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:34:46" (4/4) ... [2022-04-27 21:34:46,959 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.cqvasr [2022-04-27 21:34:46,970 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:34:46,970 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-04-27 21:34:47,010 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:34:47,015 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12f8f8be, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1f89458 [2022-04-27 21:34:47,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-04-27 21:34:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 104 states have (on average 1.9038461538461537) internal successors, (198), 120 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:34:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:34:47,029 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:47,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:47,030 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:47,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:47,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1316985673, now seen corresponding path program 1 times [2022-04-27 21:34:47,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:47,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740155258] [2022-04-27 21:34:47,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:47,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:47,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:47,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {135#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {128#true} is VALID [2022-04-27 21:34:47,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 21:34:47,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128#true} {128#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 21:34:47,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {128#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:47,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {128#true} is VALID [2022-04-27 21:34:47,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {128#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 21:34:47,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128#true} {128#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 21:34:47,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {128#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 21:34:47,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {128#true} is VALID [2022-04-27 21:34:47,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {133#(<= 0 main_~main__t~0)} is VALID [2022-04-27 21:34:47,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#(<= 0 main_~main__t~0)} [409] L26-->L868: Formula: (= v_main_~main__t~0_3 v_main_~main__tagbuf_len~0_6) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_3} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_3} AuxVars[] AssignedVars[] {133#(<= 0 main_~main__t~0)} is VALID [2022-04-27 21:34:47,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#(<= 0 main_~main__t~0)} [412] L868-->L34: Formula: (and (= (ite (<= 0 v_main_~main__t~0_4) 1 0) v_main_~__tmp_1~0_1) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_4, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {134#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 21:34:47,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {134#(not (= main_~__VERIFIER_assert__cond~0 0))} [416] L34-->L36: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {129#false} is VALID [2022-04-27 21:34:47,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {129#false} [422] L36-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#false} is VALID [2022-04-27 21:34:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:47,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:47,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740155258] [2022-04-27 21:34:47,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740155258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:47,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:47,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:34:47,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698212469] [2022-04-27 21:34:47,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:47,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:34:47,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:47,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:47,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:47,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:34:47,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:47,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:34:47,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:34:47,363 INFO L87 Difference]: Start difference. First operand has 125 states, 104 states have (on average 1.9038461538461537) internal successors, (198), 120 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:48,277 INFO L93 Difference]: Finished difference Result 143 states and 221 transitions. [2022-04-27 21:34:48,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:34:48,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:34:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2022-04-27 21:34:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2022-04-27 21:34:48,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 221 transitions. [2022-04-27 21:34:48,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:48,533 INFO L225 Difference]: With dead ends: 143 [2022-04-27 21:34:48,533 INFO L226 Difference]: Without dead ends: 123 [2022-04-27 21:34:48,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:34:48,539 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 269 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:48,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 118 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 21:34:48,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-27 21:34:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2022-04-27 21:34:48,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:48,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:48,574 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:48,575 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:48,583 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2022-04-27 21:34:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2022-04-27 21:34:48,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:48,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:48,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states. [2022-04-27 21:34:48,585 INFO L87 Difference]: Start difference. First operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states. [2022-04-27 21:34:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:48,594 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2022-04-27 21:34:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2022-04-27 21:34:48,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:48,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:48,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:48,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2022-04-27 21:34:48,602 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2022-04-27 21:34:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:48,603 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2022-04-27 21:34:48,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-04-27 21:34:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:34:48,604 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:48,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:48,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:34:48,604 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:48,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:48,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2123118550, now seen corresponding path program 1 times [2022-04-27 21:34:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:48,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965066787] [2022-04-27 21:34:48,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:48,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:48,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:48,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {680#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {672#true} is VALID [2022-04-27 21:34:48,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {672#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-27 21:34:48,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {672#true} {672#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-27 21:34:48,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {672#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:48,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {672#true} is VALID [2022-04-27 21:34:48,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {672#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-27 21:34:48,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {672#true} {672#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-27 21:34:48,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {672#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-27 21:34:48,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {672#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {672#true} is VALID [2022-04-27 21:34:48,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {672#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {677#(or (= main_~main__t~0 0) (<= main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2022-04-27 21:34:48,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {677#(or (= main_~main__t~0 0) (<= main_~main__t~0 main_~main__tagbuf_len~0))} [409] L26-->L868: Formula: (= v_main_~main__t~0_3 v_main_~main__tagbuf_len~0_6) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_3} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_3} AuxVars[] AssignedVars[] {678#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:48,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {678#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [412] L868-->L34: Formula: (and (= (ite (<= 0 v_main_~main__t~0_4) 1 0) v_main_~__tmp_1~0_1) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_4, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {678#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:48,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {678#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [417] L34-->L46: Formula: (and (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_5 v_main_~main__tagbuf_len~0_7) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_5, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_5, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {679#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-27 21:34:48,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {679#(not (= main_~__VERIFIER_assert__cond~1 0))} [424] L46-->L48: Formula: (= v_main_~__VERIFIER_assert__cond~1_3 0) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} AuxVars[] AssignedVars[] {673#false} is VALID [2022-04-27 21:34:48,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {673#false} [430] L48-->mainErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {673#false} is VALID [2022-04-27 21:34:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:48,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:48,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965066787] [2022-04-27 21:34:48,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965066787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:48,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:48,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:34:48,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000022855] [2022-04-27 21:34:48,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:48,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:34:48,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:48,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:48,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:48,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:34:48,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:48,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:34:48,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:34:48,734 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:49,450 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2022-04-27 21:34:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:34:49,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:34:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2022-04-27 21:34:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2022-04-27 21:34:49,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 142 transitions. [2022-04-27 21:34:49,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:49,585 INFO L225 Difference]: With dead ends: 121 [2022-04-27 21:34:49,586 INFO L226 Difference]: Without dead ends: 113 [2022-04-27 21:34:49,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-27 21:34:49,587 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 85 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:49,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 248 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 21:34:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-27 21:34:49,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-04-27 21:34:49,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:49,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:49,596 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:49,596 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:49,600 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-04-27 21:34:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-04-27 21:34:49,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:49,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:49,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-27 21:34:49,602 INFO L87 Difference]: Start difference. First operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-27 21:34:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:49,606 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-04-27 21:34:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-04-27 21:34:49,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:49,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:49,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:49,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2022-04-27 21:34:49,611 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2022-04-27 21:34:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:49,611 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2022-04-27 21:34:49,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-04-27 21:34:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 21:34:49,612 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:49,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:49,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:34:49,613 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:49,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:49,613 INFO L85 PathProgramCache]: Analyzing trace with hash 532189412, now seen corresponding path program 1 times [2022-04-27 21:34:49,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:49,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890177545] [2022-04-27 21:34:49,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:49,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:49,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:49,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {1165#true} is VALID [2022-04-27 21:34:49,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1165#true} is VALID [2022-04-27 21:34:49,678 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1165#true} {1165#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1165#true} is VALID [2022-04-27 21:34:49,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {1165#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:49,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {1165#true} is VALID [2022-04-27 21:34:49,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1165#true} is VALID [2022-04-27 21:34:49,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1165#true} {1165#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1165#true} is VALID [2022-04-27 21:34:49,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {1165#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1165#true} is VALID [2022-04-27 21:34:49,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {1165#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {1165#true} is VALID [2022-04-27 21:34:49,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {1165#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {1170#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:49,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {1170#(= main_~main__t~0 0)} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {1170#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:49,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {1170#(= main_~main__t~0 0)} [413] L65-->L72: Formula: (and (= (ite (<= 0 v_main_~main__t~0_7) 1 0) v_main_~__tmp_3~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {1170#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:49,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {1170#(= main_~main__t~0 0)} [419] L72-->L83: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {1170#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:49,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {1170#(= main_~main__t~0 0)} [427] L83-->L904: Formula: (and (= (+ v_main_~main__t~0_10 1) v_main_~main__t~0_9) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_10) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_2624_0~0_1) (= v_main_~main____CPAchecker_TMP_2~0_1 v_~__tmp_2624_1~0_1) (not (= v_main_~__VERIFIER_assert__cond~3_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_10, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__t~0=v_main_~main__t~0_9, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_1, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__t~0, ~__tmp_2624_0~0, ~__tmp_2624_1~0] {1171#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:34:49,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {1171#(<= 1 main_~main__t~0)} [432] L904-->L96: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_2 v_~__tmp_2624_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_2624_0~0_2)) InVars {~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2} OutVars{~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {1171#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:34:49,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {1171#(<= 1 main_~main__t~0)} [435] L96-->L103: Formula: (and (= v_main_~__tmp_5~0_1 (ite (<= 0 v_main_~main__t~0_11) 1 0)) (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_10) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_10, main_~main__t~0=v_main_~main__t~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {1172#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-27 21:34:49,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {1172#(not (= main_~__VERIFIER_assert__cond~4 0))} [439] L103-->L105: Formula: (= v_main_~__VERIFIER_assert__cond~4_3 0) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} OutVars{main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} AuxVars[] AssignedVars[] {1166#false} is VALID [2022-04-27 21:34:49,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {1166#false} [447] L105-->mainErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1166#false} is VALID [2022-04-27 21:34:49,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:49,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:49,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890177545] [2022-04-27 21:34:49,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890177545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:49,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:49,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:34:49,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757402653] [2022-04-27 21:34:49,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:49,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 21:34:49,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:49,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:49,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:49,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:34:49,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:49,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:34:49,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:34:49,698 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:50,343 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-04-27 21:34:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:34:50,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 21:34:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2022-04-27 21:34:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:50,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2022-04-27 21:34:50,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 125 transitions. [2022-04-27 21:34:50,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:50,450 INFO L225 Difference]: With dead ends: 113 [2022-04-27 21:34:50,450 INFO L226 Difference]: Without dead ends: 111 [2022-04-27 21:34:50,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-27 21:34:50,451 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 140 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:50,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 118 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 21:34:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-27 21:34:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-27 21:34:50,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:50,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:50,464 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:50,464 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:50,468 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-04-27 21:34:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-04-27 21:34:50,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:50,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:50,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-27 21:34:50,470 INFO L87 Difference]: Start difference. First operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-27 21:34:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:50,473 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-04-27 21:34:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-04-27 21:34:50,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:50,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:50,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:50,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2022-04-27 21:34:50,477 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2022-04-27 21:34:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:50,477 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2022-04-27 21:34:50,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-04-27 21:34:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:34:50,478 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:50,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:50,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 21:34:50,479 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:50,479 INFO L85 PathProgramCache]: Analyzing trace with hash -681995930, now seen corresponding path program 1 times [2022-04-27 21:34:50,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:50,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968170196] [2022-04-27 21:34:50,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:50,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:50,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:50,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {1649#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {1642#true} is VALID [2022-04-27 21:34:50,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {1642#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1642#true} is VALID [2022-04-27 21:34:50,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1642#true} {1642#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1642#true} is VALID [2022-04-27 21:34:50,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {1642#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1649#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:50,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {1649#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {1642#true} is VALID [2022-04-27 21:34:50,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {1642#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1642#true} is VALID [2022-04-27 21:34:50,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1642#true} {1642#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1642#true} is VALID [2022-04-27 21:34:50,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {1642#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1642#true} is VALID [2022-04-27 21:34:50,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {1642#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {1642#true} is VALID [2022-04-27 21:34:50,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {1642#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {1642#true} is VALID [2022-04-27 21:34:50,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {1642#true} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {1642#true} is VALID [2022-04-27 21:34:50,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {1642#true} [413] L65-->L72: Formula: (and (= (ite (<= 0 v_main_~main__t~0_7) 1 0) v_main_~__tmp_3~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {1642#true} is VALID [2022-04-27 21:34:50,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {1642#true} [419] L72-->L83: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {1642#true} is VALID [2022-04-27 21:34:50,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {1642#true} [427] L83-->L904: Formula: (and (= (+ v_main_~main__t~0_10 1) v_main_~main__t~0_9) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_10) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_2624_0~0_1) (= v_main_~main____CPAchecker_TMP_2~0_1 v_~__tmp_2624_1~0_1) (not (= v_main_~__VERIFIER_assert__cond~3_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_10, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__t~0=v_main_~main__t~0_9, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_1, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__t~0, ~__tmp_2624_0~0, ~__tmp_2624_1~0] {1642#true} is VALID [2022-04-27 21:34:50,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {1642#true} [432] L904-->L96: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_2 v_~__tmp_2624_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_2624_0~0_2)) InVars {~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2} OutVars{~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {1642#true} is VALID [2022-04-27 21:34:50,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {1642#true} [435] L96-->L103: Formula: (and (= v_main_~__tmp_5~0_1 (ite (<= 0 v_main_~main__t~0_11) 1 0)) (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_10) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_10, main_~main__t~0=v_main_~main__t~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {1647#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:50,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {1647#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [440] L103-->L115: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_11) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~main__t~0=v_main_~main__t~0_12, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_12, main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {1648#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-27 21:34:50,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {1648#(not (= main_~__VERIFIER_assert__cond~5 0))} [449] L115-->L117: Formula: (= v_main_~__VERIFIER_assert__cond~5_3 0) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_3} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_3} AuxVars[] AssignedVars[] {1643#false} is VALID [2022-04-27 21:34:50,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {1643#false} [459] L117-->mainErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1643#false} is VALID [2022-04-27 21:34:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:50,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:50,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968170196] [2022-04-27 21:34:50,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968170196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:50,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:50,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:34:50,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491820462] [2022-04-27 21:34:50,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:50,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 21:34:50,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:50,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:50,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:50,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:34:50,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:50,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:34:50,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:34:50,556 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:51,026 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-04-27 21:34:51,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:34:51,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 21:34:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2022-04-27 21:34:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2022-04-27 21:34:51,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 123 transitions. [2022-04-27 21:34:51,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:51,133 INFO L225 Difference]: With dead ends: 111 [2022-04-27 21:34:51,133 INFO L226 Difference]: Without dead ends: 107 [2022-04-27 21:34:51,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:51,134 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 65 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:51,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 199 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:34:51,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-27 21:34:51,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-04-27 21:34:51,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:51,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:51,143 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:51,143 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:51,146 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-04-27 21:34:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-04-27 21:34:51,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:51,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:51,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-27 21:34:51,147 INFO L87 Difference]: Start difference. First operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-27 21:34:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:51,150 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-04-27 21:34:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-04-27 21:34:51,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:51,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:51,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:51,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2022-04-27 21:34:51,165 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2022-04-27 21:34:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:51,166 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2022-04-27 21:34:51,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-04-27 21:34:51,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:34:51,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:51,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:51,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 21:34:51,167 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:51,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:51,167 INFO L85 PathProgramCache]: Analyzing trace with hash 333918414, now seen corresponding path program 1 times [2022-04-27 21:34:51,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:51,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750813986] [2022-04-27 21:34:51,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:51,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:51,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:51,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {2111#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {2103#true} is VALID [2022-04-27 21:34:51,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {2103#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2103#true} is VALID [2022-04-27 21:34:51,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2103#true} {2103#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2103#true} is VALID [2022-04-27 21:34:51,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {2103#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2111#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:51,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {2111#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {2103#true} is VALID [2022-04-27 21:34:51,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {2103#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2103#true} is VALID [2022-04-27 21:34:51,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2103#true} {2103#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2103#true} is VALID [2022-04-27 21:34:51,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {2103#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2103#true} is VALID [2022-04-27 21:34:51,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {2103#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {2103#true} is VALID [2022-04-27 21:34:51,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {2103#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {2108#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:51,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {2108#(= main_~main__t~0 0)} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {2108#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:51,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {2108#(= main_~main__t~0 0)} [413] L65-->L72: Formula: (and (= (ite (<= 0 v_main_~main__t~0_7) 1 0) v_main_~__tmp_3~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {2108#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:51,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {2108#(= main_~main__t~0 0)} [419] L72-->L83: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {2108#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:51,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {2108#(= main_~main__t~0 0)} [427] L83-->L904: Formula: (and (= (+ v_main_~main__t~0_10 1) v_main_~main__t~0_9) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_10) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_2624_0~0_1) (= v_main_~main____CPAchecker_TMP_2~0_1 v_~__tmp_2624_1~0_1) (not (= v_main_~__VERIFIER_assert__cond~3_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_10, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__t~0=v_main_~main__t~0_9, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_1, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__t~0, ~__tmp_2624_0~0, ~__tmp_2624_1~0] {2109#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:34:51,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {2109#(<= 1 main_~main__t~0)} [432] L904-->L96: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_2 v_~__tmp_2624_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_2624_0~0_2)) InVars {~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2} OutVars{~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {2109#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:34:51,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {2109#(<= 1 main_~main__t~0)} [436] L96-->L132: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (not (= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12))) InVars {main_~main__t~0=v_main_~main__t~0_13, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {2109#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:34:51,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {2109#(<= 1 main_~main__t~0)} [441] L132-->L136: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {2109#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:34:51,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {2109#(<= 1 main_~main__t~0)} [451] L136-->L143: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main____CPAchecker_TMP_4~0_3 0)) (= v_main_~__tmp_7~0_1 (ite (<= 0 v_main_~main__t~0_14) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {2110#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-27 21:34:51,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {2110#(not (= main_~__VERIFIER_assert__cond~6 0))} [461] L143-->L145: Formula: (= v_main_~__VERIFIER_assert__cond~6_3 0) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} OutVars{main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} AuxVars[] AssignedVars[] {2104#false} is VALID [2022-04-27 21:34:51,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {2104#false} [468] L145-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2104#false} is VALID [2022-04-27 21:34:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:51,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:51,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750813986] [2022-04-27 21:34:51,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750813986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:51,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:51,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:34:51,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991963683] [2022-04-27 21:34:51,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:51,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 21:34:51,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:51,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:51,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:51,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:34:51,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:51,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:34:51,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:34:51,250 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:51,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:51,879 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2022-04-27 21:34:51,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:34:51,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 21:34:51,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2022-04-27 21:34:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2022-04-27 21:34:51,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 139 transitions. [2022-04-27 21:34:51,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:51,992 INFO L225 Difference]: With dead ends: 125 [2022-04-27 21:34:51,992 INFO L226 Difference]: Without dead ends: 123 [2022-04-27 21:34:51,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-27 21:34:51,993 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 157 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:51,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 128 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 21:34:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-27 21:34:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-04-27 21:34:52,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:52,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:52,015 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:52,015 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:52,021 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2022-04-27 21:34:52,021 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2022-04-27 21:34:52,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:52,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:52,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states. [2022-04-27 21:34:52,023 INFO L87 Difference]: Start difference. First operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states. [2022-04-27 21:34:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:52,026 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2022-04-27 21:34:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2022-04-27 21:34:52,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:52,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:52,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:52,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-04-27 21:34:52,029 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2022-04-27 21:34:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:52,029 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-04-27 21:34:52,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-04-27 21:34:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:34:52,030 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:52,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:52,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 21:34:52,030 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:52,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:52,031 INFO L85 PathProgramCache]: Analyzing trace with hash 333950226, now seen corresponding path program 1 times [2022-04-27 21:34:52,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:52,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799311564] [2022-04-27 21:34:52,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:52,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:52,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:52,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {2620#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {2612#true} is VALID [2022-04-27 21:34:52,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {2612#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2612#true} is VALID [2022-04-27 21:34:52,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2612#true} {2612#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2612#true} is VALID [2022-04-27 21:34:52,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {2612#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2620#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:52,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {2620#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {2612#true} is VALID [2022-04-27 21:34:52,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {2612#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2612#true} is VALID [2022-04-27 21:34:52,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2612#true} {2612#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2612#true} is VALID [2022-04-27 21:34:52,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {2612#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2612#true} is VALID [2022-04-27 21:34:52,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {2612#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {2612#true} is VALID [2022-04-27 21:34:52,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {2612#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {2617#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:52,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {2617#(= main_~main__t~0 0)} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {2617#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:52,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {2617#(= main_~main__t~0 0)} [413] L65-->L72: Formula: (and (= (ite (<= 0 v_main_~main__t~0_7) 1 0) v_main_~__tmp_3~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {2617#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:52,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {2617#(= main_~main__t~0 0)} [419] L72-->L83: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {2617#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:52,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {2617#(= main_~main__t~0 0)} [427] L83-->L904: Formula: (and (= (+ v_main_~main__t~0_10 1) v_main_~main__t~0_9) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_10) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_2624_0~0_1) (= v_main_~main____CPAchecker_TMP_2~0_1 v_~__tmp_2624_1~0_1) (not (= v_main_~__VERIFIER_assert__cond~3_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_10, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__t~0=v_main_~main__t~0_9, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_1, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__t~0, ~__tmp_2624_0~0, ~__tmp_2624_1~0] {2618#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:34:52,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {2618#(<= 1 main_~main__t~0)} [432] L904-->L96: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_2 v_~__tmp_2624_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_2624_0~0_2)) InVars {~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2} OutVars{~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {2618#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:34:52,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {2618#(<= 1 main_~main__t~0)} [436] L96-->L132: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (not (= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12))) InVars {main_~main__t~0=v_main_~main__t~0_13, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {2618#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:34:52,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {2618#(<= 1 main_~main__t~0)} [442] L132-->L248: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_6~0_1 |v_main_#t~nondet8_2|) (= v_main_~main____CPAchecker_TMP_3~0_4 0)) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} OutVars{main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_6~0, main_#t~nondet8] {2618#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:34:52,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {2618#(<= 1 main_~main__t~0)} [453] L248-->L255: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (not (= v_main_~main____CPAchecker_TMP_6~0_3 0)) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {2619#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-27 21:34:52,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {2619#(not (= main_~__VERIFIER_assert__cond~12 0))} [464] L255-->L257: Formula: (= v_main_~__VERIFIER_assert__cond~12_3 0) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3} OutVars{main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3} AuxVars[] AssignedVars[] {2613#false} is VALID [2022-04-27 21:34:52,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {2613#false} [474] L257-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2613#false} is VALID [2022-04-27 21:34:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:52,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:52,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799311564] [2022-04-27 21:34:52,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799311564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:52,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:52,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:34:52,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549955230] [2022-04-27 21:34:52,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:52,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 21:34:52,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:52,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:52,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:52,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:34:52,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:52,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:34:52,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:34:52,132 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:52,696 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2022-04-27 21:34:52,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:34:52,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 21:34:52,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:52,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-04-27 21:34:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-04-27 21:34:52,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 117 transitions. [2022-04-27 21:34:52,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:52,805 INFO L225 Difference]: With dead ends: 105 [2022-04-27 21:34:52,805 INFO L226 Difference]: Without dead ends: 103 [2022-04-27 21:34:52,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-27 21:34:52,806 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 130 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:52,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 100 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 21:34:52,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-27 21:34:52,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-27 21:34:52,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:52,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:52,814 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:52,814 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:52,816 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2022-04-27 21:34:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-27 21:34:52,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:52,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:52,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-27 21:34:52,817 INFO L87 Difference]: Start difference. First operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-27 21:34:52,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:52,820 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2022-04-27 21:34:52,820 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-27 21:34:52,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:52,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:52,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:52,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-04-27 21:34:52,822 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2022-04-27 21:34:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:52,823 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-04-27 21:34:52,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-27 21:34:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:34:52,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:52,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:52,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 21:34:52,824 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:52,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1761537745, now seen corresponding path program 1 times [2022-04-27 21:34:52,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:52,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168763181] [2022-04-27 21:34:52,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:52,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:52,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:52,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {3066#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {3057#true} is VALID [2022-04-27 21:34:52,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {3057#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3057#true} is VALID [2022-04-27 21:34:52,998 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3057#true} {3057#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3057#true} is VALID [2022-04-27 21:34:52,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {3057#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3066#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:52,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {3066#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {3057#true} is VALID [2022-04-27 21:34:52,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {3057#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3057#true} is VALID [2022-04-27 21:34:52,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3057#true} {3057#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3057#true} is VALID [2022-04-27 21:34:52,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {3057#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3057#true} is VALID [2022-04-27 21:34:53,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {3057#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {3057#true} is VALID [2022-04-27 21:34:53,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {3057#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {3062#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 21:34:53,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {3062#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {3063#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:53,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {3063#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [413] L65-->L72: Formula: (and (= (ite (<= 0 v_main_~main__t~0_7) 1 0) v_main_~__tmp_3~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {3063#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:53,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {3063#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [419] L72-->L83: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {3063#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:53,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {3063#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [427] L83-->L904: Formula: (and (= (+ v_main_~main__t~0_10 1) v_main_~main__t~0_9) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_10) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_2624_0~0_1) (= v_main_~main____CPAchecker_TMP_2~0_1 v_~__tmp_2624_1~0_1) (not (= v_main_~__VERIFIER_assert__cond~3_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_10, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__t~0=v_main_~main__t~0_9, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_1, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__t~0, ~__tmp_2624_0~0, ~__tmp_2624_1~0] {3064#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:53,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {3064#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [432] L904-->L96: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_2 v_~__tmp_2624_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_2624_0~0_2)) InVars {~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2} OutVars{~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {3064#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:53,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {3064#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [436] L96-->L132: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (not (= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12))) InVars {main_~main__t~0=v_main_~main__t~0_13, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {3064#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:53,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {3064#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [441] L132-->L136: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {3064#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:53,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {3064#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [451] L136-->L143: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main____CPAchecker_TMP_4~0_3 0)) (= v_main_~__tmp_7~0_1 (ite (<= 0 v_main_~main__t~0_14) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {3064#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:53,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {3064#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [462] L143-->L155: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0)) (= v_main_~__tmp_8~0_1 (ite (<= v_main_~main__t~0_15 v_main_~main__tagbuf_len~0_13) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4} OutVars{main_~main__t~0=v_main_~main__t~0_15, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {3065#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-27 21:34:53,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {3065#(not (= main_~__VERIFIER_assert__cond~7 0))} [470] L155-->L157: Formula: (= v_main_~__VERIFIER_assert__cond~7_3 0) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_3} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_3} AuxVars[] AssignedVars[] {3058#false} is VALID [2022-04-27 21:34:53,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {3058#false} [480] L157-->mainErr5ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3058#false} is VALID [2022-04-27 21:34:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:53,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:53,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168763181] [2022-04-27 21:34:53,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168763181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:53,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:53,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:34:53,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820389262] [2022-04-27 21:34:53,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:53,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 21:34:53,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:53,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:53,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:53,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:34:53,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:53,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:34:53,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:53,038 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:53,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:53,811 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2022-04-27 21:34:53,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:34:53,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 21:34:53,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2022-04-27 21:34:53,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2022-04-27 21:34:53,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 156 transitions. [2022-04-27 21:34:53,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:53,945 INFO L225 Difference]: With dead ends: 140 [2022-04-27 21:34:53,945 INFO L226 Difference]: Without dead ends: 138 [2022-04-27 21:34:53,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-27 21:34:53,946 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 104 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:53,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 268 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 21:34:53,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-27 21:34:53,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 109. [2022-04-27 21:34:53,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:53,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 109 states, 96 states have (on average 1.25) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:53,963 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 109 states, 96 states have (on average 1.25) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:53,964 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 109 states, 96 states have (on average 1.25) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:53,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:53,967 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2022-04-27 21:34:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 154 transitions. [2022-04-27 21:34:53,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:53,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:53,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 96 states have (on average 1.25) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 138 states. [2022-04-27 21:34:53,968 INFO L87 Difference]: Start difference. First operand has 109 states, 96 states have (on average 1.25) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 138 states. [2022-04-27 21:34:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:53,972 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2022-04-27 21:34:53,972 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 154 transitions. [2022-04-27 21:34:53,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:53,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:53,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:53,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.25) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2022-04-27 21:34:53,975 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 18 [2022-04-27 21:34:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:53,975 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2022-04-27 21:34:53,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-04-27 21:34:53,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:34:53,976 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:53,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:53,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 21:34:53,976 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:53,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:53,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1761568563, now seen corresponding path program 1 times [2022-04-27 21:34:53,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:53,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108357501] [2022-04-27 21:34:53,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:53,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:54,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:54,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {3629#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {3621#true} is VALID [2022-04-27 21:34:54,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {3621#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3621#true} is VALID [2022-04-27 21:34:54,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3621#true} {3621#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3621#true} is VALID [2022-04-27 21:34:54,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {3621#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3629#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:54,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {3629#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {3621#true} is VALID [2022-04-27 21:34:54,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {3621#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3621#true} is VALID [2022-04-27 21:34:54,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3621#true} {3621#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3621#true} is VALID [2022-04-27 21:34:54,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {3621#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3621#true} is VALID [2022-04-27 21:34:54,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {3621#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {3621#true} is VALID [2022-04-27 21:34:54,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {3621#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {3626#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:54,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {3626#(= main_~main__t~0 0)} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {3626#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:54,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {3626#(= main_~main__t~0 0)} [413] L65-->L72: Formula: (and (= (ite (<= 0 v_main_~main__t~0_7) 1 0) v_main_~__tmp_3~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {3626#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:54,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {3626#(= main_~main__t~0 0)} [419] L72-->L83: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {3626#(= main_~main__t~0 0)} is VALID [2022-04-27 21:34:54,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {3626#(= main_~main__t~0 0)} [427] L83-->L904: Formula: (and (= (+ v_main_~main__t~0_10 1) v_main_~main__t~0_9) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_10) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_2624_0~0_1) (= v_main_~main____CPAchecker_TMP_2~0_1 v_~__tmp_2624_1~0_1) (not (= v_main_~__VERIFIER_assert__cond~3_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_10, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__t~0=v_main_~main__t~0_9, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_1, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__t~0, ~__tmp_2624_0~0, ~__tmp_2624_1~0] {3627#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:34:54,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {3627#(<= 1 main_~main__t~0)} [432] L904-->L96: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_2 v_~__tmp_2624_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_2624_0~0_2)) InVars {~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2} OutVars{~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {3627#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:34:54,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {3627#(<= 1 main_~main__t~0)} [436] L96-->L132: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (not (= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12))) InVars {main_~main__t~0=v_main_~main__t~0_13, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {3627#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:34:54,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {3627#(<= 1 main_~main__t~0)} [441] L132-->L136: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {3627#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:34:54,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {3627#(<= 1 main_~main__t~0)} [452] L136-->L282: Formula: (= v_main_~main____CPAchecker_TMP_4~0_4 0) InVars {main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_4} OutVars{main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_4} AuxVars[] AssignedVars[] {3627#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:34:54,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {3627#(<= 1 main_~main__t~0)} [463] L282-->L205: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (<= 0 v_main_~main__t~0_21) 1 0) v_main_~__tmp_11~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_21, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {3628#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-27 21:34:54,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {3628#(not (= main_~__VERIFIER_assert__cond~10 0))} [472] L205-->L207: Formula: (= v_main_~__VERIFIER_assert__cond~10_3 0) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} OutVars{main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} AuxVars[] AssignedVars[] {3622#false} is VALID [2022-04-27 21:34:54,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {3622#false} [484] L207-->mainErr8ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3622#false} is VALID [2022-04-27 21:34:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:54,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:54,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108357501] [2022-04-27 21:34:54,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108357501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:54,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:54,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:34:54,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973189039] [2022-04-27 21:34:54,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:54,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 21:34:54,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:54,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:54,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:54,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:34:54,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:54,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:34:54,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:34:54,055 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:54,635 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2022-04-27 21:34:54,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:34:54,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 21:34:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-04-27 21:34:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-04-27 21:34:54,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 138 transitions. [2022-04-27 21:34:54,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:54,766 INFO L225 Difference]: With dead ends: 130 [2022-04-27 21:34:54,766 INFO L226 Difference]: Without dead ends: 128 [2022-04-27 21:34:54,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-27 21:34:54,767 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 148 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:54,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 120 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:34:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-27 21:34:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 107. [2022-04-27 21:34:54,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:54,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:54,780 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:54,780 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:54,783 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2022-04-27 21:34:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2022-04-27 21:34:54,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:54,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:54,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 128 states. [2022-04-27 21:34:54,784 INFO L87 Difference]: Start difference. First operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 128 states. [2022-04-27 21:34:54,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:54,787 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2022-04-27 21:34:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2022-04-27 21:34:54,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:54,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:54,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:54,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-04-27 21:34:54,791 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 18 [2022-04-27 21:34:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:54,791 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-04-27 21:34:54,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-04-27 21:34:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:34:54,792 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:54,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:54,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 21:34:54,792 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:54,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:54,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1762523925, now seen corresponding path program 1 times [2022-04-27 21:34:54,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:54,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956056552] [2022-04-27 21:34:54,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:54,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:54,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:54,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {4158#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {4149#true} is VALID [2022-04-27 21:34:54,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {4149#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4149#true} is VALID [2022-04-27 21:34:54,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4149#true} {4149#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4149#true} is VALID [2022-04-27 21:34:54,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {4149#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4158#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:54,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {4158#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {4149#true} is VALID [2022-04-27 21:34:54,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {4149#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4149#true} is VALID [2022-04-27 21:34:54,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4149#true} {4149#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4149#true} is VALID [2022-04-27 21:34:54,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {4149#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4149#true} is VALID [2022-04-27 21:34:54,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {4149#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {4149#true} is VALID [2022-04-27 21:34:54,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {4149#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {4154#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 21:34:54,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {4154#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {4155#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:54,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {4155#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [413] L65-->L72: Formula: (and (= (ite (<= 0 v_main_~main__t~0_7) 1 0) v_main_~__tmp_3~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {4155#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:54,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {4155#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [419] L72-->L83: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {4155#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:54,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {4155#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [427] L83-->L904: Formula: (and (= (+ v_main_~main__t~0_10 1) v_main_~main__t~0_9) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_10) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_2624_0~0_1) (= v_main_~main____CPAchecker_TMP_2~0_1 v_~__tmp_2624_1~0_1) (not (= v_main_~__VERIFIER_assert__cond~3_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_10, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__t~0=v_main_~main__t~0_9, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_1, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__t~0, ~__tmp_2624_0~0, ~__tmp_2624_1~0] {4156#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:54,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {4156#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [432] L904-->L96: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_2 v_~__tmp_2624_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_2624_0~0_2)) InVars {~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2} OutVars{~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {4156#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:54,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {4156#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [436] L96-->L132: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (not (= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12))) InVars {main_~main__t~0=v_main_~main__t~0_13, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {4156#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:54,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {4156#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [442] L132-->L248: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_6~0_1 |v_main_#t~nondet8_2|) (= v_main_~main____CPAchecker_TMP_3~0_4 0)) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} OutVars{main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_6~0, main_#t~nondet8] {4156#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:54,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {4156#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [453] L248-->L255: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (not (= v_main_~main____CPAchecker_TMP_6~0_3 0)) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {4156#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:54,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {4156#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [465] L255-->L267: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {4157#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-27 21:34:54,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {4157#(not (= main_~__VERIFIER_assert__cond~13 0))} [476] L267-->L269: Formula: (= v_main_~__VERIFIER_assert__cond~13_3 0) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_3} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_3} AuxVars[] AssignedVars[] {4150#false} is VALID [2022-04-27 21:34:54,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {4150#false} [488] L269-->mainErr11ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4150#false} is VALID [2022-04-27 21:34:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:54,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:54,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956056552] [2022-04-27 21:34:54,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956056552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:54,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:54,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:34:54,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433298317] [2022-04-27 21:34:54,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:54,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 21:34:54,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:54,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:54,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:54,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:34:54,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:54,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:34:54,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:54,920 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:55,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:55,495 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2022-04-27 21:34:55,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:34:55,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 21:34:55,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-27 21:34:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-27 21:34:55,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 131 transitions. [2022-04-27 21:34:55,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:55,598 INFO L225 Difference]: With dead ends: 117 [2022-04-27 21:34:55,598 INFO L226 Difference]: Without dead ends: 113 [2022-04-27 21:34:55,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-27 21:34:55,599 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 77 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:55,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 188 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:34:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-27 21:34:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-04-27 21:34:55,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:55,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:55,614 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:55,614 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:55,617 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2022-04-27 21:34:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2022-04-27 21:34:55,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:55,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:55,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-27 21:34:55,618 INFO L87 Difference]: Start difference. First operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-27 21:34:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:55,620 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2022-04-27 21:34:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2022-04-27 21:34:55,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:55,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:55,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:55,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:55,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2022-04-27 21:34:55,623 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 18 [2022-04-27 21:34:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:55,623 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2022-04-27 21:34:55,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2022-04-27 21:34:55,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 21:34:55,624 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:55,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:55,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 21:34:55,625 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:55,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:55,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1225947876, now seen corresponding path program 1 times [2022-04-27 21:34:55,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:55,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410215220] [2022-04-27 21:34:55,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:55,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:55,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:55,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {4646#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {4637#true} is VALID [2022-04-27 21:34:55,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {4637#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4637#true} is VALID [2022-04-27 21:34:55,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4637#true} {4637#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4637#true} is VALID [2022-04-27 21:34:55,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {4637#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4646#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:55,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {4646#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {4637#true} is VALID [2022-04-27 21:34:55,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {4637#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4637#true} is VALID [2022-04-27 21:34:55,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4637#true} {4637#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4637#true} is VALID [2022-04-27 21:34:55,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {4637#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4637#true} is VALID [2022-04-27 21:34:55,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {4637#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {4637#true} is VALID [2022-04-27 21:34:55,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {4637#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {4642#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 21:34:55,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {4642#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {4643#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:55,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {4643#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [413] L65-->L72: Formula: (and (= (ite (<= 0 v_main_~main__t~0_7) 1 0) v_main_~__tmp_3~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {4643#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:55,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {4643#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [419] L72-->L83: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {4643#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:55,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {4643#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [427] L83-->L904: Formula: (and (= (+ v_main_~main__t~0_10 1) v_main_~main__t~0_9) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_10) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_2624_0~0_1) (= v_main_~main____CPAchecker_TMP_2~0_1 v_~__tmp_2624_1~0_1) (not (= v_main_~__VERIFIER_assert__cond~3_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_10, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__t~0=v_main_~main__t~0_9, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_1, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__t~0, ~__tmp_2624_0~0, ~__tmp_2624_1~0] {4644#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:55,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {4644#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [432] L904-->L96: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_2 v_~__tmp_2624_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_2624_0~0_2)) InVars {~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2} OutVars{~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {4644#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:55,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {4644#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [436] L96-->L132: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (not (= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12))) InVars {main_~main__t~0=v_main_~main__t~0_13, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {4644#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:55,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {4644#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [441] L132-->L136: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {4644#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:55,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {4644#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [452] L136-->L282: Formula: (= v_main_~main____CPAchecker_TMP_4~0_4 0) InVars {main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_4} OutVars{main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_4} AuxVars[] AssignedVars[] {4644#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:55,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {4644#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [463] L282-->L205: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (<= 0 v_main_~main__t~0_21) 1 0) v_main_~__tmp_11~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_21, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {4644#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:34:55,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {4644#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [473] L205-->L217: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= v_main_~main__t~0_22 v_main_~main__tagbuf_len~0_17) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__t~0=v_main_~main__t~0_22, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~main__t~0=v_main_~main__t~0_22, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {4645#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 21:34:55,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {4645#(not (= main_~__VERIFIER_assert__cond~11 0))} [486] L217-->L219: Formula: (= v_main_~__VERIFIER_assert__cond~11_3 0) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} AuxVars[] AssignedVars[] {4638#false} is VALID [2022-04-27 21:34:55,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {4638#false} [496] L219-->mainErr9ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4638#false} is VALID [2022-04-27 21:34:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:55,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:55,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410215220] [2022-04-27 21:34:55,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410215220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:55,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:55,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:34:55,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255537796] [2022-04-27 21:34:55,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:55,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 21:34:55,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:55,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:55,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:55,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:34:55,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:55,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:34:55,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:55,745 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:56,330 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-04-27 21:34:56,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:34:56,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 21:34:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2022-04-27 21:34:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2022-04-27 21:34:56,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 151 transitions. [2022-04-27 21:34:56,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:56,442 INFO L225 Difference]: With dead ends: 135 [2022-04-27 21:34:56,442 INFO L226 Difference]: Without dead ends: 133 [2022-04-27 21:34:56,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-27 21:34:56,443 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 97 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:56,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 242 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:34:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-27 21:34:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2022-04-27 21:34:56,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:56,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,463 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,463 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:56,465 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2022-04-27 21:34:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2022-04-27 21:34:56,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:56,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:56,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 133 states. [2022-04-27 21:34:56,467 INFO L87 Difference]: Start difference. First operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 133 states. [2022-04-27 21:34:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:56,469 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2022-04-27 21:34:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2022-04-27 21:34:56,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:56,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:56,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:56,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-04-27 21:34:56,471 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 19 [2022-04-27 21:34:56,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:56,472 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-04-27 21:34:56,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-27 21:34:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 21:34:56,472 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:56,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:56,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 21:34:56,473 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:56,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:56,473 INFO L85 PathProgramCache]: Analyzing trace with hash 620705850, now seen corresponding path program 1 times [2022-04-27 21:34:56,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:56,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876958212] [2022-04-27 21:34:56,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:56,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:56,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:56,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {5196#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {5189#true} is VALID [2022-04-27 21:34:56,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {5189#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5189#true} is VALID [2022-04-27 21:34:56,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5189#true} {5189#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5189#true} is VALID [2022-04-27 21:34:56,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {5189#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5196#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:56,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {5196#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {5189#true} is VALID [2022-04-27 21:34:56,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {5189#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5189#true} is VALID [2022-04-27 21:34:56,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5189#true} {5189#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5189#true} is VALID [2022-04-27 21:34:56,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {5189#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5189#true} is VALID [2022-04-27 21:34:56,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {5189#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {5189#true} is VALID [2022-04-27 21:34:56,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {5189#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {5194#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:56,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {5194#(<= 0 main_~main__tagbuf_len~0)} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {5194#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:56,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {5194#(<= 0 main_~main__tagbuf_len~0)} [413] L65-->L72: Formula: (and (= (ite (<= 0 v_main_~main__t~0_7) 1 0) v_main_~__tmp_3~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {5194#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:56,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {5194#(<= 0 main_~main__tagbuf_len~0)} [419] L72-->L83: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {5194#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:56,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {5194#(<= 0 main_~main__tagbuf_len~0)} [427] L83-->L904: Formula: (and (= (+ v_main_~main__t~0_10 1) v_main_~main__t~0_9) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_10) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_2624_0~0_1) (= v_main_~main____CPAchecker_TMP_2~0_1 v_~__tmp_2624_1~0_1) (not (= v_main_~__VERIFIER_assert__cond~3_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_10, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__t~0=v_main_~main__t~0_9, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_1, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__t~0, ~__tmp_2624_0~0, ~__tmp_2624_1~0] {5194#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:56,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {5194#(<= 0 main_~main__tagbuf_len~0)} [432] L904-->L96: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_2 v_~__tmp_2624_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_2624_0~0_2)) InVars {~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2} OutVars{~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {5194#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:56,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {5194#(<= 0 main_~main__tagbuf_len~0)} [436] L96-->L132: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (not (= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12))) InVars {main_~main__t~0=v_main_~main__t~0_13, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {5194#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:56,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {5194#(<= 0 main_~main__tagbuf_len~0)} [441] L132-->L136: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {5194#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:56,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {5194#(<= 0 main_~main__tagbuf_len~0)} [451] L136-->L143: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main____CPAchecker_TMP_4~0_3 0)) (= v_main_~__tmp_7~0_1 (ite (<= 0 v_main_~main__t~0_14) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {5194#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:56,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {5194#(<= 0 main_~main__tagbuf_len~0)} [462] L143-->L155: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0)) (= v_main_~__tmp_8~0_1 (ite (<= v_main_~main__t~0_15 v_main_~main__tagbuf_len~0_13) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4} OutVars{main_~main__t~0=v_main_~main__t~0_15, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {5194#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:56,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {5194#(<= 0 main_~main__tagbuf_len~0)} [471] L155-->L164: Formula: (and (= v_main_~main____CPAchecker_TMP_5~0_1 v_main_~main__t~0_17) (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= (+ v_main_~main__t~0_17 1) v_main_~main__t~0_16)) InVars {main_~main__t~0=v_main_~main__t~0_17, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~main____CPAchecker_TMP_5~0=v_main_~main____CPAchecker_TMP_5~0_1, main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_5~0] {5194#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:56,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {5194#(<= 0 main_~main__tagbuf_len~0)} [482] L164-->L171: Formula: (and (= (ite (<= 0 v_main_~main__t~0_18) 1 0) v_main_~__tmp_9~0_1) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~main__t~0_18 v_main_~main__tagbuf_len~0_14)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_14, main_~main__t~0=v_main_~main__t~0_18} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__t~0=v_main_~main__t~0_18, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_14} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {5195#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-27 21:34:56,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {5195#(not (= main_~__VERIFIER_assert__cond~8 0))} [494] L171-->L173: Formula: (= v_main_~__VERIFIER_assert__cond~8_3 0) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_3} OutVars{main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_3} AuxVars[] AssignedVars[] {5190#false} is VALID [2022-04-27 21:34:56,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {5190#false} [502] L173-->mainErr6ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5190#false} is VALID [2022-04-27 21:34:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:56,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:56,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876958212] [2022-04-27 21:34:56,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876958212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:56,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:56,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:34:56,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348391951] [2022-04-27 21:34:56,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:56,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 21:34:56,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:56,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:56,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:34:56,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:56,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:34:56,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:34:56,546 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:56,881 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-27 21:34:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:34:56,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 21:34:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:56,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-04-27 21:34:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-04-27 21:34:56,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 113 transitions. [2022-04-27 21:34:56,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:56,976 INFO L225 Difference]: With dead ends: 111 [2022-04-27 21:34:56,976 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 21:34:56,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:56,977 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 152 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:56,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 115 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:34:56,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 21:34:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-27 21:34:56,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:56,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,992 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,993 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:56,994 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-04-27 21:34:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-04-27 21:34:56,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:56,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:56,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-27 21:34:56,995 INFO L87 Difference]: Start difference. First operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-27 21:34:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:56,997 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-04-27 21:34:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-04-27 21:34:56,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:56,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:56,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:56,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2022-04-27 21:34:56,999 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 20 [2022-04-27 21:34:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:57,000 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2022-04-27 21:34:57,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-04-27 21:34:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 21:34:57,000 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:57,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:57,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 21:34:57,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:57,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:57,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2062013697, now seen corresponding path program 1 times [2022-04-27 21:34:57,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:57,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283144903] [2022-04-27 21:34:57,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:57,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:57,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {5666#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {5659#true} is VALID [2022-04-27 21:34:57,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {5659#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5659#true} is VALID [2022-04-27 21:34:57,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5659#true} {5659#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5659#true} is VALID [2022-04-27 21:34:57,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {5659#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5666#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:57,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {5666#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {5659#true} is VALID [2022-04-27 21:34:57,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {5659#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5659#true} is VALID [2022-04-27 21:34:57,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5659#true} {5659#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5659#true} is VALID [2022-04-27 21:34:57,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {5659#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5659#true} is VALID [2022-04-27 21:34:57,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {5659#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {5659#true} is VALID [2022-04-27 21:34:57,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {5659#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {5659#true} is VALID [2022-04-27 21:34:57,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {5659#true} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {5659#true} is VALID [2022-04-27 21:34:57,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {5659#true} [413] L65-->L72: Formula: (and (= (ite (<= 0 v_main_~main__t~0_7) 1 0) v_main_~__tmp_3~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {5659#true} is VALID [2022-04-27 21:34:57,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {5659#true} [419] L72-->L83: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {5659#true} is VALID [2022-04-27 21:34:57,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {5659#true} [427] L83-->L904: Formula: (and (= (+ v_main_~main__t~0_10 1) v_main_~main__t~0_9) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_10) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_2624_0~0_1) (= v_main_~main____CPAchecker_TMP_2~0_1 v_~__tmp_2624_1~0_1) (not (= v_main_~__VERIFIER_assert__cond~3_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_10, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__t~0=v_main_~main__t~0_9, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_1, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__t~0, ~__tmp_2624_0~0, ~__tmp_2624_1~0] {5659#true} is VALID [2022-04-27 21:34:57,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {5659#true} [432] L904-->L96: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_2 v_~__tmp_2624_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_2624_0~0_2)) InVars {~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2} OutVars{~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {5659#true} is VALID [2022-04-27 21:34:57,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {5659#true} [436] L96-->L132: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (not (= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12))) InVars {main_~main__t~0=v_main_~main__t~0_13, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {5659#true} is VALID [2022-04-27 21:34:57,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {5659#true} [441] L132-->L136: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {5659#true} is VALID [2022-04-27 21:34:57,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {5659#true} [451] L136-->L143: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main____CPAchecker_TMP_4~0_3 0)) (= v_main_~__tmp_7~0_1 (ite (<= 0 v_main_~main__t~0_14) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {5659#true} is VALID [2022-04-27 21:34:57,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {5659#true} [462] L143-->L155: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0)) (= v_main_~__tmp_8~0_1 (ite (<= v_main_~main__t~0_15 v_main_~main__tagbuf_len~0_13) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4} OutVars{main_~main__t~0=v_main_~main__t~0_15, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {5659#true} is VALID [2022-04-27 21:34:57,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {5659#true} [471] L155-->L164: Formula: (and (= v_main_~main____CPAchecker_TMP_5~0_1 v_main_~main__t~0_17) (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= (+ v_main_~main__t~0_17 1) v_main_~main__t~0_16)) InVars {main_~main__t~0=v_main_~main__t~0_17, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~main____CPAchecker_TMP_5~0=v_main_~main____CPAchecker_TMP_5~0_1, main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_5~0] {5659#true} is VALID [2022-04-27 21:34:57,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {5659#true} [482] L164-->L171: Formula: (and (= (ite (<= 0 v_main_~main__t~0_18) 1 0) v_main_~__tmp_9~0_1) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~main__t~0_18 v_main_~main__tagbuf_len~0_14)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_14, main_~main__t~0=v_main_~main__t~0_18} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__t~0=v_main_~main__t~0_18, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_14} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {5664#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:57,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {5664#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [495] L171-->L183: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= (ite (<= v_main_~main__t~0_19 v_main_~main__tagbuf_len~0_15) 1 0) v_main_~__tmp_10~0_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_19, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_15} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~main__t~0=v_main_~main__t~0_19, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_15, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {5665#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-27 21:34:57,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {5665#(not (= main_~__VERIFIER_assert__cond~9 0))} [504] L183-->L185: Formula: (= v_main_~__VERIFIER_assert__cond~9_3 0) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_3} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_3} AuxVars[] AssignedVars[] {5660#false} is VALID [2022-04-27 21:34:57,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {5660#false} [508] L185-->mainErr7ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5660#false} is VALID [2022-04-27 21:34:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:57,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:57,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283144903] [2022-04-27 21:34:57,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283144903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:57,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:57,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:34:57,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808602354] [2022-04-27 21:34:57,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:57,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 21:34:57,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:57,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:57,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:57,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:34:57,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:57,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:34:57,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:34:57,070 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:57,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:57,432 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-04-27 21:34:57,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:34:57,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 21:34:57,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-04-27 21:34:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-04-27 21:34:57,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 111 transitions. [2022-04-27 21:34:57,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:57,538 INFO L225 Difference]: With dead ends: 109 [2022-04-27 21:34:57,538 INFO L226 Difference]: Without dead ends: 105 [2022-04-27 21:34:57,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:57,539 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:57,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:34:57,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-27 21:34:57,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-04-27 21:34:57,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:57,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:57,558 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:57,558 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:57,560 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2022-04-27 21:34:57,560 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-27 21:34:57,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:57,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:57,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-27 21:34:57,561 INFO L87 Difference]: Start difference. First operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-27 21:34:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:57,563 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2022-04-27 21:34:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-27 21:34:57,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:57,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:57,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:57,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:57,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-04-27 21:34:57,565 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 21 [2022-04-27 21:34:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:57,565 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-04-27 21:34:57,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-27 21:34:57,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:34:57,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:57,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:57,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 21:34:57,566 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:57,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:57,567 INFO L85 PathProgramCache]: Analyzing trace with hash -502144601, now seen corresponding path program 1 times [2022-04-27 21:34:57,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:57,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804260341] [2022-04-27 21:34:57,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:57,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:57,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:57,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {6125#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {6116#true} is VALID [2022-04-27 21:34:57,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {6116#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6116#true} is VALID [2022-04-27 21:34:57,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6116#true} {6116#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6116#true} is VALID [2022-04-27 21:34:57,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {6116#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6125#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:57,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {6125#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {6116#true} is VALID [2022-04-27 21:34:57,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {6116#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6116#true} is VALID [2022-04-27 21:34:57,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6116#true} {6116#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6116#true} is VALID [2022-04-27 21:34:57,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {6116#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6116#true} is VALID [2022-04-27 21:34:57,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {6116#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {6116#true} is VALID [2022-04-27 21:34:57,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {6116#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {6116#true} is VALID [2022-04-27 21:34:57,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {6116#true} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {6116#true} is VALID [2022-04-27 21:34:57,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {6116#true} [413] L65-->L72: Formula: (and (= (ite (<= 0 v_main_~main__t~0_7) 1 0) v_main_~__tmp_3~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {6116#true} is VALID [2022-04-27 21:34:57,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {6116#true} [419] L72-->L83: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~main__t~0=v_main_~main__t~0_8, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {6116#true} is VALID [2022-04-27 21:34:57,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {6116#true} [427] L83-->L904: Formula: (and (= (+ v_main_~main__t~0_10 1) v_main_~main__t~0_9) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_10) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_2624_0~0_1) (= v_main_~main____CPAchecker_TMP_2~0_1 v_~__tmp_2624_1~0_1) (not (= v_main_~__VERIFIER_assert__cond~3_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_10, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__t~0=v_main_~main__t~0_9, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_1, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__t~0, ~__tmp_2624_0~0, ~__tmp_2624_1~0] {6116#true} is VALID [2022-04-27 21:34:57,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {6116#true} [432] L904-->L96: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_2 v_~__tmp_2624_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_2624_0~0_2)) InVars {~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2} OutVars{~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {6116#true} is VALID [2022-04-27 21:34:57,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {6116#true} [436] L96-->L132: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (not (= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12))) InVars {main_~main__t~0=v_main_~main__t~0_13, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {6121#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:34:57,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {6121#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [441] L132-->L136: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {6121#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:34:57,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {6121#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [451] L136-->L143: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main____CPAchecker_TMP_4~0_3 0)) (= v_main_~__tmp_7~0_1 (ite (<= 0 v_main_~main__t~0_14) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {6121#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:34:57,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {6121#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [462] L143-->L155: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0)) (= v_main_~__tmp_8~0_1 (ite (<= v_main_~main__t~0_15 v_main_~main__tagbuf_len~0_13) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4} OutVars{main_~main__t~0=v_main_~main__t~0_15, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {6122#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~7 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2022-04-27 21:34:57,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {6122#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~7 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} [471] L155-->L164: Formula: (and (= v_main_~main____CPAchecker_TMP_5~0_1 v_main_~main__t~0_17) (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= (+ v_main_~main__t~0_17 1) v_main_~main__t~0_16)) InVars {main_~main__t~0=v_main_~main__t~0_17, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~main____CPAchecker_TMP_5~0=v_main_~main____CPAchecker_TMP_5~0_1, main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_5~0] {6123#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:57,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {6123#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [483] L164-->L282: Formula: (not (= v_main_~main__t~0_20 v_main_~main__tagbuf_len~0_16)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_16, main_~main__t~0=v_main_~main__t~0_20} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_16, main_~main__t~0=v_main_~main__t~0_20} AuxVars[] AssignedVars[] {6123#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:57,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {6123#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [463] L282-->L205: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (<= 0 v_main_~main__t~0_21) 1 0) v_main_~__tmp_11~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_21, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {6123#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:57,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {6123#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [473] L205-->L217: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= v_main_~main__t~0_22 v_main_~main__tagbuf_len~0_17) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__t~0=v_main_~main__t~0_22, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~main__t~0=v_main_~main__t~0_22, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {6124#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 21:34:57,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {6124#(not (= main_~__VERIFIER_assert__cond~11 0))} [486] L217-->L219: Formula: (= v_main_~__VERIFIER_assert__cond~11_3 0) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} AuxVars[] AssignedVars[] {6117#false} is VALID [2022-04-27 21:34:57,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {6117#false} [496] L219-->mainErr9ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6117#false} is VALID [2022-04-27 21:34:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:57,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:57,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804260341] [2022-04-27 21:34:57,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804260341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:57,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:57,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:34:57,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960938669] [2022-04-27 21:34:57,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:57,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:34:57,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:57,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:57,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:57,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:34:57,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:57,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:34:57,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:57,708 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:58,339 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2022-04-27 21:34:58,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:34:58,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:34:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:58,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2022-04-27 21:34:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2022-04-27 21:34:58,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 125 transitions. [2022-04-27 21:34:58,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:58,440 INFO L225 Difference]: With dead ends: 121 [2022-04-27 21:34:58,440 INFO L226 Difference]: Without dead ends: 119 [2022-04-27 21:34:58,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:34:58,441 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 199 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:58,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 80 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:34:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-27 21:34:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-04-27 21:34:58,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:58,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:58,467 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:58,468 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:58,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:58,470 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-04-27 21:34:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2022-04-27 21:34:58,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:58,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:58,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states. [2022-04-27 21:34:58,470 INFO L87 Difference]: Start difference. First operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states. [2022-04-27 21:34:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:58,472 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-04-27 21:34:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2022-04-27 21:34:58,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:58,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:58,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:58,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-04-27 21:34:58,475 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 22 [2022-04-27 21:34:58,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:58,475 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-04-27 21:34:58,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:58,475 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-04-27 21:34:58,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:34:58,475 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:58,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:58,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 21:34:58,476 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:58,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:58,476 INFO L85 PathProgramCache]: Analyzing trace with hash 563412161, now seen corresponding path program 1 times [2022-04-27 21:34:58,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:58,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18170973] [2022-04-27 21:34:58,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:58,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:58,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:58,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {6628#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {6619#true} is VALID [2022-04-27 21:34:58,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {6619#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6619#true} is VALID [2022-04-27 21:34:58,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6619#true} {6619#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6619#true} is VALID [2022-04-27 21:34:58,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {6619#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6628#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:58,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {6628#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {6619#true} is VALID [2022-04-27 21:34:58,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {6619#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6619#true} is VALID [2022-04-27 21:34:58,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6619#true} {6619#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6619#true} is VALID [2022-04-27 21:34:58,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {6619#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6619#true} is VALID [2022-04-27 21:34:58,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {6619#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {6619#true} is VALID [2022-04-27 21:34:58,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {6619#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {6619#true} is VALID [2022-04-27 21:34:58,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {6619#true} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {6619#true} is VALID [2022-04-27 21:34:58,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {6619#true} [414] L65-->L298: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_27) 1 0) v_main_~__tmp_15~0_1) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1)) InVars {main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {6619#true} is VALID [2022-04-27 21:34:58,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {6619#true} [421] L298-->L309: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~14_4 0)) (= v_main_~__tmp_16~0_1 v_main_~__VERIFIER_assert__cond~15_1) (= (ite (<= v_main_~main__t~0_28 v_main_~main__tagbuf_len~0_19) 1 0) v_main_~__tmp_16~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_28, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_1, main_~main__t~0=v_main_~main__t~0_28, main_~__tmp_16~0=v_main_~__tmp_16~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~15, main_~__tmp_16~0] {6619#true} is VALID [2022-04-27 21:34:58,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {6619#true} [429] L309-->L317: Formula: (and (= (+ v_main_~main__t~0_30 1) v_main_~main__t~0_29) (not (= v_main_~__VERIFIER_assert__cond~15_4 0)) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_30)) InVars {main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_4, main_~main__t~0=v_main_~main__t~0_30} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_4, main_~main__t~0=v_main_~main__t~0_29, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~0] {6619#true} is VALID [2022-04-27 21:34:58,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {6619#true} [434] L317-->L325: Formula: (and (not (= v_main_~main__t~0_32 v_main_~main__tagbuf_len~0_21)) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_32, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_32, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6624#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:34:58,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {6624#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [437] L325-->L332: Formula: (and (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_17~0_1) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1) (not (= v_main_~main____CPAchecker_TMP_0~1_3 0))) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {6624#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:34:58,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {6624#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [444] L332-->L343: Formula: (and (= v_main_~__tmp_18~0_1 (ite (<= v_main_~main__t~0_34 v_main_~main__tagbuf_len~0_22) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1)) InVars {main_~main__t~0=v_main_~main__t~0_34, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_22} OutVars{main_~main__t~0=v_main_~main__t~0_34, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_22, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {6625#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~17 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2022-04-27 21:34:58,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {6625#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~17 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} [456] L343-->L904: Formula: (and (= (+ v_main_~main__t~0_36 1) v_main_~main__t~0_35) (= v_main_~main____CPAchecker_TMP_2~1_1 v_~__tmp_2624_1~0_4) (not (= v_main_~__VERIFIER_assert__cond~17_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_4 v_~__tmp_2624_0~0_4) (= v_main_~main____CPAchecker_TMP_2~1_1 v_main_~main__t~0_36)) InVars {main_~main__t~0=v_main_~main__t~0_36, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main____CPAchecker_TMP_2~1=v_main_~main____CPAchecker_TMP_2~1_1, main_~main__t~0=v_main_~main__t~0_35, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_4, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_4, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~1, main_~main__t~0, ~__tmp_2624_0~0, ~__tmp_2624_1~0] {6626#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:58,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {6626#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [432] L904-->L96: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_2 v_~__tmp_2624_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_2624_0~0_2)) InVars {~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2} OutVars{~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {6626#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:58,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {6626#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [436] L96-->L132: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (not (= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12))) InVars {main_~main__t~0=v_main_~main__t~0_13, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {6626#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:58,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {6626#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [441] L132-->L136: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {6626#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:58,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {6626#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [451] L136-->L143: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main____CPAchecker_TMP_4~0_3 0)) (= v_main_~__tmp_7~0_1 (ite (<= 0 v_main_~main__t~0_14) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {6626#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:58,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {6626#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [462] L143-->L155: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0)) (= v_main_~__tmp_8~0_1 (ite (<= v_main_~main__t~0_15 v_main_~main__tagbuf_len~0_13) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4} OutVars{main_~main__t~0=v_main_~main__t~0_15, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {6627#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-27 21:34:58,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {6627#(not (= main_~__VERIFIER_assert__cond~7 0))} [470] L155-->L157: Formula: (= v_main_~__VERIFIER_assert__cond~7_3 0) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_3} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_3} AuxVars[] AssignedVars[] {6620#false} is VALID [2022-04-27 21:34:58,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {6620#false} [480] L157-->mainErr5ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6620#false} is VALID [2022-04-27 21:34:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:58,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:58,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18170973] [2022-04-27 21:34:58,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18170973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:58,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:58,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:34:58,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148310878] [2022-04-27 21:34:58,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:58,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:34:58,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:58,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:58,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:58,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:34:58,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:58,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:34:58,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:58,586 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:59,263 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2022-04-27 21:34:59,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:34:59,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:34:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2022-04-27 21:34:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2022-04-27 21:34:59,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 120 transitions. [2022-04-27 21:34:59,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:59,362 INFO L225 Difference]: With dead ends: 113 [2022-04-27 21:34:59,362 INFO L226 Difference]: Without dead ends: 111 [2022-04-27 21:34:59,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:34:59,363 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 191 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:59,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 74 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 21:34:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-27 21:34:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2022-04-27 21:34:59,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:59,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:59,383 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:59,383 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:59,385 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-04-27 21:34:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2022-04-27 21:34:59,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:59,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:59,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-27 21:34:59,386 INFO L87 Difference]: Start difference. First operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-27 21:34:59,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:59,387 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-04-27 21:34:59,388 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2022-04-27 21:34:59,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:59,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:59,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:59,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-04-27 21:34:59,390 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 22 [2022-04-27 21:34:59,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:59,390 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-04-27 21:34:59,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:59,390 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-04-27 21:34:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:34:59,390 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:59,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:59,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 21:34:59,391 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:59,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:59,391 INFO L85 PathProgramCache]: Analyzing trace with hash 564398341, now seen corresponding path program 1 times [2022-04-27 21:34:59,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:59,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390613405] [2022-04-27 21:34:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:59,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:59,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:59,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {7100#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {7091#true} is VALID [2022-04-27 21:34:59,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {7091#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7091#true} is VALID [2022-04-27 21:34:59,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7091#true} {7091#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7091#true} is VALID [2022-04-27 21:34:59,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {7091#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7100#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:34:59,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {7100#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {7091#true} is VALID [2022-04-27 21:34:59,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {7091#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7091#true} is VALID [2022-04-27 21:34:59,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7091#true} {7091#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7091#true} is VALID [2022-04-27 21:34:59,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {7091#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7091#true} is VALID [2022-04-27 21:34:59,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {7091#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {7091#true} is VALID [2022-04-27 21:34:59,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {7091#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {7091#true} is VALID [2022-04-27 21:34:59,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {7091#true} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {7091#true} is VALID [2022-04-27 21:34:59,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {7091#true} [414] L65-->L298: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_27) 1 0) v_main_~__tmp_15~0_1) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1)) InVars {main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {7091#true} is VALID [2022-04-27 21:34:59,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {7091#true} [421] L298-->L309: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~14_4 0)) (= v_main_~__tmp_16~0_1 v_main_~__VERIFIER_assert__cond~15_1) (= (ite (<= v_main_~main__t~0_28 v_main_~main__tagbuf_len~0_19) 1 0) v_main_~__tmp_16~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_28, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_1, main_~main__t~0=v_main_~main__t~0_28, main_~__tmp_16~0=v_main_~__tmp_16~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~15, main_~__tmp_16~0] {7091#true} is VALID [2022-04-27 21:34:59,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {7091#true} [429] L309-->L317: Formula: (and (= (+ v_main_~main__t~0_30 1) v_main_~main__t~0_29) (not (= v_main_~__VERIFIER_assert__cond~15_4 0)) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_30)) InVars {main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_4, main_~main__t~0=v_main_~main__t~0_30} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_4, main_~main__t~0=v_main_~main__t~0_29, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~0] {7091#true} is VALID [2022-04-27 21:34:59,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {7091#true} [434] L317-->L325: Formula: (and (not (= v_main_~main__t~0_32 v_main_~main__tagbuf_len~0_21)) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_32, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_32, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {7096#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:34:59,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {7096#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [437] L325-->L332: Formula: (and (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_17~0_1) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1) (not (= v_main_~main____CPAchecker_TMP_0~1_3 0))) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {7096#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:34:59,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {7096#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [444] L332-->L343: Formula: (and (= v_main_~__tmp_18~0_1 (ite (<= v_main_~main__t~0_34 v_main_~main__tagbuf_len~0_22) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1)) InVars {main_~main__t~0=v_main_~main__t~0_34, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_22} OutVars{main_~main__t~0=v_main_~main__t~0_34, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_22, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {7097#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~17 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2022-04-27 21:34:59,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {7097#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~17 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} [456] L343-->L904: Formula: (and (= (+ v_main_~main__t~0_36 1) v_main_~main__t~0_35) (= v_main_~main____CPAchecker_TMP_2~1_1 v_~__tmp_2624_1~0_4) (not (= v_main_~__VERIFIER_assert__cond~17_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_4 v_~__tmp_2624_0~0_4) (= v_main_~main____CPAchecker_TMP_2~1_1 v_main_~main__t~0_36)) InVars {main_~main__t~0=v_main_~main__t~0_36, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main____CPAchecker_TMP_2~1=v_main_~main____CPAchecker_TMP_2~1_1, main_~main__t~0=v_main_~main__t~0_35, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_4, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_4, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~1, main_~main__t~0, ~__tmp_2624_0~0, ~__tmp_2624_1~0] {7098#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:59,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {7098#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [432] L904-->L96: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_2 v_~__tmp_2624_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_2624_0~0_2)) InVars {~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2} OutVars{~__tmp_2624_0~0=v_~__tmp_2624_0~0_2, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_2, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {7098#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:59,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {7098#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [436] L96-->L132: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (not (= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12))) InVars {main_~main__t~0=v_main_~main__t~0_13, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {7098#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:59,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {7098#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [442] L132-->L248: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_6~0_1 |v_main_#t~nondet8_2|) (= v_main_~main____CPAchecker_TMP_3~0_4 0)) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} OutVars{main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_6~0, main_#t~nondet8] {7098#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:59,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {7098#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [453] L248-->L255: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (not (= v_main_~main____CPAchecker_TMP_6~0_3 0)) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {7098#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:34:59,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {7098#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [465] L255-->L267: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {7099#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-27 21:34:59,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {7099#(not (= main_~__VERIFIER_assert__cond~13 0))} [476] L267-->L269: Formula: (= v_main_~__VERIFIER_assert__cond~13_3 0) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_3} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_3} AuxVars[] AssignedVars[] {7092#false} is VALID [2022-04-27 21:34:59,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {7092#false} [488] L269-->mainErr11ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7092#false} is VALID [2022-04-27 21:34:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:34:59,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:59,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390613405] [2022-04-27 21:34:59,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390613405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:59,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:59,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:34:59,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984778906] [2022-04-27 21:34:59,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:59,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:34:59,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:59,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:34:59,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:59,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:34:59,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:59,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:34:59,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:59,489 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:00,016 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-04-27 21:35:00,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:35:00,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:35:00,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-27 21:35:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-27 21:35:00,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 103 transitions. [2022-04-27 21:35:00,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:00,132 INFO L225 Difference]: With dead ends: 95 [2022-04-27 21:35:00,132 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 21:35:00,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-27 21:35:00,133 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 173 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:00,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 61 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:35:00,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 21:35:00,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 21:35:00,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:00,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:00,139 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:00,140 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:00,140 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-27 21:35:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-27 21:35:00,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:00,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:00,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-27 21:35:00,141 INFO L87 Difference]: Start difference. First operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-27 21:35:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:00,142 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-27 21:35:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-27 21:35:00,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:00,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:00,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:00,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-27 21:35:00,143 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 22 [2022-04-27 21:35:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:00,144 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-27 21:35:00,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-27 21:35:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-27 21:35:00,144 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:00,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:00,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 21:35:00,145 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:35:00,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:00,145 INFO L85 PathProgramCache]: Analyzing trace with hash 729567653, now seen corresponding path program 1 times [2022-04-27 21:35:00,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:00,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891550207] [2022-04-27 21:35:00,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:00,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:00,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:00,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {7411#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {7395#true} is VALID [2022-04-27 21:35:00,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {7395#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7395#true} is VALID [2022-04-27 21:35:00,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7395#true} {7395#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7395#true} is VALID [2022-04-27 21:35:00,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {7395#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7411#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:35:00,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {7411#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {7395#true} is VALID [2022-04-27 21:35:00,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {7395#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7395#true} is VALID [2022-04-27 21:35:00,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7395#true} {7395#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7395#true} is VALID [2022-04-27 21:35:00,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {7395#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7395#true} is VALID [2022-04-27 21:35:00,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {7395#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {7395#true} is VALID [2022-04-27 21:35:00,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {7395#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {7400#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:00,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {7400#(= main_~main__t~0 0)} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {7400#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:00,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {7400#(= main_~main__t~0 0)} [414] L65-->L298: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_27) 1 0) v_main_~__tmp_15~0_1) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1)) InVars {main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {7400#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:00,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {7400#(= main_~main__t~0 0)} [421] L298-->L309: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~14_4 0)) (= v_main_~__tmp_16~0_1 v_main_~__VERIFIER_assert__cond~15_1) (= (ite (<= v_main_~main__t~0_28 v_main_~main__tagbuf_len~0_19) 1 0) v_main_~__tmp_16~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_28, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_1, main_~main__t~0=v_main_~main__t~0_28, main_~__tmp_16~0=v_main_~__tmp_16~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~15, main_~__tmp_16~0] {7400#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:00,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {7400#(= main_~main__t~0 0)} [429] L309-->L317: Formula: (and (= (+ v_main_~main__t~0_30 1) v_main_~main__t~0_29) (not (= v_main_~__VERIFIER_assert__cond~15_4 0)) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_30)) InVars {main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_4, main_~main__t~0=v_main_~main__t~0_30} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_4, main_~main__t~0=v_main_~main__t~0_29, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~0] {7401#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:00,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {7401#(<= 1 main_~main__t~0)} [434] L317-->L325: Formula: (and (not (= v_main_~main__t~0_32 v_main_~main__tagbuf_len~0_21)) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_32, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_32, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {7401#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:00,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {7401#(<= 1 main_~main__t~0)} [438] L325-->L366: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_5 0) (= v_main_~__tmp_19~0_1 v_main_~__VERIFIER_assert__cond~18_1) (= (ite (<= 0 v_main_~main__t~0_37) 1 0) v_main_~__tmp_19~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_37, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5} OutVars{main_~main__t~0=v_main_~main__t~0_37, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__tmp_19~0=v_main_~__tmp_19~0_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_1} AuxVars[] AssignedVars[main_~__tmp_19~0, main_~__VERIFIER_assert__cond~18] {7401#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:00,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {7401#(<= 1 main_~main__t~0)} [446] L366-->L377: Formula: (and (= v_main_~__tmp_20~0_1 v_main_~__VERIFIER_assert__cond~19_1) (not (= v_main_~__VERIFIER_assert__cond~18_4 0)) (= (ite (<= v_main_~main__t~0_38 v_main_~main__tagbuf_len~0_23) 1 0) v_main_~__tmp_20~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_38, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} OutVars{main_~main__t~0=v_main_~main__t~0_38, main_~__tmp_20~0=v_main_~__tmp_20~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} AuxVars[] AssignedVars[main_~__tmp_20~0, main_~__VERIFIER_assert__cond~19] {7401#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:00,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {7401#(<= 1 main_~main__t~0)} [458] L377-->L385: Formula: (and (= (+ v_main_~main__t~0_40 1) v_main_~main__t~0_39) (= v_main_~main____CPAchecker_TMP_1~1_1 v_main_~main__t~0_40) (not (= v_main_~__VERIFIER_assert__cond~19_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_40, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4} OutVars{main_~main__t~0=v_main_~main__t~0_39, main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_1, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~1] {7402#(<= 2 main_~main__t~0)} is VALID [2022-04-27 21:35:00,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {7402#(<= 2 main_~main__t~0)} [467] L385-->L393: Formula: (and (not (= v_main_~main__t~0_42 v_main_~main__tagbuf_len~0_25)) (= v_main_~main____CPAchecker_TMP_0~2_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~main__t~0=v_main_~main__t~0_42, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_25, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~main__t~0=v_main_~main__t~0_42, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_25, main_~main____CPAchecker_TMP_0~2=v_main_~main____CPAchecker_TMP_0~2_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~2, main_#t~nondet10] {7402#(<= 2 main_~main__t~0)} is VALID [2022-04-27 21:35:00,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {7402#(<= 2 main_~main__t~0)} [479] L393-->L434: Formula: (and (= v_main_~__tmp_23~0_1 (ite (<= 0 v_main_~main__t~0_47) 1 0)) (= v_main_~main____CPAchecker_TMP_0~2_5 0) (= v_main_~__tmp_23~0_1 v_main_~__VERIFIER_assert__cond~22_1)) InVars {main_~main__t~0=v_main_~main__t~0_47, main_~main____CPAchecker_TMP_0~2=v_main_~main____CPAchecker_TMP_0~2_5} OutVars{main_~main__t~0=v_main_~main__t~0_47, main_~__tmp_23~0=v_main_~__tmp_23~0_1, main_~__VERIFIER_assert__cond~22=v_main_~__VERIFIER_assert__cond~22_1, main_~main____CPAchecker_TMP_0~2=v_main_~main____CPAchecker_TMP_0~2_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~22, main_~__tmp_23~0] {7402#(<= 2 main_~main__t~0)} is VALID [2022-04-27 21:35:00,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {7402#(<= 2 main_~main__t~0)} [493] L434-->L445: Formula: (and (= (ite (<= v_main_~main__t~0_48 v_main_~main__tagbuf_len~0_27) 1 0) v_main_~__tmp_24~0_1) (= v_main_~__tmp_24~0_1 v_main_~__VERIFIER_assert__cond~23_1) (not (= v_main_~__VERIFIER_assert__cond~22_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_48, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_27, main_~__VERIFIER_assert__cond~22=v_main_~__VERIFIER_assert__cond~22_4} OutVars{main_~main__t~0=v_main_~main__t~0_48, main_~__VERIFIER_assert__cond~23=v_main_~__VERIFIER_assert__cond~23_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_27, main_~__VERIFIER_assert__cond~22=v_main_~__VERIFIER_assert__cond~22_4, main_~__tmp_24~0=v_main_~__tmp_24~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~23, main_~__tmp_24~0] {7402#(<= 2 main_~main__t~0)} is VALID [2022-04-27 21:35:00,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {7402#(<= 2 main_~main__t~0)} [501] L445-->L453: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~23_4 0)) (= v_main_~main____CPAchecker_TMP_1~2_1 v_main_~main__t~0_50) (= (+ v_main_~main__t~0_50 1) v_main_~main__t~0_49)) InVars {main_~__VERIFIER_assert__cond~23=v_main_~__VERIFIER_assert__cond~23_4, main_~main__t~0=v_main_~main__t~0_50} OutVars{main_~main__t~0=v_main_~main__t~0_49, main_~main____CPAchecker_TMP_1~2=v_main_~main____CPAchecker_TMP_1~2_1, main_~__VERIFIER_assert__cond~23=v_main_~__VERIFIER_assert__cond~23_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~2] {7403#(<= 3 main_~main__t~0)} is VALID [2022-04-27 21:35:00,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {7403#(<= 3 main_~main__t~0)} [507] L453-->L461: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~3_1 |v_main_#t~nondet11_2|) (not (= v_main_~main__t~0_52 v_main_~main__tagbuf_len~0_29)) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_~main__t~0=v_main_~main__t~0_52, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_29, main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~main__t~0=v_main_~main__t~0_52, main_~main____CPAchecker_TMP_0~3=v_main_~main____CPAchecker_TMP_0~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_29} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~3, main_#t~nondet11] {7403#(<= 3 main_~main__t~0)} is VALID [2022-04-27 21:35:00,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {7403#(<= 3 main_~main__t~0)} [511] L461-->L502: Formula: (and (= v_main_~main____CPAchecker_TMP_0~3_5 0) (= v_main_~__tmp_27~0_1 v_main_~__VERIFIER_assert__cond~26_1) (= v_main_~__tmp_27~0_1 (ite (<= 0 v_main_~main__t~0_57) 1 0))) InVars {main_~main____CPAchecker_TMP_0~3=v_main_~main____CPAchecker_TMP_0~3_5, main_~main__t~0=v_main_~main__t~0_57} OutVars{main_~main__t~0=v_main_~main__t~0_57, main_~__VERIFIER_assert__cond~26=v_main_~__VERIFIER_assert__cond~26_1, main_~main____CPAchecker_TMP_0~3=v_main_~main____CPAchecker_TMP_0~3_5, main_~__tmp_27~0=v_main_~__tmp_27~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~26, main_~__tmp_27~0] {7403#(<= 3 main_~main__t~0)} is VALID [2022-04-27 21:35:00,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {7403#(<= 3 main_~main__t~0)} [515] L502-->L513: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~26_4 0)) (= (ite (<= v_main_~main__t~0_58 v_main_~main__tagbuf_len~0_31) 1 0) v_main_~__tmp_28~0_1) (= v_main_~__tmp_28~0_1 v_main_~__VERIFIER_assert__cond~27_1)) InVars {main_~main__t~0=v_main_~main__t~0_58, main_~__VERIFIER_assert__cond~26=v_main_~__VERIFIER_assert__cond~26_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_31} OutVars{main_~__VERIFIER_assert__cond~27=v_main_~__VERIFIER_assert__cond~27_1, main_~main__t~0=v_main_~main__t~0_58, main_~__VERIFIER_assert__cond~26=v_main_~__VERIFIER_assert__cond~26_4, main_~__tmp_28~0=v_main_~__tmp_28~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_31} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~27, main_~__tmp_28~0] {7403#(<= 3 main_~main__t~0)} is VALID [2022-04-27 21:35:00,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {7403#(<= 3 main_~main__t~0)} [519] L513-->L521: Formula: (and (= v_main_~main____CPAchecker_TMP_1~3_1 v_main_~main__t~0_60) (= (+ v_main_~main__t~0_60 1) v_main_~main__t~0_59) (not (= v_main_~__VERIFIER_assert__cond~27_4 0))) InVars {main_~__VERIFIER_assert__cond~27=v_main_~__VERIFIER_assert__cond~27_4, main_~main__t~0=v_main_~main__t~0_60} OutVars{main_~__VERIFIER_assert__cond~27=v_main_~__VERIFIER_assert__cond~27_4, main_~main__t~0=v_main_~main__t~0_59, main_~main____CPAchecker_TMP_1~3=v_main_~main____CPAchecker_TMP_1~3_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~3] {7404#(<= 4 main_~main__t~0)} is VALID [2022-04-27 21:35:00,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {7404#(<= 4 main_~main__t~0)} [521] L521-->L529: Formula: (and (= v_main_~main____CPAchecker_TMP_0~4_1 |v_main_#t~nondet12_2|) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647) (not (= v_main_~main__t~0_62 v_main_~main__tagbuf_len~0_33))) InVars {main_~main__t~0=v_main_~main__t~0_62, main_#t~nondet12=|v_main_#t~nondet12_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_33} OutVars{main_~main__t~0=v_main_~main__t~0_62, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_33, main_~main____CPAchecker_TMP_0~4=v_main_~main____CPAchecker_TMP_0~4_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~4, main_#t~nondet12] {7404#(<= 4 main_~main__t~0)} is VALID [2022-04-27 21:35:00,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {7404#(<= 4 main_~main__t~0)} [523] L529-->L570: Formula: (and (= (ite (<= 0 v_main_~main__t~0_67) 1 0) v_main_~__tmp_31~0_1) (= v_main_~__tmp_31~0_1 v_main_~__VERIFIER_assert__cond~30_1) (= v_main_~main____CPAchecker_TMP_0~4_5 0)) InVars {main_~main__t~0=v_main_~main__t~0_67, main_~main____CPAchecker_TMP_0~4=v_main_~main____CPAchecker_TMP_0~4_5} OutVars{main_~__VERIFIER_assert__cond~30=v_main_~__VERIFIER_assert__cond~30_1, main_~main__t~0=v_main_~main__t~0_67, main_~__tmp_31~0=v_main_~__tmp_31~0_1, main_~main____CPAchecker_TMP_0~4=v_main_~main____CPAchecker_TMP_0~4_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~30, main_~__tmp_31~0] {7404#(<= 4 main_~main__t~0)} is VALID [2022-04-27 21:35:00,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {7404#(<= 4 main_~main__t~0)} [527] L570-->L581: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~30_4 0)) (= v_main_~__tmp_32~0_1 v_main_~__VERIFIER_assert__cond~31_1) (= v_main_~__tmp_32~0_1 (ite (<= v_main_~main__t~0_68 v_main_~main__tagbuf_len~0_35) 1 0))) InVars {main_~__VERIFIER_assert__cond~30=v_main_~__VERIFIER_assert__cond~30_4, main_~main__t~0=v_main_~main__t~0_68, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_35} OutVars{main_~__VERIFIER_assert__cond~30=v_main_~__VERIFIER_assert__cond~30_4, main_~__tmp_32~0=v_main_~__tmp_32~0_1, main_~main__t~0=v_main_~main__t~0_68, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_35, main_~__VERIFIER_assert__cond~31=v_main_~__VERIFIER_assert__cond~31_1} AuxVars[] AssignedVars[main_~__tmp_32~0, main_~__VERIFIER_assert__cond~31] {7404#(<= 4 main_~main__t~0)} is VALID [2022-04-27 21:35:00,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {7404#(<= 4 main_~main__t~0)} [531] L581-->L589: Formula: (and (= v_main_~main____CPAchecker_TMP_1~4_1 v_main_~main__t~0_70) (not (= v_main_~__VERIFIER_assert__cond~31_4 0)) (= (+ v_main_~main__t~0_70 1) v_main_~main__t~0_69)) InVars {main_~main__t~0=v_main_~main__t~0_70, main_~__VERIFIER_assert__cond~31=v_main_~__VERIFIER_assert__cond~31_4} OutVars{main_~main____CPAchecker_TMP_1~4=v_main_~main____CPAchecker_TMP_1~4_1, main_~main__t~0=v_main_~main__t~0_69, main_~__VERIFIER_assert__cond~31=v_main_~__VERIFIER_assert__cond~31_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~4, main_~main__t~0] {7405#(<= 5 main_~main__t~0)} is VALID [2022-04-27 21:35:00,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {7405#(<= 5 main_~main__t~0)} [533] L589-->L597: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~5_1 |v_main_#t~nondet13_2|) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (not (= v_main_~main__t~0_72 v_main_~main__tagbuf_len~0_37))) InVars {main_~main__t~0=v_main_~main__t~0_72, main_#t~nondet13=|v_main_#t~nondet13_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_37} OutVars{main_~main__t~0=v_main_~main__t~0_72, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_37, main_~main____CPAchecker_TMP_0~5=v_main_~main____CPAchecker_TMP_0~5_1} AuxVars[] AssignedVars[main_#t~nondet13, main_~main____CPAchecker_TMP_0~5] {7405#(<= 5 main_~main__t~0)} is VALID [2022-04-27 21:35:00,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {7405#(<= 5 main_~main__t~0)} [535] L597-->L638: Formula: (and (= v_main_~__tmp_35~0_1 v_main_~__VERIFIER_assert__cond~34_1) (= v_main_~main____CPAchecker_TMP_0~5_5 0) (= v_main_~__tmp_35~0_1 (ite (<= 0 v_main_~main__t~0_77) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_77, main_~main____CPAchecker_TMP_0~5=v_main_~main____CPAchecker_TMP_0~5_5} OutVars{main_~main__t~0=v_main_~main__t~0_77, main_~__tmp_35~0=v_main_~__tmp_35~0_1, main_~__VERIFIER_assert__cond~34=v_main_~__VERIFIER_assert__cond~34_1, main_~main____CPAchecker_TMP_0~5=v_main_~main____CPAchecker_TMP_0~5_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~34, main_~__tmp_35~0] {7405#(<= 5 main_~main__t~0)} is VALID [2022-04-27 21:35:00,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {7405#(<= 5 main_~main__t~0)} [539] L638-->L649: Formula: (and (= v_main_~__tmp_36~0_1 v_main_~__VERIFIER_assert__cond~35_1) (not (= v_main_~__VERIFIER_assert__cond~34_4 0)) (= (ite (<= v_main_~main__t~0_78 v_main_~main__tagbuf_len~0_39) 1 0) v_main_~__tmp_36~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_78, main_~__VERIFIER_assert__cond~34=v_main_~__VERIFIER_assert__cond~34_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_39} OutVars{main_~main__t~0=v_main_~main__t~0_78, main_~__tmp_36~0=v_main_~__tmp_36~0_1, main_~__VERIFIER_assert__cond~35=v_main_~__VERIFIER_assert__cond~35_1, main_~__VERIFIER_assert__cond~34=v_main_~__VERIFIER_assert__cond~34_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_39} AuxVars[] AssignedVars[main_~__tmp_36~0, main_~__VERIFIER_assert__cond~35] {7405#(<= 5 main_~main__t~0)} is VALID [2022-04-27 21:35:00,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {7405#(<= 5 main_~main__t~0)} [543] L649-->L657: Formula: (and (= v_main_~main____CPAchecker_TMP_1~5_1 v_main_~main__t~0_80) (= (+ v_main_~main__t~0_80 1) v_main_~main__t~0_79) (not (= v_main_~__VERIFIER_assert__cond~35_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_80, main_~__VERIFIER_assert__cond~35=v_main_~__VERIFIER_assert__cond~35_4} OutVars{main_~main__t~0=v_main_~main__t~0_79, main_~__VERIFIER_assert__cond~35=v_main_~__VERIFIER_assert__cond~35_4, main_~main____CPAchecker_TMP_1~5=v_main_~main____CPAchecker_TMP_1~5_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~5] {7406#(<= 6 main_~main__t~0)} is VALID [2022-04-27 21:35:00,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {7406#(<= 6 main_~main__t~0)} [545] L657-->L665: Formula: (and (<= |v_main_#t~nondet14_2| 2147483647) (not (= v_main_~main__t~0_82 v_main_~main__tagbuf_len~0_41)) (= v_main_~main____CPAchecker_TMP_0~6_1 |v_main_#t~nondet14_2|) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_82, main_#t~nondet14=|v_main_#t~nondet14_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_41} OutVars{main_~main____CPAchecker_TMP_0~6=v_main_~main____CPAchecker_TMP_0~6_1, main_~main__t~0=v_main_~main__t~0_82, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_41} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~6, main_#t~nondet14] {7406#(<= 6 main_~main__t~0)} is VALID [2022-04-27 21:35:00,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {7406#(<= 6 main_~main__t~0)} [547] L665-->L706: Formula: (and (= v_main_~__tmp_39~0_1 v_main_~__VERIFIER_assert__cond~38_1) (= v_main_~main____CPAchecker_TMP_0~6_5 0) (= (ite (<= 0 v_main_~main__t~0_87) 1 0) v_main_~__tmp_39~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_87, main_~main____CPAchecker_TMP_0~6=v_main_~main____CPAchecker_TMP_0~6_5} OutVars{main_~__VERIFIER_assert__cond~38=v_main_~__VERIFIER_assert__cond~38_1, main_~main__t~0=v_main_~main__t~0_87, main_~main____CPAchecker_TMP_0~6=v_main_~main____CPAchecker_TMP_0~6_5, main_~__tmp_39~0=v_main_~__tmp_39~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~38, main_~__tmp_39~0] {7406#(<= 6 main_~main__t~0)} is VALID [2022-04-27 21:35:00,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {7406#(<= 6 main_~main__t~0)} [551] L706-->L717: Formula: (and (= v_main_~__tmp_40~0_1 v_main_~__VERIFIER_assert__cond~39_1) (not (= v_main_~__VERIFIER_assert__cond~38_4 0)) (= (ite (<= v_main_~main__t~0_88 v_main_~main__tagbuf_len~0_43) 1 0) v_main_~__tmp_40~0_1)) InVars {main_~__VERIFIER_assert__cond~38=v_main_~__VERIFIER_assert__cond~38_4, main_~main__t~0=v_main_~main__t~0_88, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_43} OutVars{main_~__VERIFIER_assert__cond~38=v_main_~__VERIFIER_assert__cond~38_4, main_~main__t~0=v_main_~main__t~0_88, main_~__tmp_40~0=v_main_~__tmp_40~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_43, main_~__VERIFIER_assert__cond~39=v_main_~__VERIFIER_assert__cond~39_1} AuxVars[] AssignedVars[main_~__tmp_40~0, main_~__VERIFIER_assert__cond~39] {7406#(<= 6 main_~main__t~0)} is VALID [2022-04-27 21:35:00,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {7406#(<= 6 main_~main__t~0)} [555] L717-->L725: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~39_4 0)) (= v_main_~main__t~0_89 (+ v_main_~main__t~0_90 1)) (= v_main_~main____CPAchecker_TMP_1~6_1 v_main_~main__t~0_90)) InVars {main_~main__t~0=v_main_~main__t~0_90, main_~__VERIFIER_assert__cond~39=v_main_~__VERIFIER_assert__cond~39_4} OutVars{main_~main__t~0=v_main_~main__t~0_89, main_~main____CPAchecker_TMP_1~6=v_main_~main____CPAchecker_TMP_1~6_1, main_~__VERIFIER_assert__cond~39=v_main_~__VERIFIER_assert__cond~39_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~6] {7407#(<= 7 main_~main__t~0)} is VALID [2022-04-27 21:35:00,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {7407#(<= 7 main_~main__t~0)} [557] L725-->L733: Formula: (and (= v_main_~main____CPAchecker_TMP_0~7_1 |v_main_#t~nondet15_2|) (not (= v_main_~main__t~0_92 v_main_~main__tagbuf_len~0_45)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|, main_~main__t~0=v_main_~main__t~0_92, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_45} OutVars{main_~main____CPAchecker_TMP_0~7=v_main_~main____CPAchecker_TMP_0~7_1, main_~main__t~0=v_main_~main__t~0_92, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_45} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~7, main_#t~nondet15] {7407#(<= 7 main_~main__t~0)} is VALID [2022-04-27 21:35:00,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {7407#(<= 7 main_~main__t~0)} [559] L733-->L774: Formula: (and (= v_main_~main____CPAchecker_TMP_0~7_5 0) (= v_main_~__tmp_43~0_1 v_main_~__VERIFIER_assert__cond~42_1) (= (ite (<= 0 v_main_~main__t~0_97) 1 0) v_main_~__tmp_43~0_1)) InVars {main_~main____CPAchecker_TMP_0~7=v_main_~main____CPAchecker_TMP_0~7_5, main_~main__t~0=v_main_~main__t~0_97} OutVars{main_~__VERIFIER_assert__cond~42=v_main_~__VERIFIER_assert__cond~42_1, main_~main____CPAchecker_TMP_0~7=v_main_~main____CPAchecker_TMP_0~7_5, main_~main__t~0=v_main_~main__t~0_97, main_~__tmp_43~0=v_main_~__tmp_43~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~42, main_~__tmp_43~0] {7407#(<= 7 main_~main__t~0)} is VALID [2022-04-27 21:35:00,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {7407#(<= 7 main_~main__t~0)} [563] L774-->L785: Formula: (and (= v_main_~__tmp_44~0_1 v_main_~__VERIFIER_assert__cond~43_1) (not (= v_main_~__VERIFIER_assert__cond~42_4 0)) (= (ite (<= v_main_~main__t~0_98 v_main_~main__tagbuf_len~0_47) 1 0) v_main_~__tmp_44~0_1)) InVars {main_~__VERIFIER_assert__cond~42=v_main_~__VERIFIER_assert__cond~42_4, main_~main__t~0=v_main_~main__t~0_98, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_47} OutVars{main_~__VERIFIER_assert__cond~42=v_main_~__VERIFIER_assert__cond~42_4, main_~__VERIFIER_assert__cond~43=v_main_~__VERIFIER_assert__cond~43_1, main_~main__t~0=v_main_~main__t~0_98, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_47, main_~__tmp_44~0=v_main_~__tmp_44~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~43, main_~__tmp_44~0] {7407#(<= 7 main_~main__t~0)} is VALID [2022-04-27 21:35:00,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {7407#(<= 7 main_~main__t~0)} [567] L785-->L793: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~43_4 0)) (= v_main_~main____CPAchecker_TMP_1~7_1 v_main_~main__t~0_100) (= (+ v_main_~main__t~0_100 1) v_main_~main__t~0_99)) InVars {main_~main__t~0=v_main_~main__t~0_100, main_~__VERIFIER_assert__cond~43=v_main_~__VERIFIER_assert__cond~43_4} OutVars{main_~main__t~0=v_main_~main__t~0_99, main_~__VERIFIER_assert__cond~43=v_main_~__VERIFIER_assert__cond~43_4, main_~main____CPAchecker_TMP_1~7=v_main_~main____CPAchecker_TMP_1~7_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~7] {7408#(<= 8 main_~main__t~0)} is VALID [2022-04-27 21:35:00,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {7408#(<= 8 main_~main__t~0)} [569] L793-->L801: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~8_1 |v_main_#t~nondet16_2|) (<= |v_main_#t~nondet16_2| 2147483647) (not (= v_main_~main__t~0_102 v_main_~main__tagbuf_len~0_49))) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|, main_~main__t~0=v_main_~main__t~0_102, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_49} OutVars{main_~main__t~0=v_main_~main__t~0_102, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_49} AuxVars[] AssignedVars[main_#t~nondet16, main_~main____CPAchecker_TMP_0~8] {7408#(<= 8 main_~main__t~0)} is VALID [2022-04-27 21:35:00,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {7408#(<= 8 main_~main__t~0)} [571] L801-->L842: Formula: (and (= v_main_~__tmp_47~0_1 v_main_~__VERIFIER_assert__cond~46_1) (= v_main_~main____CPAchecker_TMP_0~8_5 0) (= v_main_~__tmp_47~0_1 (ite (<= 0 v_main_~main__t~0_107) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_107, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_5} OutVars{main_~main__t~0=v_main_~main__t~0_107, main_~__tmp_47~0=v_main_~__tmp_47~0_1, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_5, main_~__VERIFIER_assert__cond~46=v_main_~__VERIFIER_assert__cond~46_1} AuxVars[] AssignedVars[main_~__tmp_47~0, main_~__VERIFIER_assert__cond~46] {7408#(<= 8 main_~main__t~0)} is VALID [2022-04-27 21:35:00,339 INFO L290 TraceCheckUtils]: 41: Hoare triple {7408#(<= 8 main_~main__t~0)} [575] L842-->L853: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~46_4 0)) (= v_main_~__tmp_48~0_1 v_main_~__VERIFIER_assert__cond~47_1) (= (ite (<= v_main_~main__t~0_108 v_main_~main__tagbuf_len~0_51) 1 0) v_main_~__tmp_48~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_108, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_51, main_~__VERIFIER_assert__cond~46=v_main_~__VERIFIER_assert__cond~46_4} OutVars{main_~main__t~0=v_main_~main__t~0_108, main_~__tmp_48~0=v_main_~__tmp_48~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_51, main_~__VERIFIER_assert__cond~46=v_main_~__VERIFIER_assert__cond~46_4, main_~__VERIFIER_assert__cond~47=v_main_~__VERIFIER_assert__cond~47_1} AuxVars[] AssignedVars[main_~__tmp_48~0, main_~__VERIFIER_assert__cond~47] {7408#(<= 8 main_~main__t~0)} is VALID [2022-04-27 21:35:00,340 INFO L290 TraceCheckUtils]: 42: Hoare triple {7408#(<= 8 main_~main__t~0)} [579] L853-->L940: Formula: (and (= v_main_~main____CPAchecker_TMP_0~8_6 v_~__tmp_3137_1~0_1) (= v_main_~main____CPAchecker_TMP_1~8_1 v_main_~main__t~0_110) (not (= v_main_~__VERIFIER_assert__cond~47_4 0)) (= v_main_~main____CPAchecker_TMP_1~8_1 v_~__tmp_3137_0~0_1) (= (+ v_main_~main__t~0_110 1) v_main_~main__t~0_109)) InVars {main_~main__t~0=v_main_~main__t~0_110, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_6, main_~__VERIFIER_assert__cond~47=v_main_~__VERIFIER_assert__cond~47_4} OutVars{main_~main__t~0=v_main_~main__t~0_109, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_6, main_~main____CPAchecker_TMP_1~8=v_main_~main____CPAchecker_TMP_1~8_1, ~__tmp_3137_1~0=v_~__tmp_3137_1~0_1, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_1, main_~__VERIFIER_assert__cond~47=v_main_~__VERIFIER_assert__cond~47_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~8, ~__tmp_3137_1~0, ~__tmp_3137_0~0] {7409#(<= 9 main_~main__t~0)} is VALID [2022-04-27 21:35:00,340 INFO L290 TraceCheckUtils]: 43: Hoare triple {7409#(<= 9 main_~main__t~0)} [580] L940-->L866: Formula: (and (= v_main_~main____CPAchecker_TMP_0~8_7 v_~__tmp_3137_1~0_2) (= v_main_~main____CPAchecker_TMP_1~8_2 v_~__tmp_3137_0~0_2)) InVars {~__tmp_3137_1~0=v_~__tmp_3137_1~0_2, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_2} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_2, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_7, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_2, main_~main____CPAchecker_TMP_1~8=v_main_~main____CPAchecker_TMP_1~8_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~8, main_~main____CPAchecker_TMP_1~8] {7409#(<= 9 main_~main__t~0)} is VALID [2022-04-27 21:35:00,340 INFO L290 TraceCheckUtils]: 44: Hoare triple {7409#(<= 9 main_~main__t~0)} [582] L866-->L874: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (not (= v_main_~main__t~0_112 v_main_~main__tagbuf_len~0_53)) (= v_main_~main____CPAchecker_TMP_0~9_1 |v_main_#t~nondet17_2|) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_112, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_53, main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~main__t~0=v_main_~main__t~0_112, main_~main____CPAchecker_TMP_0~9=v_main_~main____CPAchecker_TMP_0~9_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_53} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~9, main_#t~nondet17] {7409#(<= 9 main_~main__t~0)} is VALID [2022-04-27 21:35:00,341 INFO L290 TraceCheckUtils]: 45: Hoare triple {7409#(<= 9 main_~main__t~0)} [583] L874-->L881: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~9_3 0)) (= v_main_~__tmp_49~0_1 (ite (<= 0 v_main_~main__t~0_113) 1 0)) (= v_main_~__tmp_49~0_1 v_main_~__VERIFIER_assert__cond~48_1)) InVars {main_~main__t~0=v_main_~main__t~0_113, main_~main____CPAchecker_TMP_0~9=v_main_~main____CPAchecker_TMP_0~9_3} OutVars{main_~main__t~0=v_main_~main__t~0_113, main_~main____CPAchecker_TMP_0~9=v_main_~main____CPAchecker_TMP_0~9_3, main_~__tmp_49~0=v_main_~__tmp_49~0_1, main_~__VERIFIER_assert__cond~48=v_main_~__VERIFIER_assert__cond~48_1} AuxVars[] AssignedVars[main_~__tmp_49~0, main_~__VERIFIER_assert__cond~48] {7410#(not (= main_~__VERIFIER_assert__cond~48 0))} is VALID [2022-04-27 21:35:00,341 INFO L290 TraceCheckUtils]: 46: Hoare triple {7410#(not (= main_~__VERIFIER_assert__cond~48 0))} [585] L881-->L883: Formula: (= v_main_~__VERIFIER_assert__cond~48_3 0) InVars {main_~__VERIFIER_assert__cond~48=v_main_~__VERIFIER_assert__cond~48_3} OutVars{main_~__VERIFIER_assert__cond~48=v_main_~__VERIFIER_assert__cond~48_3} AuxVars[] AssignedVars[] {7396#false} is VALID [2022-04-27 21:35:00,341 INFO L290 TraceCheckUtils]: 47: Hoare triple {7396#false} [589] L883-->mainErr12ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7396#false} is VALID [2022-04-27 21:35:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:35:00,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:00,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891550207] [2022-04-27 21:35:00,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891550207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:00,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:00,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-27 21:35:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720829855] [2022-04-27 21:35:00,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:00,344 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-27 21:35:00,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:00,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:00,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:00,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 21:35:00,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:00,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 21:35:00,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-04-27 21:35:00,386 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:00,936 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-27 21:35:00,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 21:35:00,937 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-27 21:35:00,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-04-27 21:35:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-04-27 21:35:00,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 58 transitions. [2022-04-27 21:35:00,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:00,990 INFO L225 Difference]: With dead ends: 58 [2022-04-27 21:35:00,990 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 21:35:00,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-04-27 21:35:00,991 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 117 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:00,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 48 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:35:00,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 21:35:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 21:35:00,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:00,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:00,997 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:00,997 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:00,998 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-27 21:35:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-27 21:35:00,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:00,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:00,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-27 21:35:00,999 INFO L87 Difference]: Start difference. First operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-27 21:35:01,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:01,000 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-27 21:35:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-27 21:35:01,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:01,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:01,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:01,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-27 21:35:01,001 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2022-04-27 21:35:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:01,002 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-27 21:35:01,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-27 21:35:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-27 21:35:01,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:01,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:01,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 21:35:01,003 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:35:01,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:01,003 INFO L85 PathProgramCache]: Analyzing trace with hash 729568680, now seen corresponding path program 1 times [2022-04-27 21:35:01,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:01,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259082090] [2022-04-27 21:35:01,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:01,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:01,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {7686#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {7670#true} is VALID [2022-04-27 21:35:01,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {7670#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7670#true} is VALID [2022-04-27 21:35:01,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7670#true} {7670#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7670#true} is VALID [2022-04-27 21:35:01,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {7670#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7686#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:35:01,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {7686#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {7670#true} is VALID [2022-04-27 21:35:01,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {7670#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7670#true} is VALID [2022-04-27 21:35:01,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7670#true} {7670#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7670#true} is VALID [2022-04-27 21:35:01,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {7670#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7670#true} is VALID [2022-04-27 21:35:01,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {7670#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {7670#true} is VALID [2022-04-27 21:35:01,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {7670#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {7675#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:01,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {7675#(= main_~main__t~0 0)} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {7675#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:01,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {7675#(= main_~main__t~0 0)} [414] L65-->L298: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_27) 1 0) v_main_~__tmp_15~0_1) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1)) InVars {main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {7675#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:01,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {7675#(= main_~main__t~0 0)} [421] L298-->L309: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~14_4 0)) (= v_main_~__tmp_16~0_1 v_main_~__VERIFIER_assert__cond~15_1) (= (ite (<= v_main_~main__t~0_28 v_main_~main__tagbuf_len~0_19) 1 0) v_main_~__tmp_16~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_28, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_1, main_~main__t~0=v_main_~main__t~0_28, main_~__tmp_16~0=v_main_~__tmp_16~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~15, main_~__tmp_16~0] {7675#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:01,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {7675#(= main_~main__t~0 0)} [429] L309-->L317: Formula: (and (= (+ v_main_~main__t~0_30 1) v_main_~main__t~0_29) (not (= v_main_~__VERIFIER_assert__cond~15_4 0)) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_30)) InVars {main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_4, main_~main__t~0=v_main_~main__t~0_30} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_4, main_~main__t~0=v_main_~main__t~0_29, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~0] {7676#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:01,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {7676#(<= 1 main_~main__t~0)} [434] L317-->L325: Formula: (and (not (= v_main_~main__t~0_32 v_main_~main__tagbuf_len~0_21)) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_32, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_32, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {7676#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:01,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {7676#(<= 1 main_~main__t~0)} [438] L325-->L366: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_5 0) (= v_main_~__tmp_19~0_1 v_main_~__VERIFIER_assert__cond~18_1) (= (ite (<= 0 v_main_~main__t~0_37) 1 0) v_main_~__tmp_19~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_37, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5} OutVars{main_~main__t~0=v_main_~main__t~0_37, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__tmp_19~0=v_main_~__tmp_19~0_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_1} AuxVars[] AssignedVars[main_~__tmp_19~0, main_~__VERIFIER_assert__cond~18] {7676#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:01,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {7676#(<= 1 main_~main__t~0)} [446] L366-->L377: Formula: (and (= v_main_~__tmp_20~0_1 v_main_~__VERIFIER_assert__cond~19_1) (not (= v_main_~__VERIFIER_assert__cond~18_4 0)) (= (ite (<= v_main_~main__t~0_38 v_main_~main__tagbuf_len~0_23) 1 0) v_main_~__tmp_20~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_38, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} OutVars{main_~main__t~0=v_main_~main__t~0_38, main_~__tmp_20~0=v_main_~__tmp_20~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} AuxVars[] AssignedVars[main_~__tmp_20~0, main_~__VERIFIER_assert__cond~19] {7676#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:01,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {7676#(<= 1 main_~main__t~0)} [458] L377-->L385: Formula: (and (= (+ v_main_~main__t~0_40 1) v_main_~main__t~0_39) (= v_main_~main____CPAchecker_TMP_1~1_1 v_main_~main__t~0_40) (not (= v_main_~__VERIFIER_assert__cond~19_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_40, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4} OutVars{main_~main__t~0=v_main_~main__t~0_39, main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_1, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~1] {7677#(<= 2 main_~main__t~0)} is VALID [2022-04-27 21:35:01,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {7677#(<= 2 main_~main__t~0)} [467] L385-->L393: Formula: (and (not (= v_main_~main__t~0_42 v_main_~main__tagbuf_len~0_25)) (= v_main_~main____CPAchecker_TMP_0~2_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~main__t~0=v_main_~main__t~0_42, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_25, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~main__t~0=v_main_~main__t~0_42, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_25, main_~main____CPAchecker_TMP_0~2=v_main_~main____CPAchecker_TMP_0~2_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~2, main_#t~nondet10] {7677#(<= 2 main_~main__t~0)} is VALID [2022-04-27 21:35:01,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {7677#(<= 2 main_~main__t~0)} [479] L393-->L434: Formula: (and (= v_main_~__tmp_23~0_1 (ite (<= 0 v_main_~main__t~0_47) 1 0)) (= v_main_~main____CPAchecker_TMP_0~2_5 0) (= v_main_~__tmp_23~0_1 v_main_~__VERIFIER_assert__cond~22_1)) InVars {main_~main__t~0=v_main_~main__t~0_47, main_~main____CPAchecker_TMP_0~2=v_main_~main____CPAchecker_TMP_0~2_5} OutVars{main_~main__t~0=v_main_~main__t~0_47, main_~__tmp_23~0=v_main_~__tmp_23~0_1, main_~__VERIFIER_assert__cond~22=v_main_~__VERIFIER_assert__cond~22_1, main_~main____CPAchecker_TMP_0~2=v_main_~main____CPAchecker_TMP_0~2_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~22, main_~__tmp_23~0] {7677#(<= 2 main_~main__t~0)} is VALID [2022-04-27 21:35:01,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {7677#(<= 2 main_~main__t~0)} [493] L434-->L445: Formula: (and (= (ite (<= v_main_~main__t~0_48 v_main_~main__tagbuf_len~0_27) 1 0) v_main_~__tmp_24~0_1) (= v_main_~__tmp_24~0_1 v_main_~__VERIFIER_assert__cond~23_1) (not (= v_main_~__VERIFIER_assert__cond~22_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_48, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_27, main_~__VERIFIER_assert__cond~22=v_main_~__VERIFIER_assert__cond~22_4} OutVars{main_~main__t~0=v_main_~main__t~0_48, main_~__VERIFIER_assert__cond~23=v_main_~__VERIFIER_assert__cond~23_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_27, main_~__VERIFIER_assert__cond~22=v_main_~__VERIFIER_assert__cond~22_4, main_~__tmp_24~0=v_main_~__tmp_24~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~23, main_~__tmp_24~0] {7677#(<= 2 main_~main__t~0)} is VALID [2022-04-27 21:35:01,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {7677#(<= 2 main_~main__t~0)} [501] L445-->L453: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~23_4 0)) (= v_main_~main____CPAchecker_TMP_1~2_1 v_main_~main__t~0_50) (= (+ v_main_~main__t~0_50 1) v_main_~main__t~0_49)) InVars {main_~__VERIFIER_assert__cond~23=v_main_~__VERIFIER_assert__cond~23_4, main_~main__t~0=v_main_~main__t~0_50} OutVars{main_~main__t~0=v_main_~main__t~0_49, main_~main____CPAchecker_TMP_1~2=v_main_~main____CPAchecker_TMP_1~2_1, main_~__VERIFIER_assert__cond~23=v_main_~__VERIFIER_assert__cond~23_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~2] {7678#(<= 3 main_~main__t~0)} is VALID [2022-04-27 21:35:01,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {7678#(<= 3 main_~main__t~0)} [507] L453-->L461: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~3_1 |v_main_#t~nondet11_2|) (not (= v_main_~main__t~0_52 v_main_~main__tagbuf_len~0_29)) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_~main__t~0=v_main_~main__t~0_52, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_29, main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~main__t~0=v_main_~main__t~0_52, main_~main____CPAchecker_TMP_0~3=v_main_~main____CPAchecker_TMP_0~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_29} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~3, main_#t~nondet11] {7678#(<= 3 main_~main__t~0)} is VALID [2022-04-27 21:35:01,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {7678#(<= 3 main_~main__t~0)} [511] L461-->L502: Formula: (and (= v_main_~main____CPAchecker_TMP_0~3_5 0) (= v_main_~__tmp_27~0_1 v_main_~__VERIFIER_assert__cond~26_1) (= v_main_~__tmp_27~0_1 (ite (<= 0 v_main_~main__t~0_57) 1 0))) InVars {main_~main____CPAchecker_TMP_0~3=v_main_~main____CPAchecker_TMP_0~3_5, main_~main__t~0=v_main_~main__t~0_57} OutVars{main_~main__t~0=v_main_~main__t~0_57, main_~__VERIFIER_assert__cond~26=v_main_~__VERIFIER_assert__cond~26_1, main_~main____CPAchecker_TMP_0~3=v_main_~main____CPAchecker_TMP_0~3_5, main_~__tmp_27~0=v_main_~__tmp_27~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~26, main_~__tmp_27~0] {7678#(<= 3 main_~main__t~0)} is VALID [2022-04-27 21:35:01,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {7678#(<= 3 main_~main__t~0)} [515] L502-->L513: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~26_4 0)) (= (ite (<= v_main_~main__t~0_58 v_main_~main__tagbuf_len~0_31) 1 0) v_main_~__tmp_28~0_1) (= v_main_~__tmp_28~0_1 v_main_~__VERIFIER_assert__cond~27_1)) InVars {main_~main__t~0=v_main_~main__t~0_58, main_~__VERIFIER_assert__cond~26=v_main_~__VERIFIER_assert__cond~26_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_31} OutVars{main_~__VERIFIER_assert__cond~27=v_main_~__VERIFIER_assert__cond~27_1, main_~main__t~0=v_main_~main__t~0_58, main_~__VERIFIER_assert__cond~26=v_main_~__VERIFIER_assert__cond~26_4, main_~__tmp_28~0=v_main_~__tmp_28~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_31} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~27, main_~__tmp_28~0] {7678#(<= 3 main_~main__t~0)} is VALID [2022-04-27 21:35:01,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {7678#(<= 3 main_~main__t~0)} [519] L513-->L521: Formula: (and (= v_main_~main____CPAchecker_TMP_1~3_1 v_main_~main__t~0_60) (= (+ v_main_~main__t~0_60 1) v_main_~main__t~0_59) (not (= v_main_~__VERIFIER_assert__cond~27_4 0))) InVars {main_~__VERIFIER_assert__cond~27=v_main_~__VERIFIER_assert__cond~27_4, main_~main__t~0=v_main_~main__t~0_60} OutVars{main_~__VERIFIER_assert__cond~27=v_main_~__VERIFIER_assert__cond~27_4, main_~main__t~0=v_main_~main__t~0_59, main_~main____CPAchecker_TMP_1~3=v_main_~main____CPAchecker_TMP_1~3_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~3] {7679#(<= 4 main_~main__t~0)} is VALID [2022-04-27 21:35:01,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {7679#(<= 4 main_~main__t~0)} [521] L521-->L529: Formula: (and (= v_main_~main____CPAchecker_TMP_0~4_1 |v_main_#t~nondet12_2|) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647) (not (= v_main_~main__t~0_62 v_main_~main__tagbuf_len~0_33))) InVars {main_~main__t~0=v_main_~main__t~0_62, main_#t~nondet12=|v_main_#t~nondet12_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_33} OutVars{main_~main__t~0=v_main_~main__t~0_62, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_33, main_~main____CPAchecker_TMP_0~4=v_main_~main____CPAchecker_TMP_0~4_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~4, main_#t~nondet12] {7679#(<= 4 main_~main__t~0)} is VALID [2022-04-27 21:35:01,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {7679#(<= 4 main_~main__t~0)} [523] L529-->L570: Formula: (and (= (ite (<= 0 v_main_~main__t~0_67) 1 0) v_main_~__tmp_31~0_1) (= v_main_~__tmp_31~0_1 v_main_~__VERIFIER_assert__cond~30_1) (= v_main_~main____CPAchecker_TMP_0~4_5 0)) InVars {main_~main__t~0=v_main_~main__t~0_67, main_~main____CPAchecker_TMP_0~4=v_main_~main____CPAchecker_TMP_0~4_5} OutVars{main_~__VERIFIER_assert__cond~30=v_main_~__VERIFIER_assert__cond~30_1, main_~main__t~0=v_main_~main__t~0_67, main_~__tmp_31~0=v_main_~__tmp_31~0_1, main_~main____CPAchecker_TMP_0~4=v_main_~main____CPAchecker_TMP_0~4_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~30, main_~__tmp_31~0] {7679#(<= 4 main_~main__t~0)} is VALID [2022-04-27 21:35:01,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {7679#(<= 4 main_~main__t~0)} [527] L570-->L581: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~30_4 0)) (= v_main_~__tmp_32~0_1 v_main_~__VERIFIER_assert__cond~31_1) (= v_main_~__tmp_32~0_1 (ite (<= v_main_~main__t~0_68 v_main_~main__tagbuf_len~0_35) 1 0))) InVars {main_~__VERIFIER_assert__cond~30=v_main_~__VERIFIER_assert__cond~30_4, main_~main__t~0=v_main_~main__t~0_68, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_35} OutVars{main_~__VERIFIER_assert__cond~30=v_main_~__VERIFIER_assert__cond~30_4, main_~__tmp_32~0=v_main_~__tmp_32~0_1, main_~main__t~0=v_main_~main__t~0_68, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_35, main_~__VERIFIER_assert__cond~31=v_main_~__VERIFIER_assert__cond~31_1} AuxVars[] AssignedVars[main_~__tmp_32~0, main_~__VERIFIER_assert__cond~31] {7679#(<= 4 main_~main__t~0)} is VALID [2022-04-27 21:35:01,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {7679#(<= 4 main_~main__t~0)} [531] L581-->L589: Formula: (and (= v_main_~main____CPAchecker_TMP_1~4_1 v_main_~main__t~0_70) (not (= v_main_~__VERIFIER_assert__cond~31_4 0)) (= (+ v_main_~main__t~0_70 1) v_main_~main__t~0_69)) InVars {main_~main__t~0=v_main_~main__t~0_70, main_~__VERIFIER_assert__cond~31=v_main_~__VERIFIER_assert__cond~31_4} OutVars{main_~main____CPAchecker_TMP_1~4=v_main_~main____CPAchecker_TMP_1~4_1, main_~main__t~0=v_main_~main__t~0_69, main_~__VERIFIER_assert__cond~31=v_main_~__VERIFIER_assert__cond~31_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~4, main_~main__t~0] {7680#(<= 5 main_~main__t~0)} is VALID [2022-04-27 21:35:01,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {7680#(<= 5 main_~main__t~0)} [533] L589-->L597: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~5_1 |v_main_#t~nondet13_2|) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (not (= v_main_~main__t~0_72 v_main_~main__tagbuf_len~0_37))) InVars {main_~main__t~0=v_main_~main__t~0_72, main_#t~nondet13=|v_main_#t~nondet13_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_37} OutVars{main_~main__t~0=v_main_~main__t~0_72, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_37, main_~main____CPAchecker_TMP_0~5=v_main_~main____CPAchecker_TMP_0~5_1} AuxVars[] AssignedVars[main_#t~nondet13, main_~main____CPAchecker_TMP_0~5] {7680#(<= 5 main_~main__t~0)} is VALID [2022-04-27 21:35:01,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {7680#(<= 5 main_~main__t~0)} [535] L597-->L638: Formula: (and (= v_main_~__tmp_35~0_1 v_main_~__VERIFIER_assert__cond~34_1) (= v_main_~main____CPAchecker_TMP_0~5_5 0) (= v_main_~__tmp_35~0_1 (ite (<= 0 v_main_~main__t~0_77) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_77, main_~main____CPAchecker_TMP_0~5=v_main_~main____CPAchecker_TMP_0~5_5} OutVars{main_~main__t~0=v_main_~main__t~0_77, main_~__tmp_35~0=v_main_~__tmp_35~0_1, main_~__VERIFIER_assert__cond~34=v_main_~__VERIFIER_assert__cond~34_1, main_~main____CPAchecker_TMP_0~5=v_main_~main____CPAchecker_TMP_0~5_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~34, main_~__tmp_35~0] {7680#(<= 5 main_~main__t~0)} is VALID [2022-04-27 21:35:01,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {7680#(<= 5 main_~main__t~0)} [539] L638-->L649: Formula: (and (= v_main_~__tmp_36~0_1 v_main_~__VERIFIER_assert__cond~35_1) (not (= v_main_~__VERIFIER_assert__cond~34_4 0)) (= (ite (<= v_main_~main__t~0_78 v_main_~main__tagbuf_len~0_39) 1 0) v_main_~__tmp_36~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_78, main_~__VERIFIER_assert__cond~34=v_main_~__VERIFIER_assert__cond~34_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_39} OutVars{main_~main__t~0=v_main_~main__t~0_78, main_~__tmp_36~0=v_main_~__tmp_36~0_1, main_~__VERIFIER_assert__cond~35=v_main_~__VERIFIER_assert__cond~35_1, main_~__VERIFIER_assert__cond~34=v_main_~__VERIFIER_assert__cond~34_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_39} AuxVars[] AssignedVars[main_~__tmp_36~0, main_~__VERIFIER_assert__cond~35] {7680#(<= 5 main_~main__t~0)} is VALID [2022-04-27 21:35:01,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {7680#(<= 5 main_~main__t~0)} [543] L649-->L657: Formula: (and (= v_main_~main____CPAchecker_TMP_1~5_1 v_main_~main__t~0_80) (= (+ v_main_~main__t~0_80 1) v_main_~main__t~0_79) (not (= v_main_~__VERIFIER_assert__cond~35_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_80, main_~__VERIFIER_assert__cond~35=v_main_~__VERIFIER_assert__cond~35_4} OutVars{main_~main__t~0=v_main_~main__t~0_79, main_~__VERIFIER_assert__cond~35=v_main_~__VERIFIER_assert__cond~35_4, main_~main____CPAchecker_TMP_1~5=v_main_~main____CPAchecker_TMP_1~5_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~5] {7681#(<= 6 main_~main__t~0)} is VALID [2022-04-27 21:35:01,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {7681#(<= 6 main_~main__t~0)} [545] L657-->L665: Formula: (and (<= |v_main_#t~nondet14_2| 2147483647) (not (= v_main_~main__t~0_82 v_main_~main__tagbuf_len~0_41)) (= v_main_~main____CPAchecker_TMP_0~6_1 |v_main_#t~nondet14_2|) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_82, main_#t~nondet14=|v_main_#t~nondet14_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_41} OutVars{main_~main____CPAchecker_TMP_0~6=v_main_~main____CPAchecker_TMP_0~6_1, main_~main__t~0=v_main_~main__t~0_82, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_41} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~6, main_#t~nondet14] {7681#(<= 6 main_~main__t~0)} is VALID [2022-04-27 21:35:01,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {7681#(<= 6 main_~main__t~0)} [547] L665-->L706: Formula: (and (= v_main_~__tmp_39~0_1 v_main_~__VERIFIER_assert__cond~38_1) (= v_main_~main____CPAchecker_TMP_0~6_5 0) (= (ite (<= 0 v_main_~main__t~0_87) 1 0) v_main_~__tmp_39~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_87, main_~main____CPAchecker_TMP_0~6=v_main_~main____CPAchecker_TMP_0~6_5} OutVars{main_~__VERIFIER_assert__cond~38=v_main_~__VERIFIER_assert__cond~38_1, main_~main__t~0=v_main_~main__t~0_87, main_~main____CPAchecker_TMP_0~6=v_main_~main____CPAchecker_TMP_0~6_5, main_~__tmp_39~0=v_main_~__tmp_39~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~38, main_~__tmp_39~0] {7681#(<= 6 main_~main__t~0)} is VALID [2022-04-27 21:35:01,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {7681#(<= 6 main_~main__t~0)} [551] L706-->L717: Formula: (and (= v_main_~__tmp_40~0_1 v_main_~__VERIFIER_assert__cond~39_1) (not (= v_main_~__VERIFIER_assert__cond~38_4 0)) (= (ite (<= v_main_~main__t~0_88 v_main_~main__tagbuf_len~0_43) 1 0) v_main_~__tmp_40~0_1)) InVars {main_~__VERIFIER_assert__cond~38=v_main_~__VERIFIER_assert__cond~38_4, main_~main__t~0=v_main_~main__t~0_88, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_43} OutVars{main_~__VERIFIER_assert__cond~38=v_main_~__VERIFIER_assert__cond~38_4, main_~main__t~0=v_main_~main__t~0_88, main_~__tmp_40~0=v_main_~__tmp_40~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_43, main_~__VERIFIER_assert__cond~39=v_main_~__VERIFIER_assert__cond~39_1} AuxVars[] AssignedVars[main_~__tmp_40~0, main_~__VERIFIER_assert__cond~39] {7681#(<= 6 main_~main__t~0)} is VALID [2022-04-27 21:35:01,161 INFO L290 TraceCheckUtils]: 34: Hoare triple {7681#(<= 6 main_~main__t~0)} [555] L717-->L725: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~39_4 0)) (= v_main_~main__t~0_89 (+ v_main_~main__t~0_90 1)) (= v_main_~main____CPAchecker_TMP_1~6_1 v_main_~main__t~0_90)) InVars {main_~main__t~0=v_main_~main__t~0_90, main_~__VERIFIER_assert__cond~39=v_main_~__VERIFIER_assert__cond~39_4} OutVars{main_~main__t~0=v_main_~main__t~0_89, main_~main____CPAchecker_TMP_1~6=v_main_~main____CPAchecker_TMP_1~6_1, main_~__VERIFIER_assert__cond~39=v_main_~__VERIFIER_assert__cond~39_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~6] {7682#(<= 7 main_~main__t~0)} is VALID [2022-04-27 21:35:01,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {7682#(<= 7 main_~main__t~0)} [557] L725-->L733: Formula: (and (= v_main_~main____CPAchecker_TMP_0~7_1 |v_main_#t~nondet15_2|) (not (= v_main_~main__t~0_92 v_main_~main__tagbuf_len~0_45)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|, main_~main__t~0=v_main_~main__t~0_92, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_45} OutVars{main_~main____CPAchecker_TMP_0~7=v_main_~main____CPAchecker_TMP_0~7_1, main_~main__t~0=v_main_~main__t~0_92, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_45} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~7, main_#t~nondet15] {7682#(<= 7 main_~main__t~0)} is VALID [2022-04-27 21:35:01,162 INFO L290 TraceCheckUtils]: 36: Hoare triple {7682#(<= 7 main_~main__t~0)} [559] L733-->L774: Formula: (and (= v_main_~main____CPAchecker_TMP_0~7_5 0) (= v_main_~__tmp_43~0_1 v_main_~__VERIFIER_assert__cond~42_1) (= (ite (<= 0 v_main_~main__t~0_97) 1 0) v_main_~__tmp_43~0_1)) InVars {main_~main____CPAchecker_TMP_0~7=v_main_~main____CPAchecker_TMP_0~7_5, main_~main__t~0=v_main_~main__t~0_97} OutVars{main_~__VERIFIER_assert__cond~42=v_main_~__VERIFIER_assert__cond~42_1, main_~main____CPAchecker_TMP_0~7=v_main_~main____CPAchecker_TMP_0~7_5, main_~main__t~0=v_main_~main__t~0_97, main_~__tmp_43~0=v_main_~__tmp_43~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~42, main_~__tmp_43~0] {7682#(<= 7 main_~main__t~0)} is VALID [2022-04-27 21:35:01,162 INFO L290 TraceCheckUtils]: 37: Hoare triple {7682#(<= 7 main_~main__t~0)} [563] L774-->L785: Formula: (and (= v_main_~__tmp_44~0_1 v_main_~__VERIFIER_assert__cond~43_1) (not (= v_main_~__VERIFIER_assert__cond~42_4 0)) (= (ite (<= v_main_~main__t~0_98 v_main_~main__tagbuf_len~0_47) 1 0) v_main_~__tmp_44~0_1)) InVars {main_~__VERIFIER_assert__cond~42=v_main_~__VERIFIER_assert__cond~42_4, main_~main__t~0=v_main_~main__t~0_98, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_47} OutVars{main_~__VERIFIER_assert__cond~42=v_main_~__VERIFIER_assert__cond~42_4, main_~__VERIFIER_assert__cond~43=v_main_~__VERIFIER_assert__cond~43_1, main_~main__t~0=v_main_~main__t~0_98, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_47, main_~__tmp_44~0=v_main_~__tmp_44~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~43, main_~__tmp_44~0] {7682#(<= 7 main_~main__t~0)} is VALID [2022-04-27 21:35:01,162 INFO L290 TraceCheckUtils]: 38: Hoare triple {7682#(<= 7 main_~main__t~0)} [567] L785-->L793: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~43_4 0)) (= v_main_~main____CPAchecker_TMP_1~7_1 v_main_~main__t~0_100) (= (+ v_main_~main__t~0_100 1) v_main_~main__t~0_99)) InVars {main_~main__t~0=v_main_~main__t~0_100, main_~__VERIFIER_assert__cond~43=v_main_~__VERIFIER_assert__cond~43_4} OutVars{main_~main__t~0=v_main_~main__t~0_99, main_~__VERIFIER_assert__cond~43=v_main_~__VERIFIER_assert__cond~43_4, main_~main____CPAchecker_TMP_1~7=v_main_~main____CPAchecker_TMP_1~7_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~7] {7683#(<= 8 main_~main__t~0)} is VALID [2022-04-27 21:35:01,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {7683#(<= 8 main_~main__t~0)} [569] L793-->L801: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~8_1 |v_main_#t~nondet16_2|) (<= |v_main_#t~nondet16_2| 2147483647) (not (= v_main_~main__t~0_102 v_main_~main__tagbuf_len~0_49))) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|, main_~main__t~0=v_main_~main__t~0_102, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_49} OutVars{main_~main__t~0=v_main_~main__t~0_102, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_49} AuxVars[] AssignedVars[main_#t~nondet16, main_~main____CPAchecker_TMP_0~8] {7683#(<= 8 main_~main__t~0)} is VALID [2022-04-27 21:35:01,163 INFO L290 TraceCheckUtils]: 40: Hoare triple {7683#(<= 8 main_~main__t~0)} [571] L801-->L842: Formula: (and (= v_main_~__tmp_47~0_1 v_main_~__VERIFIER_assert__cond~46_1) (= v_main_~main____CPAchecker_TMP_0~8_5 0) (= v_main_~__tmp_47~0_1 (ite (<= 0 v_main_~main__t~0_107) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_107, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_5} OutVars{main_~main__t~0=v_main_~main__t~0_107, main_~__tmp_47~0=v_main_~__tmp_47~0_1, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_5, main_~__VERIFIER_assert__cond~46=v_main_~__VERIFIER_assert__cond~46_1} AuxVars[] AssignedVars[main_~__tmp_47~0, main_~__VERIFIER_assert__cond~46] {7683#(<= 8 main_~main__t~0)} is VALID [2022-04-27 21:35:01,163 INFO L290 TraceCheckUtils]: 41: Hoare triple {7683#(<= 8 main_~main__t~0)} [575] L842-->L853: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~46_4 0)) (= v_main_~__tmp_48~0_1 v_main_~__VERIFIER_assert__cond~47_1) (= (ite (<= v_main_~main__t~0_108 v_main_~main__tagbuf_len~0_51) 1 0) v_main_~__tmp_48~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_108, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_51, main_~__VERIFIER_assert__cond~46=v_main_~__VERIFIER_assert__cond~46_4} OutVars{main_~main__t~0=v_main_~main__t~0_108, main_~__tmp_48~0=v_main_~__tmp_48~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_51, main_~__VERIFIER_assert__cond~46=v_main_~__VERIFIER_assert__cond~46_4, main_~__VERIFIER_assert__cond~47=v_main_~__VERIFIER_assert__cond~47_1} AuxVars[] AssignedVars[main_~__tmp_48~0, main_~__VERIFIER_assert__cond~47] {7683#(<= 8 main_~main__t~0)} is VALID [2022-04-27 21:35:01,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {7683#(<= 8 main_~main__t~0)} [579] L853-->L940: Formula: (and (= v_main_~main____CPAchecker_TMP_0~8_6 v_~__tmp_3137_1~0_1) (= v_main_~main____CPAchecker_TMP_1~8_1 v_main_~main__t~0_110) (not (= v_main_~__VERIFIER_assert__cond~47_4 0)) (= v_main_~main____CPAchecker_TMP_1~8_1 v_~__tmp_3137_0~0_1) (= (+ v_main_~main__t~0_110 1) v_main_~main__t~0_109)) InVars {main_~main__t~0=v_main_~main__t~0_110, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_6, main_~__VERIFIER_assert__cond~47=v_main_~__VERIFIER_assert__cond~47_4} OutVars{main_~main__t~0=v_main_~main__t~0_109, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_6, main_~main____CPAchecker_TMP_1~8=v_main_~main____CPAchecker_TMP_1~8_1, ~__tmp_3137_1~0=v_~__tmp_3137_1~0_1, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_1, main_~__VERIFIER_assert__cond~47=v_main_~__VERIFIER_assert__cond~47_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~8, ~__tmp_3137_1~0, ~__tmp_3137_0~0] {7684#(<= 9 main_~main__t~0)} is VALID [2022-04-27 21:35:01,164 INFO L290 TraceCheckUtils]: 43: Hoare triple {7684#(<= 9 main_~main__t~0)} [580] L940-->L866: Formula: (and (= v_main_~main____CPAchecker_TMP_0~8_7 v_~__tmp_3137_1~0_2) (= v_main_~main____CPAchecker_TMP_1~8_2 v_~__tmp_3137_0~0_2)) InVars {~__tmp_3137_1~0=v_~__tmp_3137_1~0_2, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_2} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_2, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_7, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_2, main_~main____CPAchecker_TMP_1~8=v_main_~main____CPAchecker_TMP_1~8_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~8, main_~main____CPAchecker_TMP_1~8] {7684#(<= 9 main_~main__t~0)} is VALID [2022-04-27 21:35:01,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {7684#(<= 9 main_~main__t~0)} [582] L866-->L874: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (not (= v_main_~main__t~0_112 v_main_~main__tagbuf_len~0_53)) (= v_main_~main____CPAchecker_TMP_0~9_1 |v_main_#t~nondet17_2|) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_112, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_53, main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~main__t~0=v_main_~main__t~0_112, main_~main____CPAchecker_TMP_0~9=v_main_~main____CPAchecker_TMP_0~9_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_53} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~9, main_#t~nondet17] {7684#(<= 9 main_~main__t~0)} is VALID [2022-04-27 21:35:01,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {7684#(<= 9 main_~main__t~0)} [584] L874-->L917: Formula: (and (= v_main_~__VERIFIER_assert__cond~50_1 v_main_~__tmp_51~0_1) (= (ite (<= 0 v_main_~main__t~0_117) 1 0) v_main_~__tmp_51~0_1) (= v_main_~main____CPAchecker_TMP_0~9_5 0)) InVars {main_~main__t~0=v_main_~main__t~0_117, main_~main____CPAchecker_TMP_0~9=v_main_~main____CPAchecker_TMP_0~9_5} OutVars{main_~__tmp_51~0=v_main_~__tmp_51~0_1, main_~main__t~0=v_main_~main__t~0_117, main_~main____CPAchecker_TMP_0~9=v_main_~main____CPAchecker_TMP_0~9_5, main_~__VERIFIER_assert__cond~50=v_main_~__VERIFIER_assert__cond~50_1} AuxVars[] AssignedVars[main_~__tmp_51~0, main_~__VERIFIER_assert__cond~50] {7685#(not (= main_~__VERIFIER_assert__cond~50 0))} is VALID [2022-04-27 21:35:01,165 INFO L290 TraceCheckUtils]: 46: Hoare triple {7685#(not (= main_~__VERIFIER_assert__cond~50 0))} [587] L917-->L919: Formula: (= v_main_~__VERIFIER_assert__cond~50_3 0) InVars {main_~__VERIFIER_assert__cond~50=v_main_~__VERIFIER_assert__cond~50_3} OutVars{main_~__VERIFIER_assert__cond~50=v_main_~__VERIFIER_assert__cond~50_3} AuxVars[] AssignedVars[] {7671#false} is VALID [2022-04-27 21:35:01,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {7671#false} [593] L919-->mainErr14ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7671#false} is VALID [2022-04-27 21:35:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:35:01,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:01,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259082090] [2022-04-27 21:35:01,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259082090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:01,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:01,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-27 21:35:01,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960552062] [2022-04-27 21:35:01,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:01,167 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-27 21:35:01,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:01,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:01,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:01,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 21:35:01,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:01,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 21:35:01,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-04-27 21:35:01,201 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:01,727 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-27 21:35:01,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 21:35:01,727 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-27 21:35:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2022-04-27 21:35:01,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2022-04-27 21:35:01,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 63 transitions. [2022-04-27 21:35:01,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:01,795 INFO L225 Difference]: With dead ends: 63 [2022-04-27 21:35:01,795 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 21:35:01,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-04-27 21:35:01,796 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 94 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:01,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 53 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:35:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 21:35:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2022-04-27 21:35:01,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:01,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:01,802 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:01,803 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:01,803 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-27 21:35:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-27 21:35:01,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:01,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:01,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-27 21:35:01,804 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-27 21:35:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:01,805 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-27 21:35:01,805 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-27 21:35:01,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:01,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:01,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:01,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-04-27 21:35:01,806 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2022-04-27 21:35:01,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:01,807 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-04-27 21:35:01,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:01,807 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-27 21:35:01,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 21:35:01,808 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:01,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:01,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 21:35:01,809 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:35:01,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:01,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1141762383, now seen corresponding path program 1 times [2022-04-27 21:35:01,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:01,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762980202] [2022-04-27 21:35:01,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:01,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:02,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:02,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {7969#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {7959#true} is VALID [2022-04-27 21:35:02,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {7959#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7959#true} is VALID [2022-04-27 21:35:02,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7959#true} {7959#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7959#true} is VALID [2022-04-27 21:35:02,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {7959#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7969#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:35:02,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {7969#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {7959#true} is VALID [2022-04-27 21:35:02,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {7959#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7959#true} is VALID [2022-04-27 21:35:02,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7959#true} {7959#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7959#true} is VALID [2022-04-27 21:35:02,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {7959#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7959#true} is VALID [2022-04-27 21:35:02,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {7959#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {7959#true} is VALID [2022-04-27 21:35:02,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {7959#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {7959#true} is VALID [2022-04-27 21:35:02,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {7959#true} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {7959#true} is VALID [2022-04-27 21:35:02,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {7959#true} [414] L65-->L298: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_27) 1 0) v_main_~__tmp_15~0_1) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1)) InVars {main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {7959#true} is VALID [2022-04-27 21:35:02,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {7959#true} [421] L298-->L309: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~14_4 0)) (= v_main_~__tmp_16~0_1 v_main_~__VERIFIER_assert__cond~15_1) (= (ite (<= v_main_~main__t~0_28 v_main_~main__tagbuf_len~0_19) 1 0) v_main_~__tmp_16~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_28, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_1, main_~main__t~0=v_main_~main__t~0_28, main_~__tmp_16~0=v_main_~__tmp_16~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~15, main_~__tmp_16~0] {7959#true} is VALID [2022-04-27 21:35:02,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {7959#true} [429] L309-->L317: Formula: (and (= (+ v_main_~main__t~0_30 1) v_main_~main__t~0_29) (not (= v_main_~__VERIFIER_assert__cond~15_4 0)) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_30)) InVars {main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_4, main_~main__t~0=v_main_~main__t~0_30} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_4, main_~main__t~0=v_main_~main__t~0_29, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~0] {7959#true} is VALID [2022-04-27 21:35:02,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {7959#true} [434] L317-->L325: Formula: (and (not (= v_main_~main__t~0_32 v_main_~main__tagbuf_len~0_21)) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_32, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_32, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {7964#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:02,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {7964#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [438] L325-->L366: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_5 0) (= v_main_~__tmp_19~0_1 v_main_~__VERIFIER_assert__cond~18_1) (= (ite (<= 0 v_main_~main__t~0_37) 1 0) v_main_~__tmp_19~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_37, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5} OutVars{main_~main__t~0=v_main_~main__t~0_37, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__tmp_19~0=v_main_~__tmp_19~0_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_1} AuxVars[] AssignedVars[main_~__tmp_19~0, main_~__VERIFIER_assert__cond~18] {7964#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:02,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {7964#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [446] L366-->L377: Formula: (and (= v_main_~__tmp_20~0_1 v_main_~__VERIFIER_assert__cond~19_1) (not (= v_main_~__VERIFIER_assert__cond~18_4 0)) (= (ite (<= v_main_~main__t~0_38 v_main_~main__tagbuf_len~0_23) 1 0) v_main_~__tmp_20~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_38, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} OutVars{main_~main__t~0=v_main_~main__t~0_38, main_~__tmp_20~0=v_main_~__tmp_20~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} AuxVars[] AssignedVars[main_~__tmp_20~0, main_~__VERIFIER_assert__cond~19] {7965#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~19 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2022-04-27 21:35:02,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {7965#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~19 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} [458] L377-->L385: Formula: (and (= (+ v_main_~main__t~0_40 1) v_main_~main__t~0_39) (= v_main_~main____CPAchecker_TMP_1~1_1 v_main_~main__t~0_40) (not (= v_main_~__VERIFIER_assert__cond~19_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_40, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4} OutVars{main_~main__t~0=v_main_~main__t~0_39, main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_1, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~1] {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [467] L385-->L393: Formula: (and (not (= v_main_~main__t~0_42 v_main_~main__tagbuf_len~0_25)) (= v_main_~main____CPAchecker_TMP_0~2_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~main__t~0=v_main_~main__t~0_42, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_25, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~main__t~0=v_main_~main__t~0_42, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_25, main_~main____CPAchecker_TMP_0~2=v_main_~main____CPAchecker_TMP_0~2_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~2, main_#t~nondet10] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [479] L393-->L434: Formula: (and (= v_main_~__tmp_23~0_1 (ite (<= 0 v_main_~main__t~0_47) 1 0)) (= v_main_~main____CPAchecker_TMP_0~2_5 0) (= v_main_~__tmp_23~0_1 v_main_~__VERIFIER_assert__cond~22_1)) InVars {main_~main__t~0=v_main_~main__t~0_47, main_~main____CPAchecker_TMP_0~2=v_main_~main____CPAchecker_TMP_0~2_5} OutVars{main_~main__t~0=v_main_~main__t~0_47, main_~__tmp_23~0=v_main_~__tmp_23~0_1, main_~__VERIFIER_assert__cond~22=v_main_~__VERIFIER_assert__cond~22_1, main_~main____CPAchecker_TMP_0~2=v_main_~main____CPAchecker_TMP_0~2_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~22, main_~__tmp_23~0] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [493] L434-->L445: Formula: (and (= (ite (<= v_main_~main__t~0_48 v_main_~main__tagbuf_len~0_27) 1 0) v_main_~__tmp_24~0_1) (= v_main_~__tmp_24~0_1 v_main_~__VERIFIER_assert__cond~23_1) (not (= v_main_~__VERIFIER_assert__cond~22_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_48, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_27, main_~__VERIFIER_assert__cond~22=v_main_~__VERIFIER_assert__cond~22_4} OutVars{main_~main__t~0=v_main_~main__t~0_48, main_~__VERIFIER_assert__cond~23=v_main_~__VERIFIER_assert__cond~23_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_27, main_~__VERIFIER_assert__cond~22=v_main_~__VERIFIER_assert__cond~22_4, main_~__tmp_24~0=v_main_~__tmp_24~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~23, main_~__tmp_24~0] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [501] L445-->L453: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~23_4 0)) (= v_main_~main____CPAchecker_TMP_1~2_1 v_main_~main__t~0_50) (= (+ v_main_~main__t~0_50 1) v_main_~main__t~0_49)) InVars {main_~__VERIFIER_assert__cond~23=v_main_~__VERIFIER_assert__cond~23_4, main_~main__t~0=v_main_~main__t~0_50} OutVars{main_~main__t~0=v_main_~main__t~0_49, main_~main____CPAchecker_TMP_1~2=v_main_~main____CPAchecker_TMP_1~2_1, main_~__VERIFIER_assert__cond~23=v_main_~__VERIFIER_assert__cond~23_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~2] {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [507] L453-->L461: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~3_1 |v_main_#t~nondet11_2|) (not (= v_main_~main__t~0_52 v_main_~main__tagbuf_len~0_29)) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_~main__t~0=v_main_~main__t~0_52, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_29, main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~main__t~0=v_main_~main__t~0_52, main_~main____CPAchecker_TMP_0~3=v_main_~main____CPAchecker_TMP_0~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_29} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~3, main_#t~nondet11] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [511] L461-->L502: Formula: (and (= v_main_~main____CPAchecker_TMP_0~3_5 0) (= v_main_~__tmp_27~0_1 v_main_~__VERIFIER_assert__cond~26_1) (= v_main_~__tmp_27~0_1 (ite (<= 0 v_main_~main__t~0_57) 1 0))) InVars {main_~main____CPAchecker_TMP_0~3=v_main_~main____CPAchecker_TMP_0~3_5, main_~main__t~0=v_main_~main__t~0_57} OutVars{main_~main__t~0=v_main_~main__t~0_57, main_~__VERIFIER_assert__cond~26=v_main_~__VERIFIER_assert__cond~26_1, main_~main____CPAchecker_TMP_0~3=v_main_~main____CPAchecker_TMP_0~3_5, main_~__tmp_27~0=v_main_~__tmp_27~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~26, main_~__tmp_27~0] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [515] L502-->L513: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~26_4 0)) (= (ite (<= v_main_~main__t~0_58 v_main_~main__tagbuf_len~0_31) 1 0) v_main_~__tmp_28~0_1) (= v_main_~__tmp_28~0_1 v_main_~__VERIFIER_assert__cond~27_1)) InVars {main_~main__t~0=v_main_~main__t~0_58, main_~__VERIFIER_assert__cond~26=v_main_~__VERIFIER_assert__cond~26_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_31} OutVars{main_~__VERIFIER_assert__cond~27=v_main_~__VERIFIER_assert__cond~27_1, main_~main__t~0=v_main_~main__t~0_58, main_~__VERIFIER_assert__cond~26=v_main_~__VERIFIER_assert__cond~26_4, main_~__tmp_28~0=v_main_~__tmp_28~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_31} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~27, main_~__tmp_28~0] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [519] L513-->L521: Formula: (and (= v_main_~main____CPAchecker_TMP_1~3_1 v_main_~main__t~0_60) (= (+ v_main_~main__t~0_60 1) v_main_~main__t~0_59) (not (= v_main_~__VERIFIER_assert__cond~27_4 0))) InVars {main_~__VERIFIER_assert__cond~27=v_main_~__VERIFIER_assert__cond~27_4, main_~main__t~0=v_main_~main__t~0_60} OutVars{main_~__VERIFIER_assert__cond~27=v_main_~__VERIFIER_assert__cond~27_4, main_~main__t~0=v_main_~main__t~0_59, main_~main____CPAchecker_TMP_1~3=v_main_~main____CPAchecker_TMP_1~3_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~3] {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [521] L521-->L529: Formula: (and (= v_main_~main____CPAchecker_TMP_0~4_1 |v_main_#t~nondet12_2|) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647) (not (= v_main_~main__t~0_62 v_main_~main__tagbuf_len~0_33))) InVars {main_~main__t~0=v_main_~main__t~0_62, main_#t~nondet12=|v_main_#t~nondet12_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_33} OutVars{main_~main__t~0=v_main_~main__t~0_62, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_33, main_~main____CPAchecker_TMP_0~4=v_main_~main____CPAchecker_TMP_0~4_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~4, main_#t~nondet12] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [523] L529-->L570: Formula: (and (= (ite (<= 0 v_main_~main__t~0_67) 1 0) v_main_~__tmp_31~0_1) (= v_main_~__tmp_31~0_1 v_main_~__VERIFIER_assert__cond~30_1) (= v_main_~main____CPAchecker_TMP_0~4_5 0)) InVars {main_~main__t~0=v_main_~main__t~0_67, main_~main____CPAchecker_TMP_0~4=v_main_~main____CPAchecker_TMP_0~4_5} OutVars{main_~__VERIFIER_assert__cond~30=v_main_~__VERIFIER_assert__cond~30_1, main_~main__t~0=v_main_~main__t~0_67, main_~__tmp_31~0=v_main_~__tmp_31~0_1, main_~main____CPAchecker_TMP_0~4=v_main_~main____CPAchecker_TMP_0~4_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~30, main_~__tmp_31~0] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [527] L570-->L581: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~30_4 0)) (= v_main_~__tmp_32~0_1 v_main_~__VERIFIER_assert__cond~31_1) (= v_main_~__tmp_32~0_1 (ite (<= v_main_~main__t~0_68 v_main_~main__tagbuf_len~0_35) 1 0))) InVars {main_~__VERIFIER_assert__cond~30=v_main_~__VERIFIER_assert__cond~30_4, main_~main__t~0=v_main_~main__t~0_68, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_35} OutVars{main_~__VERIFIER_assert__cond~30=v_main_~__VERIFIER_assert__cond~30_4, main_~__tmp_32~0=v_main_~__tmp_32~0_1, main_~main__t~0=v_main_~main__t~0_68, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_35, main_~__VERIFIER_assert__cond~31=v_main_~__VERIFIER_assert__cond~31_1} AuxVars[] AssignedVars[main_~__tmp_32~0, main_~__VERIFIER_assert__cond~31] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [531] L581-->L589: Formula: (and (= v_main_~main____CPAchecker_TMP_1~4_1 v_main_~main__t~0_70) (not (= v_main_~__VERIFIER_assert__cond~31_4 0)) (= (+ v_main_~main__t~0_70 1) v_main_~main__t~0_69)) InVars {main_~main__t~0=v_main_~main__t~0_70, main_~__VERIFIER_assert__cond~31=v_main_~__VERIFIER_assert__cond~31_4} OutVars{main_~main____CPAchecker_TMP_1~4=v_main_~main____CPAchecker_TMP_1~4_1, main_~main__t~0=v_main_~main__t~0_69, main_~__VERIFIER_assert__cond~31=v_main_~__VERIFIER_assert__cond~31_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~4, main_~main__t~0] {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [533] L589-->L597: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~5_1 |v_main_#t~nondet13_2|) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (not (= v_main_~main__t~0_72 v_main_~main__tagbuf_len~0_37))) InVars {main_~main__t~0=v_main_~main__t~0_72, main_#t~nondet13=|v_main_#t~nondet13_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_37} OutVars{main_~main__t~0=v_main_~main__t~0_72, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_37, main_~main____CPAchecker_TMP_0~5=v_main_~main____CPAchecker_TMP_0~5_1} AuxVars[] AssignedVars[main_#t~nondet13, main_~main____CPAchecker_TMP_0~5] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [535] L597-->L638: Formula: (and (= v_main_~__tmp_35~0_1 v_main_~__VERIFIER_assert__cond~34_1) (= v_main_~main____CPAchecker_TMP_0~5_5 0) (= v_main_~__tmp_35~0_1 (ite (<= 0 v_main_~main__t~0_77) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_77, main_~main____CPAchecker_TMP_0~5=v_main_~main____CPAchecker_TMP_0~5_5} OutVars{main_~main__t~0=v_main_~main__t~0_77, main_~__tmp_35~0=v_main_~__tmp_35~0_1, main_~__VERIFIER_assert__cond~34=v_main_~__VERIFIER_assert__cond~34_1, main_~main____CPAchecker_TMP_0~5=v_main_~main____CPAchecker_TMP_0~5_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~34, main_~__tmp_35~0] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [539] L638-->L649: Formula: (and (= v_main_~__tmp_36~0_1 v_main_~__VERIFIER_assert__cond~35_1) (not (= v_main_~__VERIFIER_assert__cond~34_4 0)) (= (ite (<= v_main_~main__t~0_78 v_main_~main__tagbuf_len~0_39) 1 0) v_main_~__tmp_36~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_78, main_~__VERIFIER_assert__cond~34=v_main_~__VERIFIER_assert__cond~34_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_39} OutVars{main_~main__t~0=v_main_~main__t~0_78, main_~__tmp_36~0=v_main_~__tmp_36~0_1, main_~__VERIFIER_assert__cond~35=v_main_~__VERIFIER_assert__cond~35_1, main_~__VERIFIER_assert__cond~34=v_main_~__VERIFIER_assert__cond~34_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_39} AuxVars[] AssignedVars[main_~__tmp_36~0, main_~__VERIFIER_assert__cond~35] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [543] L649-->L657: Formula: (and (= v_main_~main____CPAchecker_TMP_1~5_1 v_main_~main__t~0_80) (= (+ v_main_~main__t~0_80 1) v_main_~main__t~0_79) (not (= v_main_~__VERIFIER_assert__cond~35_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_80, main_~__VERIFIER_assert__cond~35=v_main_~__VERIFIER_assert__cond~35_4} OutVars{main_~main__t~0=v_main_~main__t~0_79, main_~__VERIFIER_assert__cond~35=v_main_~__VERIFIER_assert__cond~35_4, main_~main____CPAchecker_TMP_1~5=v_main_~main____CPAchecker_TMP_1~5_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~5] {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [545] L657-->L665: Formula: (and (<= |v_main_#t~nondet14_2| 2147483647) (not (= v_main_~main__t~0_82 v_main_~main__tagbuf_len~0_41)) (= v_main_~main____CPAchecker_TMP_0~6_1 |v_main_#t~nondet14_2|) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_82, main_#t~nondet14=|v_main_#t~nondet14_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_41} OutVars{main_~main____CPAchecker_TMP_0~6=v_main_~main____CPAchecker_TMP_0~6_1, main_~main__t~0=v_main_~main__t~0_82, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_41} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~6, main_#t~nondet14] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [547] L665-->L706: Formula: (and (= v_main_~__tmp_39~0_1 v_main_~__VERIFIER_assert__cond~38_1) (= v_main_~main____CPAchecker_TMP_0~6_5 0) (= (ite (<= 0 v_main_~main__t~0_87) 1 0) v_main_~__tmp_39~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_87, main_~main____CPAchecker_TMP_0~6=v_main_~main____CPAchecker_TMP_0~6_5} OutVars{main_~__VERIFIER_assert__cond~38=v_main_~__VERIFIER_assert__cond~38_1, main_~main__t~0=v_main_~main__t~0_87, main_~main____CPAchecker_TMP_0~6=v_main_~main____CPAchecker_TMP_0~6_5, main_~__tmp_39~0=v_main_~__tmp_39~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~38, main_~__tmp_39~0] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [551] L706-->L717: Formula: (and (= v_main_~__tmp_40~0_1 v_main_~__VERIFIER_assert__cond~39_1) (not (= v_main_~__VERIFIER_assert__cond~38_4 0)) (= (ite (<= v_main_~main__t~0_88 v_main_~main__tagbuf_len~0_43) 1 0) v_main_~__tmp_40~0_1)) InVars {main_~__VERIFIER_assert__cond~38=v_main_~__VERIFIER_assert__cond~38_4, main_~main__t~0=v_main_~main__t~0_88, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_43} OutVars{main_~__VERIFIER_assert__cond~38=v_main_~__VERIFIER_assert__cond~38_4, main_~main__t~0=v_main_~main__t~0_88, main_~__tmp_40~0=v_main_~__tmp_40~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_43, main_~__VERIFIER_assert__cond~39=v_main_~__VERIFIER_assert__cond~39_1} AuxVars[] AssignedVars[main_~__tmp_40~0, main_~__VERIFIER_assert__cond~39] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,074 INFO L290 TraceCheckUtils]: 34: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [555] L717-->L725: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~39_4 0)) (= v_main_~main__t~0_89 (+ v_main_~main__t~0_90 1)) (= v_main_~main____CPAchecker_TMP_1~6_1 v_main_~main__t~0_90)) InVars {main_~main__t~0=v_main_~main__t~0_90, main_~__VERIFIER_assert__cond~39=v_main_~__VERIFIER_assert__cond~39_4} OutVars{main_~main__t~0=v_main_~main__t~0_89, main_~main____CPAchecker_TMP_1~6=v_main_~main____CPAchecker_TMP_1~6_1, main_~__VERIFIER_assert__cond~39=v_main_~__VERIFIER_assert__cond~39_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~6] {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [557] L725-->L733: Formula: (and (= v_main_~main____CPAchecker_TMP_0~7_1 |v_main_#t~nondet15_2|) (not (= v_main_~main__t~0_92 v_main_~main__tagbuf_len~0_45)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|, main_~main__t~0=v_main_~main__t~0_92, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_45} OutVars{main_~main____CPAchecker_TMP_0~7=v_main_~main____CPAchecker_TMP_0~7_1, main_~main__t~0=v_main_~main__t~0_92, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_45} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~7, main_#t~nondet15] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [559] L733-->L774: Formula: (and (= v_main_~main____CPAchecker_TMP_0~7_5 0) (= v_main_~__tmp_43~0_1 v_main_~__VERIFIER_assert__cond~42_1) (= (ite (<= 0 v_main_~main__t~0_97) 1 0) v_main_~__tmp_43~0_1)) InVars {main_~main____CPAchecker_TMP_0~7=v_main_~main____CPAchecker_TMP_0~7_5, main_~main__t~0=v_main_~main__t~0_97} OutVars{main_~__VERIFIER_assert__cond~42=v_main_~__VERIFIER_assert__cond~42_1, main_~main____CPAchecker_TMP_0~7=v_main_~main____CPAchecker_TMP_0~7_5, main_~main__t~0=v_main_~main__t~0_97, main_~__tmp_43~0=v_main_~__tmp_43~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~42, main_~__tmp_43~0] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,075 INFO L290 TraceCheckUtils]: 37: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [563] L774-->L785: Formula: (and (= v_main_~__tmp_44~0_1 v_main_~__VERIFIER_assert__cond~43_1) (not (= v_main_~__VERIFIER_assert__cond~42_4 0)) (= (ite (<= v_main_~main__t~0_98 v_main_~main__tagbuf_len~0_47) 1 0) v_main_~__tmp_44~0_1)) InVars {main_~__VERIFIER_assert__cond~42=v_main_~__VERIFIER_assert__cond~42_4, main_~main__t~0=v_main_~main__t~0_98, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_47} OutVars{main_~__VERIFIER_assert__cond~42=v_main_~__VERIFIER_assert__cond~42_4, main_~__VERIFIER_assert__cond~43=v_main_~__VERIFIER_assert__cond~43_1, main_~main__t~0=v_main_~main__t~0_98, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_47, main_~__tmp_44~0=v_main_~__tmp_44~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~43, main_~__tmp_44~0] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,075 INFO L290 TraceCheckUtils]: 38: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [567] L785-->L793: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~43_4 0)) (= v_main_~main____CPAchecker_TMP_1~7_1 v_main_~main__t~0_100) (= (+ v_main_~main__t~0_100 1) v_main_~main__t~0_99)) InVars {main_~main__t~0=v_main_~main__t~0_100, main_~__VERIFIER_assert__cond~43=v_main_~__VERIFIER_assert__cond~43_4} OutVars{main_~main__t~0=v_main_~main__t~0_99, main_~__VERIFIER_assert__cond~43=v_main_~__VERIFIER_assert__cond~43_4, main_~main____CPAchecker_TMP_1~7=v_main_~main____CPAchecker_TMP_1~7_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~7] {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [569] L793-->L801: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~8_1 |v_main_#t~nondet16_2|) (<= |v_main_#t~nondet16_2| 2147483647) (not (= v_main_~main__t~0_102 v_main_~main__tagbuf_len~0_49))) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|, main_~main__t~0=v_main_~main__t~0_102, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_49} OutVars{main_~main__t~0=v_main_~main__t~0_102, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_49} AuxVars[] AssignedVars[main_#t~nondet16, main_~main____CPAchecker_TMP_0~8] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [571] L801-->L842: Formula: (and (= v_main_~__tmp_47~0_1 v_main_~__VERIFIER_assert__cond~46_1) (= v_main_~main____CPAchecker_TMP_0~8_5 0) (= v_main_~__tmp_47~0_1 (ite (<= 0 v_main_~main__t~0_107) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_107, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_5} OutVars{main_~main__t~0=v_main_~main__t~0_107, main_~__tmp_47~0=v_main_~__tmp_47~0_1, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_5, main_~__VERIFIER_assert__cond~46=v_main_~__VERIFIER_assert__cond~46_1} AuxVars[] AssignedVars[main_~__tmp_47~0, main_~__VERIFIER_assert__cond~46] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [575] L842-->L853: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~46_4 0)) (= v_main_~__tmp_48~0_1 v_main_~__VERIFIER_assert__cond~47_1) (= (ite (<= v_main_~main__t~0_108 v_main_~main__tagbuf_len~0_51) 1 0) v_main_~__tmp_48~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_108, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_51, main_~__VERIFIER_assert__cond~46=v_main_~__VERIFIER_assert__cond~46_4} OutVars{main_~main__t~0=v_main_~main__t~0_108, main_~__tmp_48~0=v_main_~__tmp_48~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_51, main_~__VERIFIER_assert__cond~46=v_main_~__VERIFIER_assert__cond~46_4, main_~__VERIFIER_assert__cond~47=v_main_~__VERIFIER_assert__cond~47_1} AuxVars[] AssignedVars[main_~__tmp_48~0, main_~__VERIFIER_assert__cond~47] {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {7967#(< main_~main__t~0 main_~main__tagbuf_len~0)} [579] L853-->L940: Formula: (and (= v_main_~main____CPAchecker_TMP_0~8_6 v_~__tmp_3137_1~0_1) (= v_main_~main____CPAchecker_TMP_1~8_1 v_main_~main__t~0_110) (not (= v_main_~__VERIFIER_assert__cond~47_4 0)) (= v_main_~main____CPAchecker_TMP_1~8_1 v_~__tmp_3137_0~0_1) (= (+ v_main_~main__t~0_110 1) v_main_~main__t~0_109)) InVars {main_~main__t~0=v_main_~main__t~0_110, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_6, main_~__VERIFIER_assert__cond~47=v_main_~__VERIFIER_assert__cond~47_4} OutVars{main_~main__t~0=v_main_~main__t~0_109, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_6, main_~main____CPAchecker_TMP_1~8=v_main_~main____CPAchecker_TMP_1~8_1, ~__tmp_3137_1~0=v_~__tmp_3137_1~0_1, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_1, main_~__VERIFIER_assert__cond~47=v_main_~__VERIFIER_assert__cond~47_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~8, ~__tmp_3137_1~0, ~__tmp_3137_0~0] {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,078 INFO L290 TraceCheckUtils]: 43: Hoare triple {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [580] L940-->L866: Formula: (and (= v_main_~main____CPAchecker_TMP_0~8_7 v_~__tmp_3137_1~0_2) (= v_main_~main____CPAchecker_TMP_1~8_2 v_~__tmp_3137_0~0_2)) InVars {~__tmp_3137_1~0=v_~__tmp_3137_1~0_2, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_2} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_2, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_7, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_2, main_~main____CPAchecker_TMP_1~8=v_main_~main____CPAchecker_TMP_1~8_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~8, main_~main____CPAchecker_TMP_1~8] {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,078 INFO L290 TraceCheckUtils]: 44: Hoare triple {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [582] L866-->L874: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (not (= v_main_~main__t~0_112 v_main_~main__tagbuf_len~0_53)) (= v_main_~main____CPAchecker_TMP_0~9_1 |v_main_#t~nondet17_2|) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_112, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_53, main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~main__t~0=v_main_~main__t~0_112, main_~main____CPAchecker_TMP_0~9=v_main_~main____CPAchecker_TMP_0~9_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_53} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~9, main_#t~nondet17] {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,078 INFO L290 TraceCheckUtils]: 45: Hoare triple {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [583] L874-->L881: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~9_3 0)) (= v_main_~__tmp_49~0_1 (ite (<= 0 v_main_~main__t~0_113) 1 0)) (= v_main_~__tmp_49~0_1 v_main_~__VERIFIER_assert__cond~48_1)) InVars {main_~main__t~0=v_main_~main__t~0_113, main_~main____CPAchecker_TMP_0~9=v_main_~main____CPAchecker_TMP_0~9_3} OutVars{main_~main__t~0=v_main_~main__t~0_113, main_~main____CPAchecker_TMP_0~9=v_main_~main____CPAchecker_TMP_0~9_3, main_~__tmp_49~0=v_main_~__tmp_49~0_1, main_~__VERIFIER_assert__cond~48=v_main_~__VERIFIER_assert__cond~48_1} AuxVars[] AssignedVars[main_~__tmp_49~0, main_~__VERIFIER_assert__cond~48] {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,079 INFO L290 TraceCheckUtils]: 46: Hoare triple {7966#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [586] L881-->L893: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~48_4 0)) (= v_main_~__VERIFIER_assert__cond~49_1 v_main_~__tmp_50~0_1) (= v_main_~__tmp_50~0_1 (ite (<= v_main_~main__t~0_114 v_main_~main__tagbuf_len~0_54) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_114, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_54, main_~__VERIFIER_assert__cond~48=v_main_~__VERIFIER_assert__cond~48_4} OutVars{main_~main__t~0=v_main_~main__t~0_114, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_54, main_~__VERIFIER_assert__cond~48=v_main_~__VERIFIER_assert__cond~48_4, main_~__VERIFIER_assert__cond~49=v_main_~__VERIFIER_assert__cond~49_1, main_~__tmp_50~0=v_main_~__tmp_50~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~49, main_~__tmp_50~0] {7968#(not (= main_~__VERIFIER_assert__cond~49 0))} is VALID [2022-04-27 21:35:02,079 INFO L290 TraceCheckUtils]: 47: Hoare triple {7968#(not (= main_~__VERIFIER_assert__cond~49 0))} [591] L893-->L895: Formula: (= v_main_~__VERIFIER_assert__cond~49_3 0) InVars {main_~__VERIFIER_assert__cond~49=v_main_~__VERIFIER_assert__cond~49_3} OutVars{main_~__VERIFIER_assert__cond~49=v_main_~__VERIFIER_assert__cond~49_3} AuxVars[] AssignedVars[] {7960#false} is VALID [2022-04-27 21:35:02,080 INFO L290 TraceCheckUtils]: 48: Hoare triple {7960#false} [597] L895-->mainErr13ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7960#false} is VALID [2022-04-27 21:35:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:35:02,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:02,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762980202] [2022-04-27 21:35:02,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762980202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:02,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:02,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 21:35:02,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524002161] [2022-04-27 21:35:02,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:02,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-27 21:35:02,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:02,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:02,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:02,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:35:02,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:02,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:35:02,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:35:02,124 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:02,440 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-27 21:35:02,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:35:02,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-27 21:35:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:02,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-27 21:35:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:02,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-27 21:35:02,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-27 21:35:02,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:02,496 INFO L225 Difference]: With dead ends: 54 [2022-04-27 21:35:02,496 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 21:35:02,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-27 21:35:02,497 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 99 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:02,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 32 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:02,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 21:35:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-27 21:35:02,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:02,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:02,503 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:02,504 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:02,504 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-27 21:35:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-27 21:35:02,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:02,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:02,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-27 21:35:02,505 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-27 21:35:02,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:02,509 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-27 21:35:02,509 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-27 21:35:02,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:02,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:02,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:02,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-27 21:35:02,510 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 49 [2022-04-27 21:35:02,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:02,510 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-27 21:35:02,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-27 21:35:02,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 21:35:02,511 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:02,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:02,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 21:35:02,511 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:35:02,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:02,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1141794222, now seen corresponding path program 1 times [2022-04-27 21:35:02,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:02,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430251344] [2022-04-27 21:35:02,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:02,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:02,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:02,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {8204#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {8194#true} is VALID [2022-04-27 21:35:02,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {8194#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8194#true} is VALID [2022-04-27 21:35:02,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8194#true} {8194#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8194#true} is VALID [2022-04-27 21:35:02,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {8194#true} [401] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8204#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:35:02,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {8204#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [403] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_main~0_53 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__tmp_3137_1~0_4 0) (= v_~__tmp_2624_1~0_13 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_3137_0~0_4 0) (= v_~__tmp_2624_0~0_13 0) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__return_2598~0_2 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_4, ~__tmp_2624_0~0=v_~__tmp_2624_0~0_13, ~__return_2598~0=v_~__return_2598~0_2, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_4, ~__tmp_2624_1~0=v_~__tmp_2624_1~0_13, #NULL.base=|v_#NULL.base_1|, ~__return_main~0=v_~__return_main~0_53, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__return_main~0, ~__tmp_3137_1~0, ~__tmp_2624_0~0, ~__return_2598~0, #NULL.offset, ~__tmp_3137_0~0, ~__tmp_2624_1~0, #NULL.base] {8194#true} is VALID [2022-04-27 21:35:02,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {8194#true} [406] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8194#true} is VALID [2022-04-27 21:35:02,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8194#true} {8194#true} [601] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8194#true} is VALID [2022-04-27 21:35:02,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {8194#true} [402] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8194#true} is VALID [2022-04-27 21:35:02,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {8194#true} [405] mainENTRY-->L22: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {8194#true} is VALID [2022-04-27 21:35:02,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {8194#true} [407] L22-->L26: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {8194#true} is VALID [2022-04-27 21:35:02,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {8194#true} [410] L26-->L65: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} OutVars{main_~main__t~0=v_main_~main__t~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {8194#true} is VALID [2022-04-27 21:35:02,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {8194#true} [414] L65-->L298: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_27) 1 0) v_main_~__tmp_15~0_1) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1)) InVars {main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {8194#true} is VALID [2022-04-27 21:35:02,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {8194#true} [421] L298-->L309: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~14_4 0)) (= v_main_~__tmp_16~0_1 v_main_~__VERIFIER_assert__cond~15_1) (= (ite (<= v_main_~main__t~0_28 v_main_~main__tagbuf_len~0_19) 1 0) v_main_~__tmp_16~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_28, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_1, main_~main__t~0=v_main_~main__t~0_28, main_~__tmp_16~0=v_main_~__tmp_16~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~15, main_~__tmp_16~0] {8194#true} is VALID [2022-04-27 21:35:02,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {8194#true} [429] L309-->L317: Formula: (and (= (+ v_main_~main__t~0_30 1) v_main_~main__t~0_29) (not (= v_main_~__VERIFIER_assert__cond~15_4 0)) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_30)) InVars {main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_4, main_~main__t~0=v_main_~main__t~0_30} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_4, main_~main__t~0=v_main_~main__t~0_29, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~0] {8194#true} is VALID [2022-04-27 21:35:02,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {8194#true} [434] L317-->L325: Formula: (and (not (= v_main_~main__t~0_32 v_main_~main__tagbuf_len~0_21)) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_32, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_32, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {8199#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:02,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {8199#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [438] L325-->L366: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_5 0) (= v_main_~__tmp_19~0_1 v_main_~__VERIFIER_assert__cond~18_1) (= (ite (<= 0 v_main_~main__t~0_37) 1 0) v_main_~__tmp_19~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_37, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5} OutVars{main_~main__t~0=v_main_~main__t~0_37, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__tmp_19~0=v_main_~__tmp_19~0_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_1} AuxVars[] AssignedVars[main_~__tmp_19~0, main_~__VERIFIER_assert__cond~18] {8199#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:02,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {8199#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [446] L366-->L377: Formula: (and (= v_main_~__tmp_20~0_1 v_main_~__VERIFIER_assert__cond~19_1) (not (= v_main_~__VERIFIER_assert__cond~18_4 0)) (= (ite (<= v_main_~main__t~0_38 v_main_~main__tagbuf_len~0_23) 1 0) v_main_~__tmp_20~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_38, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} OutVars{main_~main__t~0=v_main_~main__t~0_38, main_~__tmp_20~0=v_main_~__tmp_20~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} AuxVars[] AssignedVars[main_~__tmp_20~0, main_~__VERIFIER_assert__cond~19] {8200#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~19 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2022-04-27 21:35:02,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {8200#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~19 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} [458] L377-->L385: Formula: (and (= (+ v_main_~main__t~0_40 1) v_main_~main__t~0_39) (= v_main_~main____CPAchecker_TMP_1~1_1 v_main_~main__t~0_40) (not (= v_main_~__VERIFIER_assert__cond~19_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_40, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4} OutVars{main_~main__t~0=v_main_~main__t~0_39, main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_1, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~1] {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [467] L385-->L393: Formula: (and (not (= v_main_~main__t~0_42 v_main_~main__tagbuf_len~0_25)) (= v_main_~main____CPAchecker_TMP_0~2_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~main__t~0=v_main_~main__t~0_42, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_25, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~main__t~0=v_main_~main__t~0_42, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_25, main_~main____CPAchecker_TMP_0~2=v_main_~main____CPAchecker_TMP_0~2_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~2, main_#t~nondet10] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [479] L393-->L434: Formula: (and (= v_main_~__tmp_23~0_1 (ite (<= 0 v_main_~main__t~0_47) 1 0)) (= v_main_~main____CPAchecker_TMP_0~2_5 0) (= v_main_~__tmp_23~0_1 v_main_~__VERIFIER_assert__cond~22_1)) InVars {main_~main__t~0=v_main_~main__t~0_47, main_~main____CPAchecker_TMP_0~2=v_main_~main____CPAchecker_TMP_0~2_5} OutVars{main_~main__t~0=v_main_~main__t~0_47, main_~__tmp_23~0=v_main_~__tmp_23~0_1, main_~__VERIFIER_assert__cond~22=v_main_~__VERIFIER_assert__cond~22_1, main_~main____CPAchecker_TMP_0~2=v_main_~main____CPAchecker_TMP_0~2_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~22, main_~__tmp_23~0] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [493] L434-->L445: Formula: (and (= (ite (<= v_main_~main__t~0_48 v_main_~main__tagbuf_len~0_27) 1 0) v_main_~__tmp_24~0_1) (= v_main_~__tmp_24~0_1 v_main_~__VERIFIER_assert__cond~23_1) (not (= v_main_~__VERIFIER_assert__cond~22_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_48, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_27, main_~__VERIFIER_assert__cond~22=v_main_~__VERIFIER_assert__cond~22_4} OutVars{main_~main__t~0=v_main_~main__t~0_48, main_~__VERIFIER_assert__cond~23=v_main_~__VERIFIER_assert__cond~23_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_27, main_~__VERIFIER_assert__cond~22=v_main_~__VERIFIER_assert__cond~22_4, main_~__tmp_24~0=v_main_~__tmp_24~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~23, main_~__tmp_24~0] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [501] L445-->L453: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~23_4 0)) (= v_main_~main____CPAchecker_TMP_1~2_1 v_main_~main__t~0_50) (= (+ v_main_~main__t~0_50 1) v_main_~main__t~0_49)) InVars {main_~__VERIFIER_assert__cond~23=v_main_~__VERIFIER_assert__cond~23_4, main_~main__t~0=v_main_~main__t~0_50} OutVars{main_~main__t~0=v_main_~main__t~0_49, main_~main____CPAchecker_TMP_1~2=v_main_~main____CPAchecker_TMP_1~2_1, main_~__VERIFIER_assert__cond~23=v_main_~__VERIFIER_assert__cond~23_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~2] {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [507] L453-->L461: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~3_1 |v_main_#t~nondet11_2|) (not (= v_main_~main__t~0_52 v_main_~main__tagbuf_len~0_29)) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_~main__t~0=v_main_~main__t~0_52, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_29, main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~main__t~0=v_main_~main__t~0_52, main_~main____CPAchecker_TMP_0~3=v_main_~main____CPAchecker_TMP_0~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_29} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~3, main_#t~nondet11] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [511] L461-->L502: Formula: (and (= v_main_~main____CPAchecker_TMP_0~3_5 0) (= v_main_~__tmp_27~0_1 v_main_~__VERIFIER_assert__cond~26_1) (= v_main_~__tmp_27~0_1 (ite (<= 0 v_main_~main__t~0_57) 1 0))) InVars {main_~main____CPAchecker_TMP_0~3=v_main_~main____CPAchecker_TMP_0~3_5, main_~main__t~0=v_main_~main__t~0_57} OutVars{main_~main__t~0=v_main_~main__t~0_57, main_~__VERIFIER_assert__cond~26=v_main_~__VERIFIER_assert__cond~26_1, main_~main____CPAchecker_TMP_0~3=v_main_~main____CPAchecker_TMP_0~3_5, main_~__tmp_27~0=v_main_~__tmp_27~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~26, main_~__tmp_27~0] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [515] L502-->L513: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~26_4 0)) (= (ite (<= v_main_~main__t~0_58 v_main_~main__tagbuf_len~0_31) 1 0) v_main_~__tmp_28~0_1) (= v_main_~__tmp_28~0_1 v_main_~__VERIFIER_assert__cond~27_1)) InVars {main_~main__t~0=v_main_~main__t~0_58, main_~__VERIFIER_assert__cond~26=v_main_~__VERIFIER_assert__cond~26_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_31} OutVars{main_~__VERIFIER_assert__cond~27=v_main_~__VERIFIER_assert__cond~27_1, main_~main__t~0=v_main_~main__t~0_58, main_~__VERIFIER_assert__cond~26=v_main_~__VERIFIER_assert__cond~26_4, main_~__tmp_28~0=v_main_~__tmp_28~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_31} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~27, main_~__tmp_28~0] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [519] L513-->L521: Formula: (and (= v_main_~main____CPAchecker_TMP_1~3_1 v_main_~main__t~0_60) (= (+ v_main_~main__t~0_60 1) v_main_~main__t~0_59) (not (= v_main_~__VERIFIER_assert__cond~27_4 0))) InVars {main_~__VERIFIER_assert__cond~27=v_main_~__VERIFIER_assert__cond~27_4, main_~main__t~0=v_main_~main__t~0_60} OutVars{main_~__VERIFIER_assert__cond~27=v_main_~__VERIFIER_assert__cond~27_4, main_~main__t~0=v_main_~main__t~0_59, main_~main____CPAchecker_TMP_1~3=v_main_~main____CPAchecker_TMP_1~3_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~3] {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [521] L521-->L529: Formula: (and (= v_main_~main____CPAchecker_TMP_0~4_1 |v_main_#t~nondet12_2|) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647) (not (= v_main_~main__t~0_62 v_main_~main__tagbuf_len~0_33))) InVars {main_~main__t~0=v_main_~main__t~0_62, main_#t~nondet12=|v_main_#t~nondet12_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_33} OutVars{main_~main__t~0=v_main_~main__t~0_62, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_33, main_~main____CPAchecker_TMP_0~4=v_main_~main____CPAchecker_TMP_0~4_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~4, main_#t~nondet12] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [523] L529-->L570: Formula: (and (= (ite (<= 0 v_main_~main__t~0_67) 1 0) v_main_~__tmp_31~0_1) (= v_main_~__tmp_31~0_1 v_main_~__VERIFIER_assert__cond~30_1) (= v_main_~main____CPAchecker_TMP_0~4_5 0)) InVars {main_~main__t~0=v_main_~main__t~0_67, main_~main____CPAchecker_TMP_0~4=v_main_~main____CPAchecker_TMP_0~4_5} OutVars{main_~__VERIFIER_assert__cond~30=v_main_~__VERIFIER_assert__cond~30_1, main_~main__t~0=v_main_~main__t~0_67, main_~__tmp_31~0=v_main_~__tmp_31~0_1, main_~main____CPAchecker_TMP_0~4=v_main_~main____CPAchecker_TMP_0~4_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~30, main_~__tmp_31~0] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [527] L570-->L581: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~30_4 0)) (= v_main_~__tmp_32~0_1 v_main_~__VERIFIER_assert__cond~31_1) (= v_main_~__tmp_32~0_1 (ite (<= v_main_~main__t~0_68 v_main_~main__tagbuf_len~0_35) 1 0))) InVars {main_~__VERIFIER_assert__cond~30=v_main_~__VERIFIER_assert__cond~30_4, main_~main__t~0=v_main_~main__t~0_68, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_35} OutVars{main_~__VERIFIER_assert__cond~30=v_main_~__VERIFIER_assert__cond~30_4, main_~__tmp_32~0=v_main_~__tmp_32~0_1, main_~main__t~0=v_main_~main__t~0_68, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_35, main_~__VERIFIER_assert__cond~31=v_main_~__VERIFIER_assert__cond~31_1} AuxVars[] AssignedVars[main_~__tmp_32~0, main_~__VERIFIER_assert__cond~31] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [531] L581-->L589: Formula: (and (= v_main_~main____CPAchecker_TMP_1~4_1 v_main_~main__t~0_70) (not (= v_main_~__VERIFIER_assert__cond~31_4 0)) (= (+ v_main_~main__t~0_70 1) v_main_~main__t~0_69)) InVars {main_~main__t~0=v_main_~main__t~0_70, main_~__VERIFIER_assert__cond~31=v_main_~__VERIFIER_assert__cond~31_4} OutVars{main_~main____CPAchecker_TMP_1~4=v_main_~main____CPAchecker_TMP_1~4_1, main_~main__t~0=v_main_~main__t~0_69, main_~__VERIFIER_assert__cond~31=v_main_~__VERIFIER_assert__cond~31_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~4, main_~main__t~0] {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [533] L589-->L597: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~5_1 |v_main_#t~nondet13_2|) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (not (= v_main_~main__t~0_72 v_main_~main__tagbuf_len~0_37))) InVars {main_~main__t~0=v_main_~main__t~0_72, main_#t~nondet13=|v_main_#t~nondet13_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_37} OutVars{main_~main__t~0=v_main_~main__t~0_72, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_37, main_~main____CPAchecker_TMP_0~5=v_main_~main____CPAchecker_TMP_0~5_1} AuxVars[] AssignedVars[main_#t~nondet13, main_~main____CPAchecker_TMP_0~5] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [535] L597-->L638: Formula: (and (= v_main_~__tmp_35~0_1 v_main_~__VERIFIER_assert__cond~34_1) (= v_main_~main____CPAchecker_TMP_0~5_5 0) (= v_main_~__tmp_35~0_1 (ite (<= 0 v_main_~main__t~0_77) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_77, main_~main____CPAchecker_TMP_0~5=v_main_~main____CPAchecker_TMP_0~5_5} OutVars{main_~main__t~0=v_main_~main__t~0_77, main_~__tmp_35~0=v_main_~__tmp_35~0_1, main_~__VERIFIER_assert__cond~34=v_main_~__VERIFIER_assert__cond~34_1, main_~main____CPAchecker_TMP_0~5=v_main_~main____CPAchecker_TMP_0~5_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~34, main_~__tmp_35~0] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [539] L638-->L649: Formula: (and (= v_main_~__tmp_36~0_1 v_main_~__VERIFIER_assert__cond~35_1) (not (= v_main_~__VERIFIER_assert__cond~34_4 0)) (= (ite (<= v_main_~main__t~0_78 v_main_~main__tagbuf_len~0_39) 1 0) v_main_~__tmp_36~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_78, main_~__VERIFIER_assert__cond~34=v_main_~__VERIFIER_assert__cond~34_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_39} OutVars{main_~main__t~0=v_main_~main__t~0_78, main_~__tmp_36~0=v_main_~__tmp_36~0_1, main_~__VERIFIER_assert__cond~35=v_main_~__VERIFIER_assert__cond~35_1, main_~__VERIFIER_assert__cond~34=v_main_~__VERIFIER_assert__cond~34_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_39} AuxVars[] AssignedVars[main_~__tmp_36~0, main_~__VERIFIER_assert__cond~35] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [543] L649-->L657: Formula: (and (= v_main_~main____CPAchecker_TMP_1~5_1 v_main_~main__t~0_80) (= (+ v_main_~main__t~0_80 1) v_main_~main__t~0_79) (not (= v_main_~__VERIFIER_assert__cond~35_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_80, main_~__VERIFIER_assert__cond~35=v_main_~__VERIFIER_assert__cond~35_4} OutVars{main_~main__t~0=v_main_~main__t~0_79, main_~__VERIFIER_assert__cond~35=v_main_~__VERIFIER_assert__cond~35_4, main_~main____CPAchecker_TMP_1~5=v_main_~main____CPAchecker_TMP_1~5_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~5] {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [545] L657-->L665: Formula: (and (<= |v_main_#t~nondet14_2| 2147483647) (not (= v_main_~main__t~0_82 v_main_~main__tagbuf_len~0_41)) (= v_main_~main____CPAchecker_TMP_0~6_1 |v_main_#t~nondet14_2|) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_82, main_#t~nondet14=|v_main_#t~nondet14_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_41} OutVars{main_~main____CPAchecker_TMP_0~6=v_main_~main____CPAchecker_TMP_0~6_1, main_~main__t~0=v_main_~main__t~0_82, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_41} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~6, main_#t~nondet14] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [547] L665-->L706: Formula: (and (= v_main_~__tmp_39~0_1 v_main_~__VERIFIER_assert__cond~38_1) (= v_main_~main____CPAchecker_TMP_0~6_5 0) (= (ite (<= 0 v_main_~main__t~0_87) 1 0) v_main_~__tmp_39~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_87, main_~main____CPAchecker_TMP_0~6=v_main_~main____CPAchecker_TMP_0~6_5} OutVars{main_~__VERIFIER_assert__cond~38=v_main_~__VERIFIER_assert__cond~38_1, main_~main__t~0=v_main_~main__t~0_87, main_~main____CPAchecker_TMP_0~6=v_main_~main____CPAchecker_TMP_0~6_5, main_~__tmp_39~0=v_main_~__tmp_39~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~38, main_~__tmp_39~0] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [551] L706-->L717: Formula: (and (= v_main_~__tmp_40~0_1 v_main_~__VERIFIER_assert__cond~39_1) (not (= v_main_~__VERIFIER_assert__cond~38_4 0)) (= (ite (<= v_main_~main__t~0_88 v_main_~main__tagbuf_len~0_43) 1 0) v_main_~__tmp_40~0_1)) InVars {main_~__VERIFIER_assert__cond~38=v_main_~__VERIFIER_assert__cond~38_4, main_~main__t~0=v_main_~main__t~0_88, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_43} OutVars{main_~__VERIFIER_assert__cond~38=v_main_~__VERIFIER_assert__cond~38_4, main_~main__t~0=v_main_~main__t~0_88, main_~__tmp_40~0=v_main_~__tmp_40~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_43, main_~__VERIFIER_assert__cond~39=v_main_~__VERIFIER_assert__cond~39_1} AuxVars[] AssignedVars[main_~__tmp_40~0, main_~__VERIFIER_assert__cond~39] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [555] L717-->L725: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~39_4 0)) (= v_main_~main__t~0_89 (+ v_main_~main__t~0_90 1)) (= v_main_~main____CPAchecker_TMP_1~6_1 v_main_~main__t~0_90)) InVars {main_~main__t~0=v_main_~main__t~0_90, main_~__VERIFIER_assert__cond~39=v_main_~__VERIFIER_assert__cond~39_4} OutVars{main_~main__t~0=v_main_~main__t~0_89, main_~main____CPAchecker_TMP_1~6=v_main_~main____CPAchecker_TMP_1~6_1, main_~__VERIFIER_assert__cond~39=v_main_~__VERIFIER_assert__cond~39_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~6] {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [557] L725-->L733: Formula: (and (= v_main_~main____CPAchecker_TMP_0~7_1 |v_main_#t~nondet15_2|) (not (= v_main_~main__t~0_92 v_main_~main__tagbuf_len~0_45)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|, main_~main__t~0=v_main_~main__t~0_92, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_45} OutVars{main_~main____CPAchecker_TMP_0~7=v_main_~main____CPAchecker_TMP_0~7_1, main_~main__t~0=v_main_~main__t~0_92, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_45} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~7, main_#t~nondet15] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [559] L733-->L774: Formula: (and (= v_main_~main____CPAchecker_TMP_0~7_5 0) (= v_main_~__tmp_43~0_1 v_main_~__VERIFIER_assert__cond~42_1) (= (ite (<= 0 v_main_~main__t~0_97) 1 0) v_main_~__tmp_43~0_1)) InVars {main_~main____CPAchecker_TMP_0~7=v_main_~main____CPAchecker_TMP_0~7_5, main_~main__t~0=v_main_~main__t~0_97} OutVars{main_~__VERIFIER_assert__cond~42=v_main_~__VERIFIER_assert__cond~42_1, main_~main____CPAchecker_TMP_0~7=v_main_~main____CPAchecker_TMP_0~7_5, main_~main__t~0=v_main_~main__t~0_97, main_~__tmp_43~0=v_main_~__tmp_43~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~42, main_~__tmp_43~0] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [563] L774-->L785: Formula: (and (= v_main_~__tmp_44~0_1 v_main_~__VERIFIER_assert__cond~43_1) (not (= v_main_~__VERIFIER_assert__cond~42_4 0)) (= (ite (<= v_main_~main__t~0_98 v_main_~main__tagbuf_len~0_47) 1 0) v_main_~__tmp_44~0_1)) InVars {main_~__VERIFIER_assert__cond~42=v_main_~__VERIFIER_assert__cond~42_4, main_~main__t~0=v_main_~main__t~0_98, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_47} OutVars{main_~__VERIFIER_assert__cond~42=v_main_~__VERIFIER_assert__cond~42_4, main_~__VERIFIER_assert__cond~43=v_main_~__VERIFIER_assert__cond~43_1, main_~main__t~0=v_main_~main__t~0_98, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_47, main_~__tmp_44~0=v_main_~__tmp_44~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~43, main_~__tmp_44~0] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [567] L785-->L793: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~43_4 0)) (= v_main_~main____CPAchecker_TMP_1~7_1 v_main_~main__t~0_100) (= (+ v_main_~main__t~0_100 1) v_main_~main__t~0_99)) InVars {main_~main__t~0=v_main_~main__t~0_100, main_~__VERIFIER_assert__cond~43=v_main_~__VERIFIER_assert__cond~43_4} OutVars{main_~main__t~0=v_main_~main__t~0_99, main_~__VERIFIER_assert__cond~43=v_main_~__VERIFIER_assert__cond~43_4, main_~main____CPAchecker_TMP_1~7=v_main_~main____CPAchecker_TMP_1~7_1} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~7] {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [569] L793-->L801: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~8_1 |v_main_#t~nondet16_2|) (<= |v_main_#t~nondet16_2| 2147483647) (not (= v_main_~main__t~0_102 v_main_~main__tagbuf_len~0_49))) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|, main_~main__t~0=v_main_~main__t~0_102, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_49} OutVars{main_~main__t~0=v_main_~main__t~0_102, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_49} AuxVars[] AssignedVars[main_#t~nondet16, main_~main____CPAchecker_TMP_0~8] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,743 INFO L290 TraceCheckUtils]: 40: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [571] L801-->L842: Formula: (and (= v_main_~__tmp_47~0_1 v_main_~__VERIFIER_assert__cond~46_1) (= v_main_~main____CPAchecker_TMP_0~8_5 0) (= v_main_~__tmp_47~0_1 (ite (<= 0 v_main_~main__t~0_107) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_107, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_5} OutVars{main_~main__t~0=v_main_~main__t~0_107, main_~__tmp_47~0=v_main_~__tmp_47~0_1, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_5, main_~__VERIFIER_assert__cond~46=v_main_~__VERIFIER_assert__cond~46_1} AuxVars[] AssignedVars[main_~__tmp_47~0, main_~__VERIFIER_assert__cond~46] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,743 INFO L290 TraceCheckUtils]: 41: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [575] L842-->L853: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~46_4 0)) (= v_main_~__tmp_48~0_1 v_main_~__VERIFIER_assert__cond~47_1) (= (ite (<= v_main_~main__t~0_108 v_main_~main__tagbuf_len~0_51) 1 0) v_main_~__tmp_48~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_108, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_51, main_~__VERIFIER_assert__cond~46=v_main_~__VERIFIER_assert__cond~46_4} OutVars{main_~main__t~0=v_main_~main__t~0_108, main_~__tmp_48~0=v_main_~__tmp_48~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_51, main_~__VERIFIER_assert__cond~46=v_main_~__VERIFIER_assert__cond~46_4, main_~__VERIFIER_assert__cond~47=v_main_~__VERIFIER_assert__cond~47_1} AuxVars[] AssignedVars[main_~__tmp_48~0, main_~__VERIFIER_assert__cond~47] {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:02,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {8202#(< main_~main__t~0 main_~main__tagbuf_len~0)} [579] L853-->L940: Formula: (and (= v_main_~main____CPAchecker_TMP_0~8_6 v_~__tmp_3137_1~0_1) (= v_main_~main____CPAchecker_TMP_1~8_1 v_main_~main__t~0_110) (not (= v_main_~__VERIFIER_assert__cond~47_4 0)) (= v_main_~main____CPAchecker_TMP_1~8_1 v_~__tmp_3137_0~0_1) (= (+ v_main_~main__t~0_110 1) v_main_~main__t~0_109)) InVars {main_~main__t~0=v_main_~main__t~0_110, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_6, main_~__VERIFIER_assert__cond~47=v_main_~__VERIFIER_assert__cond~47_4} OutVars{main_~main__t~0=v_main_~main__t~0_109, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_6, main_~main____CPAchecker_TMP_1~8=v_main_~main____CPAchecker_TMP_1~8_1, ~__tmp_3137_1~0=v_~__tmp_3137_1~0_1, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_1, main_~__VERIFIER_assert__cond~47=v_main_~__VERIFIER_assert__cond~47_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_1~8, ~__tmp_3137_1~0, ~__tmp_3137_0~0] {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,744 INFO L290 TraceCheckUtils]: 43: Hoare triple {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [580] L940-->L866: Formula: (and (= v_main_~main____CPAchecker_TMP_0~8_7 v_~__tmp_3137_1~0_2) (= v_main_~main____CPAchecker_TMP_1~8_2 v_~__tmp_3137_0~0_2)) InVars {~__tmp_3137_1~0=v_~__tmp_3137_1~0_2, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_2} OutVars{~__tmp_3137_1~0=v_~__tmp_3137_1~0_2, main_~main____CPAchecker_TMP_0~8=v_main_~main____CPAchecker_TMP_0~8_7, ~__tmp_3137_0~0=v_~__tmp_3137_0~0_2, main_~main____CPAchecker_TMP_1~8=v_main_~main____CPAchecker_TMP_1~8_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~8, main_~main____CPAchecker_TMP_1~8] {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,744 INFO L290 TraceCheckUtils]: 44: Hoare triple {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [582] L866-->L874: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (not (= v_main_~main__t~0_112 v_main_~main__tagbuf_len~0_53)) (= v_main_~main____CPAchecker_TMP_0~9_1 |v_main_#t~nondet17_2|) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_112, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_53, main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~main__t~0=v_main_~main__t~0_112, main_~main____CPAchecker_TMP_0~9=v_main_~main____CPAchecker_TMP_0~9_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_53} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~9, main_#t~nondet17] {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,745 INFO L290 TraceCheckUtils]: 45: Hoare triple {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [584] L874-->L917: Formula: (and (= v_main_~__VERIFIER_assert__cond~50_1 v_main_~__tmp_51~0_1) (= (ite (<= 0 v_main_~main__t~0_117) 1 0) v_main_~__tmp_51~0_1) (= v_main_~main____CPAchecker_TMP_0~9_5 0)) InVars {main_~main__t~0=v_main_~main__t~0_117, main_~main____CPAchecker_TMP_0~9=v_main_~main____CPAchecker_TMP_0~9_5} OutVars{main_~__tmp_51~0=v_main_~__tmp_51~0_1, main_~main__t~0=v_main_~main__t~0_117, main_~main____CPAchecker_TMP_0~9=v_main_~main____CPAchecker_TMP_0~9_5, main_~__VERIFIER_assert__cond~50=v_main_~__VERIFIER_assert__cond~50_1} AuxVars[] AssignedVars[main_~__tmp_51~0, main_~__VERIFIER_assert__cond~50] {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 21:35:02,745 INFO L290 TraceCheckUtils]: 46: Hoare triple {8201#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} [588] L917-->L929: Formula: (and (= v_main_~__tmp_52~0_1 (ite (<= v_main_~main__t~0_118 v_main_~main__tagbuf_len~0_55) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~50_4 0)) (= v_main_~__VERIFIER_assert__cond~51_1 v_main_~__tmp_52~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_118, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_55, main_~__VERIFIER_assert__cond~50=v_main_~__VERIFIER_assert__cond~50_4} OutVars{main_~main__t~0=v_main_~main__t~0_118, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_55, main_~__VERIFIER_assert__cond~50=v_main_~__VERIFIER_assert__cond~50_4, main_~__tmp_52~0=v_main_~__tmp_52~0_1, main_~__VERIFIER_assert__cond~51=v_main_~__VERIFIER_assert__cond~51_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~51, main_~__tmp_52~0] {8203#(not (= main_~__VERIFIER_assert__cond~51 0))} is VALID [2022-04-27 21:35:02,745 INFO L290 TraceCheckUtils]: 47: Hoare triple {8203#(not (= main_~__VERIFIER_assert__cond~51 0))} [595] L929-->L931: Formula: (= v_main_~__VERIFIER_assert__cond~51_3 0) InVars {main_~__VERIFIER_assert__cond~51=v_main_~__VERIFIER_assert__cond~51_3} OutVars{main_~__VERIFIER_assert__cond~51=v_main_~__VERIFIER_assert__cond~51_3} AuxVars[] AssignedVars[] {8195#false} is VALID [2022-04-27 21:35:02,746 INFO L290 TraceCheckUtils]: 48: Hoare triple {8195#false} [599] L931-->mainErr15ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8195#false} is VALID [2022-04-27 21:35:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:35:02,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:02,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430251344] [2022-04-27 21:35:02,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430251344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:02,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:02,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 21:35:02,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727726042] [2022-04-27 21:35:02,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:02,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-27 21:35:02,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:02,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:02,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:02,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:35:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:02,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:35:02,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:35:02,785 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:03,116 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-27 21:35:03,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:35:03,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-27 21:35:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-27 21:35:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-27 21:35:03,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-27 21:35:03,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:03,171 INFO L225 Difference]: With dead ends: 54 [2022-04-27 21:35:03,171 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:35:03,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:35:03,172 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 104 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:03,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 29 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:03,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:35:03,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:35:03,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:03,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-04-27 21:35:03,173 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-04-27 21:35:03,173 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-04-27 21:35:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:03,173 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:35:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:35:03,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:03,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:03,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 0 states. [2022-04-27 21:35:03,173 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 0 states. [2022-04-27 21:35:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:03,173 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:35:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:35:03,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:03,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:03,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:03,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-04-27 21:35:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:35:03,174 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-04-27 21:35:03,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:03,174 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:35:03,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:35:03,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:03,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-04-27 21:35:03,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-04-27 21:35:03,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-04-27 21:35:03,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-04-27 21:35:03,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-04-27 21:35:03,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-04-27 21:35:03,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-04-27 21:35:03,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-04-27 21:35:03,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-04-27 21:35:03,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-04-27 21:35:03,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-04-27 21:35:03,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-04-27 21:35:03,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-04-27 21:35:03,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-04-27 21:35:03,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-04-27 21:35:03,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-04-27 21:35:03,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 21:35:03,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:35:03,568 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:35:03,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:35:03,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:35:03,569 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:35:03,569 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:35:03,570 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:35:03,570 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:35:03,570 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 17 1006) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-27 21:35:03,570 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 1005) no Hoare annotation was computed. [2022-04-27 21:35:03,570 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 1000) no Hoare annotation was computed. [2022-04-27 21:35:03,570 INFO L895 garLoopResultBuilder]: At program point L1004(lines 22 1005) the Hoare annotation is: (or (<= 0 main_~main__t~0) (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|))) [2022-04-27 21:35:03,570 INFO L895 garLoopResultBuilder]: At program point L868(lines 26 1000) the Hoare annotation is: (and (<= 0 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-27 21:35:03,570 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 999) no Hoare annotation was computed. [2022-04-27 21:35:03,570 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 17 1006) no Hoare annotation was computed. [2022-04-27 21:35:03,570 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 58) no Hoare annotation was computed. [2022-04-27 21:35:03,572 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 288) no Hoare annotation was computed. [2022-04-27 21:35:03,572 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 997) no Hoare annotation was computed. [2022-04-27 21:35:03,572 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 17 1006) no Hoare annotation was computed. [2022-04-27 21:35:03,572 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-04-27 21:35:03,572 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 56) no Hoare annotation was computed. [2022-04-27 21:35:03,572 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 286) no Hoare annotation was computed. [2022-04-27 21:35:03,572 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 995) no Hoare annotation was computed. [2022-04-27 21:35:03,572 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-04-27 21:35:03,572 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-04-27 21:35:03,573 INFO L895 garLoopResultBuilder]: At program point L904(lines 65 999) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-27 21:35:03,573 INFO L899 garLoopResultBuilder]: For program point L317(lines 317 994) no Hoare annotation was computed. [2022-04-27 21:35:03,573 INFO L899 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2022-04-27 21:35:03,573 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 285) no Hoare annotation was computed. [2022-04-27 21:35:03,573 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 993) no Hoare annotation was computed. [2022-04-27 21:35:03,573 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 125) no Hoare annotation was computed. [2022-04-27 21:35:03,574 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 284) no Hoare annotation was computed. [2022-04-27 21:35:03,574 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 356) no Hoare annotation was computed. [2022-04-27 21:35:03,574 INFO L899 garLoopResultBuilder]: For program point L366(lines 366 991) no Hoare annotation was computed. [2022-04-27 21:35:03,574 INFO L899 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-04-27 21:35:03,574 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 123) no Hoare annotation was computed. [2022-04-27 21:35:03,574 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 242) no Hoare annotation was computed. [2022-04-27 21:35:03,574 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 283) no Hoare annotation was computed. [2022-04-27 21:35:03,574 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 354) no Hoare annotation was computed. [2022-04-27 21:35:03,574 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 989) no Hoare annotation was computed. [2022-04-27 21:35:03,574 INFO L899 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2022-04-27 21:35:03,574 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-04-27 21:35:03,574 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 236) no Hoare annotation was computed. [2022-04-27 21:35:03,575 INFO L895 garLoopResultBuilder]: At program point L282(lines 132 284) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-27 21:35:03,575 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 277) no Hoare annotation was computed. [2022-04-27 21:35:03,575 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 988) no Hoare annotation was computed. [2022-04-27 21:35:03,575 INFO L899 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2022-04-27 21:35:03,575 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-04-27 21:35:03,575 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 234) no Hoare annotation was computed. [2022-04-27 21:35:03,575 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 231) no Hoare annotation was computed. [2022-04-27 21:35:03,575 INFO L899 garLoopResultBuilder]: For program point L257(line 257) no Hoare annotation was computed. [2022-04-27 21:35:03,575 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 275) no Hoare annotation was computed. [2022-04-27 21:35:03,575 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 987) no Hoare annotation was computed. [2022-04-27 21:35:03,575 INFO L899 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-04-27 21:35:03,575 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-04-27 21:35:03,576 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 233) no Hoare annotation was computed. [2022-04-27 21:35:03,576 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-04-27 21:35:03,576 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 229) no Hoare annotation was computed. [2022-04-27 21:35:03,576 INFO L899 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2022-04-27 21:35:03,576 INFO L899 garLoopResultBuilder]: For program point L269(line 269) no Hoare annotation was computed. [2022-04-27 21:35:03,576 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 424) no Hoare annotation was computed. [2022-04-27 21:35:03,576 INFO L899 garLoopResultBuilder]: For program point L434(lines 434 985) no Hoare annotation was computed. [2022-04-27 21:35:03,576 INFO L899 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-04-27 21:35:03,576 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 193) no Hoare annotation was computed. [2022-04-27 21:35:03,576 INFO L899 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2022-04-27 21:35:03,576 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-04-27 21:35:03,576 INFO L899 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 269) no Hoare annotation was computed. [2022-04-27 21:35:03,577 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 422) no Hoare annotation was computed. [2022-04-27 21:35:03,577 INFO L899 garLoopResultBuilder]: For program point L445(lines 445 983) no Hoare annotation was computed. [2022-04-27 21:35:03,577 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-04-27 21:35:03,577 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 191) no Hoare annotation was computed. [2022-04-27 21:35:03,578 INFO L899 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2022-04-27 21:35:03,578 INFO L899 garLoopResultBuilder]: For program point L453(lines 453 982) no Hoare annotation was computed. [2022-04-27 21:35:03,578 INFO L899 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2022-04-27 21:35:03,578 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-04-27 21:35:03,578 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 981) no Hoare annotation was computed. [2022-04-27 21:35:03,578 INFO L899 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2022-04-27 21:35:03,578 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 492) no Hoare annotation was computed. [2022-04-27 21:35:03,578 INFO L899 garLoopResultBuilder]: For program point L502(lines 502 979) no Hoare annotation was computed. [2022-04-27 21:35:03,578 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 490) no Hoare annotation was computed. [2022-04-27 21:35:03,578 INFO L899 garLoopResultBuilder]: For program point L513(lines 513 977) no Hoare annotation was computed. [2022-04-27 21:35:03,578 INFO L899 garLoopResultBuilder]: For program point L521(lines 521 976) no Hoare annotation was computed. [2022-04-27 21:35:03,579 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 975) no Hoare annotation was computed. [2022-04-27 21:35:03,579 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 560) no Hoare annotation was computed. [2022-04-27 21:35:03,579 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 973) no Hoare annotation was computed. [2022-04-27 21:35:03,579 INFO L899 garLoopResultBuilder]: For program point L547(lines 547 558) no Hoare annotation was computed. [2022-04-27 21:35:03,579 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 971) no Hoare annotation was computed. [2022-04-27 21:35:03,579 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 970) no Hoare annotation was computed. [2022-04-27 21:35:03,579 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 969) no Hoare annotation was computed. [2022-04-27 21:35:03,579 INFO L899 garLoopResultBuilder]: For program point L604(lines 604 628) no Hoare annotation was computed. [2022-04-27 21:35:03,579 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 967) no Hoare annotation was computed. [2022-04-27 21:35:03,579 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 626) no Hoare annotation was computed. [2022-04-27 21:35:03,579 INFO L899 garLoopResultBuilder]: For program point L649(lines 649 965) no Hoare annotation was computed. [2022-04-27 21:35:03,579 INFO L899 garLoopResultBuilder]: For program point L657(lines 657 964) no Hoare annotation was computed. [2022-04-27 21:35:03,579 INFO L899 garLoopResultBuilder]: For program point L665(lines 665 963) no Hoare annotation was computed. [2022-04-27 21:35:03,580 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 696) no Hoare annotation was computed. [2022-04-27 21:35:03,580 INFO L899 garLoopResultBuilder]: For program point L706(lines 706 961) no Hoare annotation was computed. [2022-04-27 21:35:03,580 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 694) no Hoare annotation was computed. [2022-04-27 21:35:03,580 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 959) no Hoare annotation was computed. [2022-04-27 21:35:03,580 INFO L899 garLoopResultBuilder]: For program point L725(lines 725 958) no Hoare annotation was computed. [2022-04-27 21:35:03,580 INFO L899 garLoopResultBuilder]: For program point L733(lines 733 957) no Hoare annotation was computed. [2022-04-27 21:35:03,580 INFO L899 garLoopResultBuilder]: For program point L740(lines 740 764) no Hoare annotation was computed. [2022-04-27 21:35:03,580 INFO L899 garLoopResultBuilder]: For program point L774(lines 774 955) no Hoare annotation was computed. [2022-04-27 21:35:03,580 INFO L899 garLoopResultBuilder]: For program point L751(lines 751 762) no Hoare annotation was computed. [2022-04-27 21:35:03,580 INFO L899 garLoopResultBuilder]: For program point L785(lines 785 953) no Hoare annotation was computed. [2022-04-27 21:35:03,580 INFO L899 garLoopResultBuilder]: For program point L793(lines 793 952) no Hoare annotation was computed. [2022-04-27 21:35:03,580 INFO L899 garLoopResultBuilder]: For program point L801(lines 801 951) no Hoare annotation was computed. [2022-04-27 21:35:03,580 INFO L899 garLoopResultBuilder]: For program point L808(lines 808 832) no Hoare annotation was computed. [2022-04-27 21:35:03,580 INFO L899 garLoopResultBuilder]: For program point L842(lines 842 949) no Hoare annotation was computed. [2022-04-27 21:35:03,580 INFO L899 garLoopResultBuilder]: For program point L819(lines 819 830) no Hoare annotation was computed. [2022-04-27 21:35:03,581 INFO L899 garLoopResultBuilder]: For program point L853(lines 853 947) no Hoare annotation was computed. [2022-04-27 21:35:03,581 INFO L895 garLoopResultBuilder]: At program point L940(lines 858 947) the Hoare annotation is: (and (<= 9 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-27 21:35:03,581 INFO L899 garLoopResultBuilder]: For program point L866(lines 866 946) no Hoare annotation was computed. [2022-04-27 21:35:03,581 INFO L899 garLoopResultBuilder]: For program point L874(lines 874 945) no Hoare annotation was computed. [2022-04-27 21:35:03,581 INFO L899 garLoopResultBuilder]: For program point L881(lines 881 907) no Hoare annotation was computed. [2022-04-27 21:35:03,581 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 943) no Hoare annotation was computed. [2022-04-27 21:35:03,581 INFO L899 garLoopResultBuilder]: For program point L883(line 883) no Hoare annotation was computed. [2022-04-27 21:35:03,581 INFO L899 garLoopResultBuilder]: For program point L893(lines 893 905) no Hoare annotation was computed. [2022-04-27 21:35:03,582 INFO L899 garLoopResultBuilder]: For program point L919(line 919) no Hoare annotation was computed. [2022-04-27 21:35:03,582 INFO L899 garLoopResultBuilder]: For program point L929(lines 929 941) no Hoare annotation was computed. [2022-04-27 21:35:03,582 INFO L899 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 883) no Hoare annotation was computed. [2022-04-27 21:35:03,582 INFO L899 garLoopResultBuilder]: For program point L895(line 895) no Hoare annotation was computed. [2022-04-27 21:35:03,582 INFO L899 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 919) no Hoare annotation was computed. [2022-04-27 21:35:03,582 INFO L899 garLoopResultBuilder]: For program point L931(line 931) no Hoare annotation was computed. [2022-04-27 21:35:03,582 INFO L899 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 895) no Hoare annotation was computed. [2022-04-27 21:35:03,582 INFO L899 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 931) no Hoare annotation was computed. [2022-04-27 21:35:03,585 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:03,588 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:35:03,593 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:35:03,594 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 21:35:03,594 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:35:03,594 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 21:35:03,594 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 21:35:03,594 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:35:03,594 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 21:35:03,594 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 21:35:03,594 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:35:03,594 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 21:35:03,594 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L298 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L298 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L309 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L309 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 21:35:03,595 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L317 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L317 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L325 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L325 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-04-27 21:35:03,596 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L343 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L343 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L377 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L377 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L205 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-04-27 21:35:03,597 WARN L170 areAnnotationChecker]: L205 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L205 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L257 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L257 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L267 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L267 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L393 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L393 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L217 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L217 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L269 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L269 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L400 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L400 has no Hoare annotation [2022-04-27 21:35:03,598 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L219 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L219 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L411 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L411 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L445 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L445 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L453 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L453 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L461 has no Hoare annotation [2022-04-27 21:35:03,599 WARN L170 areAnnotationChecker]: L461 has no Hoare annotation [2022-04-27 21:35:03,600 WARN L170 areAnnotationChecker]: L468 has no Hoare annotation [2022-04-27 21:35:03,600 WARN L170 areAnnotationChecker]: L468 has no Hoare annotation [2022-04-27 21:35:03,600 WARN L170 areAnnotationChecker]: L502 has no Hoare annotation [2022-04-27 21:35:03,600 WARN L170 areAnnotationChecker]: L502 has no Hoare annotation [2022-04-27 21:35:03,600 WARN L170 areAnnotationChecker]: L479 has no Hoare annotation [2022-04-27 21:35:03,600 WARN L170 areAnnotationChecker]: L479 has no Hoare annotation [2022-04-27 21:35:03,600 WARN L170 areAnnotationChecker]: L513 has no Hoare annotation [2022-04-27 21:35:03,600 WARN L170 areAnnotationChecker]: L513 has no Hoare annotation [2022-04-27 21:35:03,600 WARN L170 areAnnotationChecker]: L521 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L521 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L529 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L529 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L536 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L536 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L570 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L570 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L547 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L547 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L604 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L604 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L638 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L638 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L615 has no Hoare annotation [2022-04-27 21:35:03,601 WARN L170 areAnnotationChecker]: L615 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L649 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L649 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L657 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L657 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L665 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L665 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L672 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L672 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L706 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L706 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L683 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L683 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L717 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L717 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L725 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L725 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L733 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L733 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L740 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L740 has no Hoare annotation [2022-04-27 21:35:03,602 WARN L170 areAnnotationChecker]: L774 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L774 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L751 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L751 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L785 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L785 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L793 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L793 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L801 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L801 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L808 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L808 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L842 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L842 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L819 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L819 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L853 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L853 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L866 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L866 has no Hoare annotation [2022-04-27 21:35:03,603 WARN L170 areAnnotationChecker]: L866 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L881 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L881 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L917 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L917 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L883 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L883 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L893 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L893 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L931 has no Hoare annotation [2022-04-27 21:35:03,604 WARN L170 areAnnotationChecker]: L931 has no Hoare annotation [2022-04-27 21:35:03,604 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:35:03,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:35:03 BasicIcfg [2022-04-27 21:35:03,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:35:03,625 INFO L158 Benchmark]: Toolchain (without parser) took 18017.99ms. Allocated memory was 197.1MB in the beginning and 318.8MB in the end (delta: 121.6MB). Free memory was 148.4MB in the beginning and 202.0MB in the end (delta: -53.6MB). Peak memory consumption was 67.3MB. Max. memory is 8.0GB. [2022-04-27 21:35:03,626 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 197.1MB. Free memory was 165.0MB in the beginning and 164.9MB in the end (delta: 150.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:35:03,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.60ms. Allocated memory is still 197.1MB. Free memory was 148.2MB in the beginning and 161.4MB in the end (delta: -13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 21:35:03,626 INFO L158 Benchmark]: Boogie Preprocessor took 75.92ms. Allocated memory is still 197.1MB. Free memory was 161.4MB in the beginning and 158.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 21:35:03,626 INFO L158 Benchmark]: RCFGBuilder took 738.50ms. Allocated memory is still 197.1MB. Free memory was 158.7MB in the beginning and 128.3MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-04-27 21:35:03,626 INFO L158 Benchmark]: IcfgTransformer took 117.47ms. Allocated memory is still 197.1MB. Free memory was 128.3MB in the beginning and 122.7MB in the end (delta: 5.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-04-27 21:35:03,627 INFO L158 Benchmark]: TraceAbstraction took 16700.65ms. Allocated memory was 197.1MB in the beginning and 318.8MB in the end (delta: 121.6MB). Free memory was 122.4MB in the beginning and 202.0MB in the end (delta: -79.6MB). Peak memory consumption was 43.1MB. Max. memory is 8.0GB. [2022-04-27 21:35:03,629 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.12ms. Allocated memory is still 197.1MB. Free memory was 165.0MB in the beginning and 164.9MB in the end (delta: 150.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 357.60ms. Allocated memory is still 197.1MB. Free memory was 148.2MB in the beginning and 161.4MB in the end (delta: -13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 75.92ms. Allocated memory is still 197.1MB. Free memory was 161.4MB in the beginning and 158.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 738.50ms. Allocated memory is still 197.1MB. Free memory was 158.7MB in the beginning and 128.3MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * IcfgTransformer took 117.47ms. Allocated memory is still 197.1MB. Free memory was 128.3MB in the beginning and 122.7MB in the end (delta: 5.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 16700.65ms. Allocated memory was 197.1MB in the beginning and 318.8MB in the end (delta: 121.6MB). Free memory was 122.4MB in the beginning and 202.0MB in the end (delta: -79.6MB). Peak memory consumption was 43.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 105]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 117]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 207]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 269]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 219]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 173]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 185]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 883]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 919]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 895]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 931]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 125 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2461 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2461 mSDsluCounter, 2392 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1309 mSDsCounter, 448 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5085 IncrementalHoareTripleChecker+Invalid, 5533 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 448 mSolverCounterUnsat, 1083 mSDtfsCounter, 5085 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 142 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 15 NumberOfFragments, 92 HoareAnnotationTreeSize, 9 FomulaSimplifications, 4665 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 249 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 443 ConstructedInterpolants, 0 QuantifiedInterpolants, 1724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 858]: Loop Invariant Derived loop invariant: 9 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 0 <= main__t || ((((__tmp_3137_1 == \old(__tmp_3137_1) && __tmp_2624_1 == \old(__tmp_2624_1)) && __tmp_3137_0 == \old(__tmp_3137_0)) && \old(__return_2598) == __return_2598) && __tmp_2624_0 == \old(__tmp_2624_0)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 1 <= main__t - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len RESULT: Ultimate proved your program to be correct! [2022-04-27 21:35:03,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...