/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:45:42,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:45:42,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:45:42,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:45:42,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:45:42,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:45:42,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:45:42,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:45:42,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:45:42,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:45:42,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:45:42,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:45:42,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:45:42,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:45:42,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:45:42,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:45:42,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:45:42,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:45:42,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:45:42,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:45:42,694 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:45:42,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:45:42,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:45:42,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:45:42,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:45:42,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:45:42,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:45:42,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:45:42,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:45:42,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:45:42,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:45:42,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:45:42,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:45:42,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:45:42,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:45:42,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:45:42,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:45:42,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:45:42,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:45:42,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:45:42,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:45:42,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:45:42,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:45:42,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:45:42,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:45:42,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:45:42,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:45:42,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:45:42,734 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:45:42,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:45:42,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:45:42,735 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:45:42,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:45:42,736 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:45:42,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:45:42,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:45:42,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:45:42,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:45:42,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:45:42,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:45:42,736 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:45:42,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:45:42,736 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:45:42,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:45:42,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:45:42,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:45:42,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:45:42,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:45:42,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:45:42,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:45:42,737 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:45:42,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:45:42,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:45:42,737 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:45:42,738 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:45:42,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:45:42,738 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 10:45:42,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:45:42,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:45:42,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:45:42,925 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:45:42,926 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:45:42,926 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+nlh-reducer.c [2022-04-27 10:45:42,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6228d4398/f3e4365ac67e45be9aeb79f57233d4f8/FLAG6b1b4816b [2022-04-27 10:45:43,358 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:45:43,358 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2022-04-27 10:45:43,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6228d4398/f3e4365ac67e45be9aeb79f57233d4f8/FLAG6b1b4816b [2022-04-27 10:45:43,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6228d4398/f3e4365ac67e45be9aeb79f57233d4f8 [2022-04-27 10:45:43,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:45:43,749 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:45:43,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:45:43,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:45:43,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:45:43,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:45:43" (1/1) ... [2022-04-27 10:45:43,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0a8094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:43, skipping insertion in model container [2022-04-27 10:45:43,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:45:43" (1/1) ... [2022-04-27 10:45:43,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:45:43,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:45:43,942 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+nlh-reducer.c[901,914] [2022-04-27 10:45:43,945 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+nlh-reducer.c[1116,1129] [2022-04-27 10:45:43,947 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+nlh-reducer.c[1625,1638] [2022-04-27 10:45:43,948 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+nlh-reducer.c[1840,1853] [2022-04-27 10:45:43,950 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+nlh-reducer.c[2157,2170] [2022-04-27 10:45:43,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+nlh-reducer.c[2372,2385] [2022-04-27 10:45:43,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+nlh-reducer.c[2867,2880] [2022-04-27 10:45:43,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+nlh-reducer.c[3082,3095] [2022-04-27 10:45:43,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+nlh-reducer.c[3384,3397] [2022-04-27 10:45:43,956 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+nlh-reducer.c[3602,3615] [2022-04-27 10:45:43,957 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+nlh-reducer.c[3878,3891] [2022-04-27 10:45:43,958 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+nlh-reducer.c[4096,4109] [2022-04-27 10:45:43,960 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+nlh-reducer.c[4582,4595] [2022-04-27 10:45:43,961 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+nlh-reducer.c[4800,4813] [2022-04-27 10:45:44,122 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+nlh-reducer.c[47686,47699] [2022-04-27 10:45:44,125 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+nlh-reducer.c[47907,47920] [2022-04-27 10:45:44,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:45:44,143 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:45:44,163 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+nlh-reducer.c[901,914] [2022-04-27 10:45:44,164 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+nlh-reducer.c[1116,1129] [2022-04-27 10:45:44,165 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+nlh-reducer.c[1625,1638] [2022-04-27 10:45:44,165 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+nlh-reducer.c[1840,1853] [2022-04-27 10:45:44,166 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+nlh-reducer.c[2157,2170] [2022-04-27 10:45:44,166 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+nlh-reducer.c[2372,2385] [2022-04-27 10:45:44,167 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+nlh-reducer.c[2867,2880] [2022-04-27 10:45:44,168 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+nlh-reducer.c[3082,3095] [2022-04-27 10:45:44,168 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+nlh-reducer.c[3384,3397] [2022-04-27 10:45:44,169 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+nlh-reducer.c[3602,3615] [2022-04-27 10:45:44,170 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+nlh-reducer.c[3878,3891] [2022-04-27 10:45:44,170 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+nlh-reducer.c[4096,4109] [2022-04-27 10:45:44,171 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+nlh-reducer.c[4582,4595] [2022-04-27 10:45:44,172 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+nlh-reducer.c[4800,4813] [2022-04-27 10:45:44,307 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+nlh-reducer.c[47686,47699] [2022-04-27 10:45:44,310 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+nlh-reducer.c[47907,47920] [2022-04-27 10:45:44,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:45:44,326 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:45:44,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:44 WrapperNode [2022-04-27 10:45:44,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:45:44,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:45:44,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:45:44,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:45:44,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:44" (1/1) ... [2022-04-27 10:45:44,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:44" (1/1) ... [2022-04-27 10:45:44,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:44" (1/1) ... [2022-04-27 10:45:44,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:44" (1/1) ... [2022-04-27 10:45:44,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:44" (1/1) ... [2022-04-27 10:45:44,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:44" (1/1) ... [2022-04-27 10:45:44,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:44" (1/1) ... [2022-04-27 10:45:44,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:45:44,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:45:44,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:45:44,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:45:44,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:44" (1/1) ... [2022-04-27 10:45:44,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:45:44,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:45:44,438 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 10:45:44,444 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 10:45:44,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:45:44,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:45:44,465 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:45:44,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:45:44,465 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:45:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:45:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:45:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:45:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:45:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:45:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:45:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:45:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:45:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:45:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:45:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:45:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:45:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:45:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:45:44,641 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:45:44,642 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:45:45,469 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:45:45,475 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:45:45,475 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 10:45:45,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:45:45 BoogieIcfgContainer [2022-04-27 10:45:45,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:45:45,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:45:45,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:45:45,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:45:45,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:45:43" (1/3) ... [2022-04-27 10:45:45,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420c146b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:45:45, skipping insertion in model container [2022-04-27 10:45:45,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:44" (2/3) ... [2022-04-27 10:45:45,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420c146b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:45:45, skipping insertion in model container [2022-04-27 10:45:45,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:45:45" (3/3) ... [2022-04-27 10:45:45,495 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2022-04-27 10:45:45,517 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:45:45,517 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-04-27 10:45:45,571 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:45:45,575 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=PETRI_NET, 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@2d0fe91d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@11af9c3 [2022-04-27 10:45:45,575 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-04-27 10:45:45,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 288 states have (on average 1.9652777777777777) internal successors, (566), 304 states have internal predecessors, (566), 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 10:45:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:45:45,590 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:45,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:45,591 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 10:45:45,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:45,595 INFO L85 PathProgramCache]: Analyzing trace with hash -191009829, now seen corresponding path program 1 times [2022-04-27 10:45:45,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:45,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381805712] [2022-04-27 10:45:45,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:45,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:45,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:45,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {319#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {312#true} is VALID [2022-04-27 10:45:45,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume true; {312#true} is VALID [2022-04-27 10:45:45,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {312#true} {312#true} #1237#return; {312#true} is VALID [2022-04-27 10:45:45,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {312#true} call ULTIMATE.init(); {319#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:45,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {312#true} is VALID [2022-04-27 10:45:45,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume true; {312#true} is VALID [2022-04-27 10:45:45,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {312#true} {312#true} #1237#return; {312#true} is VALID [2022-04-27 10:45:45,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {312#true} call #t~ret69 := main(); {312#true} is VALID [2022-04-27 10:45:45,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {312#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {312#true} is VALID [2022-04-27 10:45:45,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {317#(<= 0 main_~main__t~0)} is VALID [2022-04-27 10:45:45,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {317#(<= 0 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {317#(<= 0 main_~main__t~0)} is VALID [2022-04-27 10:45:45,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {317#(<= 0 main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {318#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 10:45:45,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {318#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {313#false} is VALID [2022-04-27 10:45:45,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-04-27 10:45:45,796 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 10:45:45,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:45,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381805712] [2022-04-27 10:45:45,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381805712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:45,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:45,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:45:45,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636373772] [2022-04-27 10:45:45,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:45,802 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 10:45:45,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:45,805 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 10:45:45,840 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 10:45:45,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:45:45,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:45,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:45:45,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:45:45,858 INFO L87 Difference]: Start difference. First operand has 309 states, 288 states have (on average 1.9652777777777777) internal successors, (566), 304 states have internal predecessors, (566), 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 10:45:47,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:47,707 INFO L93 Difference]: Finished difference Result 327 states and 589 transitions. [2022-04-27 10:45:47,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:47,708 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 10:45:47,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:47,709 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 10:45:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 589 transitions. [2022-04-27 10:45:47,719 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 10:45:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 589 transitions. [2022-04-27 10:45:47,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 589 transitions. [2022-04-27 10:45:48,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:48,201 INFO L225 Difference]: With dead ends: 327 [2022-04-27 10:45:48,201 INFO L226 Difference]: Without dead ends: 307 [2022-04-27 10:45:48,203 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 10:45:48,205 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 862 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:48,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 179 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 10:45:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-27 10:45:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 302. [2022-04-27 10:45:48,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:48,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 302 states, 284 states have (on average 1.4859154929577465) internal successors, (422), 298 states have internal predecessors, (422), 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 10:45:48,237 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 302 states, 284 states have (on average 1.4859154929577465) internal successors, (422), 298 states have internal predecessors, (422), 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 10:45:48,238 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 302 states, 284 states have (on average 1.4859154929577465) internal successors, (422), 298 states have internal predecessors, (422), 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 10:45:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:48,247 INFO L93 Difference]: Finished difference Result 307 states and 429 transitions. [2022-04-27 10:45:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 429 transitions. [2022-04-27 10:45:48,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:48,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:48,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 302 states, 284 states have (on average 1.4859154929577465) internal successors, (422), 298 states have internal predecessors, (422), 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 307 states. [2022-04-27 10:45:48,250 INFO L87 Difference]: Start difference. First operand has 302 states, 284 states have (on average 1.4859154929577465) internal successors, (422), 298 states have internal predecessors, (422), 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 307 states. [2022-04-27 10:45:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:48,259 INFO L93 Difference]: Finished difference Result 307 states and 429 transitions. [2022-04-27 10:45:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 429 transitions. [2022-04-27 10:45:48,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:48,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:48,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:48,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 284 states have (on average 1.4859154929577465) internal successors, (422), 298 states have internal predecessors, (422), 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 10:45:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2022-04-27 10:45:48,269 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 11 [2022-04-27 10:45:48,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:48,270 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2022-04-27 10:45:48,270 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 10:45:48,270 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2022-04-27 10:45:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:45:48,270 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:48,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:48,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:45:48,271 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 10:45:48,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:48,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1626334337, now seen corresponding path program 1 times [2022-04-27 10:45:48,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:48,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83057063] [2022-04-27 10:45:48,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:48,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:48,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:48,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {1602#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {1594#true} is VALID [2022-04-27 10:45:48,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {1594#true} assume true; {1594#true} is VALID [2022-04-27 10:45:48,363 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1594#true} {1594#true} #1237#return; {1594#true} is VALID [2022-04-27 10:45:48,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {1594#true} call ULTIMATE.init(); {1602#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:48,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {1602#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {1594#true} is VALID [2022-04-27 10:45:48,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {1594#true} assume true; {1594#true} is VALID [2022-04-27 10:45:48,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1594#true} {1594#true} #1237#return; {1594#true} is VALID [2022-04-27 10:45:48,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {1594#true} call #t~ret69 := main(); {1594#true} is VALID [2022-04-27 10:45:48,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {1594#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {1594#true} is VALID [2022-04-27 10:45:48,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {1594#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1599#(or (= main_~main__t~0 0) (<= main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2022-04-27 10:45:48,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {1599#(or (= main_~main__t~0 0) (<= main_~main__t~0 main_~main__tagbuf_len~0))} assume ~main__t~0 == ~main__tagbuf_len~0; {1600#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {1600#(<= main_~main__t~0 main_~main__tagbuf_len~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1600#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {1600#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1601#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-27 10:45:48,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {1601#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {1595#false} is VALID [2022-04-27 10:45:48,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {1595#false} assume !false; {1595#false} is VALID [2022-04-27 10:45:48,366 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 10:45:48,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:48,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83057063] [2022-04-27 10:45:48,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83057063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:48,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:48,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:48,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310371592] [2022-04-27 10:45:48,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:48,368 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 10:45:48,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:48,368 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 10:45:48,375 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 10:45:48,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:48,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:48,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:48,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:48,376 INFO L87 Difference]: Start difference. First operand 302 states and 425 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 10:45:50,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:50,090 INFO L93 Difference]: Finished difference Result 312 states and 435 transitions. [2022-04-27 10:45:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:50,090 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 10:45:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:50,091 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 10:45:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 435 transitions. [2022-04-27 10:45:50,095 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 10:45:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 435 transitions. [2022-04-27 10:45:50,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 435 transitions. [2022-04-27 10:45:50,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 435 edges. 435 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:50,429 INFO L225 Difference]: With dead ends: 312 [2022-04-27 10:45:50,429 INFO L226 Difference]: Without dead ends: 304 [2022-04-27 10:45:50,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:45:50,430 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 325 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:50,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 531 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 10:45:50,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-04-27 10:45:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2022-04-27 10:45:50,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:50,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 304 states. Second operand has 297 states, 280 states have (on average 1.275) internal successors, (357), 293 states have internal predecessors, (357), 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 10:45:50,456 INFO L74 IsIncluded]: Start isIncluded. First operand 304 states. Second operand has 297 states, 280 states have (on average 1.275) internal successors, (357), 293 states have internal predecessors, (357), 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 10:45:50,457 INFO L87 Difference]: Start difference. First operand 304 states. Second operand has 297 states, 280 states have (on average 1.275) internal successors, (357), 293 states have internal predecessors, (357), 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 10:45:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:50,463 INFO L93 Difference]: Finished difference Result 304 states and 367 transitions. [2022-04-27 10:45:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 367 transitions. [2022-04-27 10:45:50,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:50,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:50,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 280 states have (on average 1.275) internal successors, (357), 293 states have internal predecessors, (357), 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 304 states. [2022-04-27 10:45:50,465 INFO L87 Difference]: Start difference. First operand has 297 states, 280 states have (on average 1.275) internal successors, (357), 293 states have internal predecessors, (357), 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 304 states. [2022-04-27 10:45:50,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:50,471 INFO L93 Difference]: Finished difference Result 304 states and 367 transitions. [2022-04-27 10:45:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 367 transitions. [2022-04-27 10:45:50,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:50,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:50,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:50,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:50,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 280 states have (on average 1.275) internal successors, (357), 293 states have internal predecessors, (357), 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 10:45:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2022-04-27 10:45:50,479 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2022-04-27 10:45:50,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:50,479 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2022-04-27 10:45:50,479 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 10:45:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2022-04-27 10:45:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:45:50,479 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:50,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:50,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:45:50,480 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 10:45:50,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:50,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1610084340, now seen corresponding path program 1 times [2022-04-27 10:45:50,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:50,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51736711] [2022-04-27 10:45:50,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:50,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:50,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:50,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {2854#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {2847#true} is VALID [2022-04-27 10:45:50,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-27 10:45:50,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2847#true} {2847#true} #1237#return; {2847#true} is VALID [2022-04-27 10:45:50,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {2847#true} call ULTIMATE.init(); {2854#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:50,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {2854#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {2847#true} is VALID [2022-04-27 10:45:50,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-27 10:45:50,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2847#true} {2847#true} #1237#return; {2847#true} is VALID [2022-04-27 10:45:50,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {2847#true} call #t~ret69 := main(); {2847#true} is VALID [2022-04-27 10:45:50,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {2847#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {2847#true} is VALID [2022-04-27 10:45:50,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {2847#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2852#(<= 0 main_~main__t~0)} is VALID [2022-04-27 10:45:50,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {2852#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {2852#(<= 0 main_~main__t~0)} is VALID [2022-04-27 10:45:50,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {2852#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {2852#(<= 0 main_~main__t~0)} is VALID [2022-04-27 10:45:50,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {2852#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2853#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-27 10:45:50,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {2853#(not (= main_~__VERIFIER_assert__cond~2 0))} assume 0 == ~__VERIFIER_assert__cond~2; {2848#false} is VALID [2022-04-27 10:45:50,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {2848#false} assume !false; {2848#false} is VALID [2022-04-27 10:45:50,538 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 10:45:50,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:50,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51736711] [2022-04-27 10:45:50,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51736711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:50,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:50,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:45:50,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716761892] [2022-04-27 10:45:50,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:50,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 10:45:50,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:50,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 10:45:50,546 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 10:45:50,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:45:50,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:50,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:45:50,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:45:50,546 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 10:45:51,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:51,696 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2022-04-27 10:45:51,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:45:51,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 10:45:51,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 10:45:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 360 transitions. [2022-04-27 10:45:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 10:45:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 360 transitions. [2022-04-27 10:45:51,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 360 transitions. [2022-04-27 10:45:51,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 360 edges. 360 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:51,982 INFO L225 Difference]: With dead ends: 297 [2022-04-27 10:45:51,982 INFO L226 Difference]: Without dead ends: 295 [2022-04-27 10:45:51,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 10:45:51,983 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 505 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:51,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 118 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 10:45:51,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-04-27 10:45:52,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-04-27 10:45:52,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:52,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand has 295 states, 279 states have (on average 1.2724014336917562) internal successors, (355), 291 states have internal predecessors, (355), 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 10:45:52,004 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand has 295 states, 279 states have (on average 1.2724014336917562) internal successors, (355), 291 states have internal predecessors, (355), 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 10:45:52,004 INFO L87 Difference]: Start difference. First operand 295 states. Second operand has 295 states, 279 states have (on average 1.2724014336917562) internal successors, (355), 291 states have internal predecessors, (355), 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 10:45:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:52,010 INFO L93 Difference]: Finished difference Result 295 states and 358 transitions. [2022-04-27 10:45:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2022-04-27 10:45:52,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:52,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:52,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 279 states have (on average 1.2724014336917562) internal successors, (355), 291 states have internal predecessors, (355), 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 295 states. [2022-04-27 10:45:52,012 INFO L87 Difference]: Start difference. First operand has 295 states, 279 states have (on average 1.2724014336917562) internal successors, (355), 291 states have internal predecessors, (355), 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 295 states. [2022-04-27 10:45:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:52,018 INFO L93 Difference]: Finished difference Result 295 states and 358 transitions. [2022-04-27 10:45:52,018 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2022-04-27 10:45:52,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:52,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:52,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:52,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 279 states have (on average 1.2724014336917562) internal successors, (355), 291 states have internal predecessors, (355), 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 10:45:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2022-04-27 10:45:52,026 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 12 [2022-04-27 10:45:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:52,026 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2022-04-27 10:45:52,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 10:45:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2022-04-27 10:45:52,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:45:52,027 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:52,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:52,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:45:52,027 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 10:45:52,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:52,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1626996098, now seen corresponding path program 1 times [2022-04-27 10:45:52,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:52,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082214567] [2022-04-27 10:45:52,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:52,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:52,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:52,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {4066#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {4059#true} is VALID [2022-04-27 10:45:52,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {4059#true} assume true; {4059#true} is VALID [2022-04-27 10:45:52,076 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4059#true} {4059#true} #1237#return; {4059#true} is VALID [2022-04-27 10:45:52,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {4059#true} call ULTIMATE.init(); {4066#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:52,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {4066#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {4059#true} is VALID [2022-04-27 10:45:52,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {4059#true} assume true; {4059#true} is VALID [2022-04-27 10:45:52,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4059#true} {4059#true} #1237#return; {4059#true} is VALID [2022-04-27 10:45:52,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {4059#true} call #t~ret69 := main(); {4059#true} is VALID [2022-04-27 10:45:52,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {4059#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {4059#true} is VALID [2022-04-27 10:45:52,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {4059#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4064#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 10:45:52,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {4064#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {4064#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 10:45:52,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {4064#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {4064#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 10:45:52,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {4064#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4064#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 10:45:52,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {4064#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4065#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-27 10:45:52,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {4065#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {4060#false} is VALID [2022-04-27 10:45:52,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {4060#false} assume !false; {4060#false} is VALID [2022-04-27 10:45:52,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 10:45:52,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:52,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082214567] [2022-04-27 10:45:52,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082214567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:52,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:52,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:45:52,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713426301] [2022-04-27 10:45:52,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:52,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 13 [2022-04-27 10:45:52,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:52,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 10:45:52,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:52,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:45:52,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:52,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:45:52,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:45:52,091 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 10:45:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:53,163 INFO L93 Difference]: Finished difference Result 300 states and 363 transitions. [2022-04-27 10:45:53,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:53,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 13 [2022-04-27 10:45:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 10:45:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 363 transitions. [2022-04-27 10:45:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 10:45:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 363 transitions. [2022-04-27 10:45:53,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 363 transitions. [2022-04-27 10:45:53,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:53,440 INFO L225 Difference]: With dead ends: 300 [2022-04-27 10:45:53,440 INFO L226 Difference]: Without dead ends: 298 [2022-04-27 10:45:53,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 10:45:53,441 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 279 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:53,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 406 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:45:53,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-04-27 10:45:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-04-27 10:45:53,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:53,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 298 states. Second operand has 298 states, 282 states have (on average 1.2695035460992907) internal successors, (358), 294 states have internal predecessors, (358), 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 10:45:53,462 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states. Second operand has 298 states, 282 states have (on average 1.2695035460992907) internal successors, (358), 294 states have internal predecessors, (358), 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 10:45:53,462 INFO L87 Difference]: Start difference. First operand 298 states. Second operand has 298 states, 282 states have (on average 1.2695035460992907) internal successors, (358), 294 states have internal predecessors, (358), 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 10:45:53,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:53,472 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2022-04-27 10:45:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2022-04-27 10:45:53,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:53,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:53,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 298 states, 282 states have (on average 1.2695035460992907) internal successors, (358), 294 states have internal predecessors, (358), 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 298 states. [2022-04-27 10:45:53,473 INFO L87 Difference]: Start difference. First operand has 298 states, 282 states have (on average 1.2695035460992907) internal successors, (358), 294 states have internal predecessors, (358), 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 298 states. [2022-04-27 10:45:53,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:53,478 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2022-04-27 10:45:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2022-04-27 10:45:53,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:53,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:53,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:53,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2695035460992907) internal successors, (358), 294 states have internal predecessors, (358), 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 10:45:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2022-04-27 10:45:53,483 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 13 [2022-04-27 10:45:53,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:53,483 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2022-04-27 10:45:53,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 10:45:53,483 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2022-04-27 10:45:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:45:53,483 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:53,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:53,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:45:53,484 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 10:45:53,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:53,484 INFO L85 PathProgramCache]: Analyzing trace with hash 175251398, now seen corresponding path program 1 times [2022-04-27 10:45:53,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:53,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46775535] [2022-04-27 10:45:53,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:53,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:53,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:53,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {5293#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {5285#true} is VALID [2022-04-27 10:45:53,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {5285#true} assume true; {5285#true} is VALID [2022-04-27 10:45:53,527 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5285#true} {5285#true} #1237#return; {5285#true} is VALID [2022-04-27 10:45:53,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {5285#true} call ULTIMATE.init(); {5293#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:53,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {5293#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {5285#true} is VALID [2022-04-27 10:45:53,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {5285#true} assume true; {5285#true} is VALID [2022-04-27 10:45:53,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5285#true} {5285#true} #1237#return; {5285#true} is VALID [2022-04-27 10:45:53,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {5285#true} call #t~ret69 := main(); {5285#true} is VALID [2022-04-27 10:45:53,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {5285#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {5285#true} is VALID [2022-04-27 10:45:53,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {5285#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5290#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:53,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {5290#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {5290#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:53,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {5290#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {5290#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:53,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {5290#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5290#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:53,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {5290#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5290#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:53,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {5290#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5291#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:53,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {5291#(<= 1 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5292#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-27 10:45:53,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {5292#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {5286#false} is VALID [2022-04-27 10:45:53,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {5286#false} assume !false; {5286#false} is VALID [2022-04-27 10:45:53,534 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 10:45:53,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:53,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46775535] [2022-04-27 10:45:53,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46775535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:53,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:53,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:53,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025972877] [2022-04-27 10:45:53,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:53,534 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 10:45:53,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:53,535 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 10:45:53,543 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 10:45:53,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:53,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:53,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:53,544 INFO L87 Difference]: Start difference. First operand 298 states and 361 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 10:45:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:54,996 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2022-04-27 10:45:54,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:45:54,996 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 10:45:54,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:54,996 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 10:45:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 361 transitions. [2022-04-27 10:45:54,998 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 10:45:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 361 transitions. [2022-04-27 10:45:55,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 361 transitions. [2022-04-27 10:45:55,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 361 edges. 361 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:55,264 INFO L225 Difference]: With dead ends: 298 [2022-04-27 10:45:55,264 INFO L226 Difference]: Without dead ends: 296 [2022-04-27 10:45:55,265 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 10:45:55,266 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 467 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:55,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 173 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 10:45:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-04-27 10:45:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-04-27 10:45:55,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:55,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 296 states. Second operand has 296 states, 281 states have (on average 1.2669039145907472) internal successors, (356), 292 states have internal predecessors, (356), 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 10:45:55,280 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand has 296 states, 281 states have (on average 1.2669039145907472) internal successors, (356), 292 states have internal predecessors, (356), 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 10:45:55,280 INFO L87 Difference]: Start difference. First operand 296 states. Second operand has 296 states, 281 states have (on average 1.2669039145907472) internal successors, (356), 292 states have internal predecessors, (356), 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 10:45:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:55,285 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2022-04-27 10:45:55,285 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2022-04-27 10:45:55,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:55,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:55,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 296 states, 281 states have (on average 1.2669039145907472) internal successors, (356), 292 states have internal predecessors, (356), 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 296 states. [2022-04-27 10:45:55,286 INFO L87 Difference]: Start difference. First operand has 296 states, 281 states have (on average 1.2669039145907472) internal successors, (356), 292 states have internal predecessors, (356), 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 296 states. [2022-04-27 10:45:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:55,292 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2022-04-27 10:45:55,292 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2022-04-27 10:45:55,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:55,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:55,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:55,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2669039145907472) internal successors, (356), 292 states have internal predecessors, (356), 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 10:45:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2022-04-27 10:45:55,299 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 15 [2022-04-27 10:45:55,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:55,301 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2022-04-27 10:45:55,302 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 10:45:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2022-04-27 10:45:55,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:45:55,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:55,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:55,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:45:55,303 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:55,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:55,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1137829144, now seen corresponding path program 1 times [2022-04-27 10:45:55,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:55,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832802216] [2022-04-27 10:45:55,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:55,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:55,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:55,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {6513#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {6506#true} is VALID [2022-04-27 10:45:55,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {6506#true} assume true; {6506#true} is VALID [2022-04-27 10:45:55,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6506#true} {6506#true} #1237#return; {6506#true} is VALID [2022-04-27 10:45:55,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {6506#true} call ULTIMATE.init(); {6513#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:55,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {6513#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {6506#true} is VALID [2022-04-27 10:45:55,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {6506#true} assume true; {6506#true} is VALID [2022-04-27 10:45:55,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6506#true} {6506#true} #1237#return; {6506#true} is VALID [2022-04-27 10:45:55,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {6506#true} call #t~ret69 := main(); {6506#true} is VALID [2022-04-27 10:45:55,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {6506#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {6506#true} is VALID [2022-04-27 10:45:55,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {6506#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6506#true} is VALID [2022-04-27 10:45:55,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {6506#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {6506#true} is VALID [2022-04-27 10:45:55,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {6506#true} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {6506#true} is VALID [2022-04-27 10:45:55,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {6506#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6506#true} is VALID [2022-04-27 10:45:55,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {6506#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6506#true} is VALID [2022-04-27 10:45:55,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {6506#true} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {6506#true} is VALID [2022-04-27 10:45:55,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {6506#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6511#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:55,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {6511#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6512#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-27 10:45:55,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {6512#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {6507#false} is VALID [2022-04-27 10:45:55,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {6507#false} assume !false; {6507#false} is VALID [2022-04-27 10:45:55,367 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 10:45:55,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:55,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832802216] [2022-04-27 10:45:55,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832802216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:55,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:55,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:45:55,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111079780] [2022-04-27 10:45:55,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:55,368 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 10:45:55,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:55,368 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 10:45:55,376 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 10:45:55,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:45:55,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:55,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:45:55,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:45:55,378 INFO L87 Difference]: Start difference. First operand 296 states and 359 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 10:45:56,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:56,422 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2022-04-27 10:45:56,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:45:56,422 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 10:45:56,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:56,422 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 10:45:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 359 transitions. [2022-04-27 10:45:56,424 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 10:45:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 359 transitions. [2022-04-27 10:45:56,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 359 transitions. [2022-04-27 10:45:56,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 359 edges. 359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:56,686 INFO L225 Difference]: With dead ends: 296 [2022-04-27 10:45:56,686 INFO L226 Difference]: Without dead ends: 292 [2022-04-27 10:45:56,687 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 10:45:56,687 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 250 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:56,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 425 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:45:56,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-27 10:45:56,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-04-27 10:45:56,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:56,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 292 states. Second operand has 292 states, 278 states have (on average 1.2661870503597121) internal successors, (352), 288 states have internal predecessors, (352), 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 10:45:56,698 INFO L74 IsIncluded]: Start isIncluded. First operand 292 states. Second operand has 292 states, 278 states have (on average 1.2661870503597121) internal successors, (352), 288 states have internal predecessors, (352), 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 10:45:56,698 INFO L87 Difference]: Start difference. First operand 292 states. Second operand has 292 states, 278 states have (on average 1.2661870503597121) internal successors, (352), 288 states have internal predecessors, (352), 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 10:45:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:56,702 INFO L93 Difference]: Finished difference Result 292 states and 355 transitions. [2022-04-27 10:45:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2022-04-27 10:45:56,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:56,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:56,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 278 states have (on average 1.2661870503597121) internal successors, (352), 288 states have internal predecessors, (352), 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 292 states. [2022-04-27 10:45:56,703 INFO L87 Difference]: Start difference. First operand has 292 states, 278 states have (on average 1.2661870503597121) internal successors, (352), 288 states have internal predecessors, (352), 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 292 states. [2022-04-27 10:45:56,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:56,707 INFO L93 Difference]: Finished difference Result 292 states and 355 transitions. [2022-04-27 10:45:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2022-04-27 10:45:56,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:56,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:56,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:56,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 278 states have (on average 1.2661870503597121) internal successors, (352), 288 states have internal predecessors, (352), 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 10:45:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2022-04-27 10:45:56,712 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 16 [2022-04-27 10:45:56,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:56,712 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2022-04-27 10:45:56,713 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 10:45:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2022-04-27 10:45:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:45:56,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:56,713 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 10:45:56,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 10:45:56,713 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:56,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:56,714 INFO L85 PathProgramCache]: Analyzing trace with hash 926233143, now seen corresponding path program 1 times [2022-04-27 10:45:56,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:56,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132749871] [2022-04-27 10:45:56,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:56,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:56,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:56,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {7719#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {7711#true} is VALID [2022-04-27 10:45:56,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {7711#true} assume true; {7711#true} is VALID [2022-04-27 10:45:56,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7711#true} {7711#true} #1237#return; {7711#true} is VALID [2022-04-27 10:45:56,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {7711#true} call ULTIMATE.init(); {7719#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:56,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {7719#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {7711#true} is VALID [2022-04-27 10:45:56,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {7711#true} assume true; {7711#true} is VALID [2022-04-27 10:45:56,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7711#true} {7711#true} #1237#return; {7711#true} is VALID [2022-04-27 10:45:56,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {7711#true} call #t~ret69 := main(); {7711#true} is VALID [2022-04-27 10:45:56,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {7711#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {7711#true} is VALID [2022-04-27 10:45:56,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {7711#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7716#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:56,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {7716#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {7716#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:56,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {7716#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {7716#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:56,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {7716#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7716#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:56,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {7716#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7716#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:56,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {7716#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {7717#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:56,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {7717#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {7717#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:56,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {7717#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {7717#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:56,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {7717#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7718#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-27 10:45:56,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {7718#(not (= main_~__VERIFIER_assert__cond~6 0))} assume 0 == ~__VERIFIER_assert__cond~6; {7712#false} is VALID [2022-04-27 10:45:56,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {7712#false} assume !false; {7712#false} is VALID [2022-04-27 10:45:56,781 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 10:45:56,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:56,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132749871] [2022-04-27 10:45:56,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132749871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:56,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:56,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:56,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827113806] [2022-04-27 10:45:56,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:56,782 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 10:45:56,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:56,783 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 10:45:56,791 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 10:45:56,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:56,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:56,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:56,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:56,792 INFO L87 Difference]: Start difference. First operand 292 states and 355 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 10:45:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:58,309 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-04-27 10:45:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:45:58,309 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 10:45:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:58,309 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 10:45:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 374 transitions. [2022-04-27 10:45:58,311 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 10:45:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 374 transitions. [2022-04-27 10:45:58,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 374 transitions. [2022-04-27 10:45:58,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:58,616 INFO L225 Difference]: With dead ends: 309 [2022-04-27 10:45:58,616 INFO L226 Difference]: Without dead ends: 307 [2022-04-27 10:45:58,616 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 10:45:58,617 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 483 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:58,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 181 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 10:45:58,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-27 10:45:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 290. [2022-04-27 10:45:58,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:58,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 290 states, 277 states have (on average 1.263537906137184) internal successors, (350), 286 states have internal predecessors, (350), 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 10:45:58,635 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 290 states, 277 states have (on average 1.263537906137184) internal successors, (350), 286 states have internal predecessors, (350), 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 10:45:58,635 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 290 states, 277 states have (on average 1.263537906137184) internal successors, (350), 286 states have internal predecessors, (350), 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 10:45:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:58,639 INFO L93 Difference]: Finished difference Result 307 states and 372 transitions. [2022-04-27 10:45:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 372 transitions. [2022-04-27 10:45:58,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:58,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:58,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 290 states, 277 states have (on average 1.263537906137184) internal successors, (350), 286 states have internal predecessors, (350), 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 307 states. [2022-04-27 10:45:58,641 INFO L87 Difference]: Start difference. First operand has 290 states, 277 states have (on average 1.263537906137184) internal successors, (350), 286 states have internal predecessors, (350), 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 307 states. [2022-04-27 10:45:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:58,644 INFO L93 Difference]: Finished difference Result 307 states and 372 transitions. [2022-04-27 10:45:58,644 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 372 transitions. [2022-04-27 10:45:58,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:58,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:58,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:58,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 277 states have (on average 1.263537906137184) internal successors, (350), 286 states have internal predecessors, (350), 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 10:45:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 353 transitions. [2022-04-27 10:45:58,649 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 353 transitions. Word has length 17 [2022-04-27 10:45:58,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:58,649 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 353 transitions. [2022-04-27 10:45:58,649 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 10:45:58,649 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 353 transitions. [2022-04-27 10:45:58,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:45:58,649 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:58,649 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 10:45:58,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 10:45:58,650 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:58,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:58,650 INFO L85 PathProgramCache]: Analyzing trace with hash 927772343, now seen corresponding path program 1 times [2022-04-27 10:45:58,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:58,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970085636] [2022-04-27 10:45:58,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:58,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:58,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:58,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {8969#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {8961#true} is VALID [2022-04-27 10:45:58,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {8961#true} assume true; {8961#true} is VALID [2022-04-27 10:45:58,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8961#true} {8961#true} #1237#return; {8961#true} is VALID [2022-04-27 10:45:58,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {8961#true} call ULTIMATE.init(); {8969#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:58,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {8969#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {8961#true} is VALID [2022-04-27 10:45:58,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {8961#true} assume true; {8961#true} is VALID [2022-04-27 10:45:58,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8961#true} {8961#true} #1237#return; {8961#true} is VALID [2022-04-27 10:45:58,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {8961#true} call #t~ret69 := main(); {8961#true} is VALID [2022-04-27 10:45:58,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {8961#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {8961#true} is VALID [2022-04-27 10:45:58,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {8961#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {8966#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:58,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {8966#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {8966#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:58,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {8966#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {8966#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:58,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {8966#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8966#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:58,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {8966#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8966#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:58,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {8966#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8967#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:58,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {8967#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {8967#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:58,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {8967#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet8;havoc #t~nondet8; {8967#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:58,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {8967#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8968#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-27 10:45:58,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {8968#(not (= main_~__VERIFIER_assert__cond~12 0))} assume 0 == ~__VERIFIER_assert__cond~12; {8962#false} is VALID [2022-04-27 10:45:58,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {8962#false} assume !false; {8962#false} is VALID [2022-04-27 10:45:58,701 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 10:45:58,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:58,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970085636] [2022-04-27 10:45:58,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970085636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:58,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:58,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:58,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647128115] [2022-04-27 10:45:58,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:58,702 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 10:45:58,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:58,702 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 10:45:58,711 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 10:45:58,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:58,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:58,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:58,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:58,712 INFO L87 Difference]: Start difference. First operand 290 states and 353 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 10:46:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:00,138 INFO L93 Difference]: Finished difference Result 290 states and 353 transitions. [2022-04-27 10:46:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:46:00,138 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 10:46:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:00,138 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 10:46:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 353 transitions. [2022-04-27 10:46:00,140 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 10:46:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 353 transitions. [2022-04-27 10:46:00,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 353 transitions. [2022-04-27 10:46:00,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:00,413 INFO L225 Difference]: With dead ends: 290 [2022-04-27 10:46:00,413 INFO L226 Difference]: Without dead ends: 288 [2022-04-27 10:46:00,413 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 10:46:00,413 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 457 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:00,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 155 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 10:46:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-04-27 10:46:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-04-27 10:46:00,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:00,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 288 states. Second operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 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 10:46:00,435 INFO L74 IsIncluded]: Start isIncluded. First operand 288 states. Second operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 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 10:46:00,436 INFO L87 Difference]: Start difference. First operand 288 states. Second operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 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 10:46:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:00,440 INFO L93 Difference]: Finished difference Result 288 states and 351 transitions. [2022-04-27 10:46:00,440 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-04-27 10:46:00,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:00,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:00,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 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 288 states. [2022-04-27 10:46:00,441 INFO L87 Difference]: Start difference. First operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 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 288 states. [2022-04-27 10:46:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:00,444 INFO L93 Difference]: Finished difference Result 288 states and 351 transitions. [2022-04-27 10:46:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-04-27 10:46:00,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:00,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:00,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:00,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:00,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 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 10:46:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2022-04-27 10:46:00,449 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 17 [2022-04-27 10:46:00,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:00,449 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2022-04-27 10:46:00,449 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 10:46:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-04-27 10:46:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:46:00,449 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:00,450 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 10:46:00,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 10:46:00,450 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:46:00,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1470973679, now seen corresponding path program 1 times [2022-04-27 10:46:00,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:00,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788211800] [2022-04-27 10:46:00,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:00,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:00,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:00,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {10159#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {10150#true} is VALID [2022-04-27 10:46:00,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {10150#true} assume true; {10150#true} is VALID [2022-04-27 10:46:00,559 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10150#true} {10150#true} #1237#return; {10150#true} is VALID [2022-04-27 10:46:00,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {10150#true} call ULTIMATE.init(); {10159#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:00,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {10159#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {10150#true} is VALID [2022-04-27 10:46:00,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {10150#true} assume true; {10150#true} is VALID [2022-04-27 10:46:00,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10150#true} {10150#true} #1237#return; {10150#true} is VALID [2022-04-27 10:46:00,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {10150#true} call #t~ret69 := main(); {10150#true} is VALID [2022-04-27 10:46:00,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {10150#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {10150#true} is VALID [2022-04-27 10:46:00,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {10150#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {10155#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 10:46:00,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {10155#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {10156#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:00,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {10156#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {10156#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:00,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {10156#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {10156#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:00,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {10156#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10157#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:00,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {10157#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {10157#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:00,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {10157#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~1; {10157#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:00,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {10157#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {10157#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:00,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {10157#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {10158#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-27 10:46:00,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {10158#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {10151#false} is VALID [2022-04-27 10:46:00,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {10151#false} assume !false; {10151#false} is VALID [2022-04-27 10:46:00,577 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 10:46:00,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:00,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788211800] [2022-04-27 10:46:00,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788211800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:00,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:00,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:00,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074541575] [2022-04-27 10:46:00,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:00,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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 10:46:00,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:00,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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 10:46:00,588 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 10:46:00,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:00,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:00,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:00,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:00,589 INFO L87 Difference]: Start difference. First operand 288 states and 351 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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 10:46:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:02,079 INFO L93 Difference]: Finished difference Result 312 states and 377 transitions. [2022-04-27 10:46:02,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 10:46:02,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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 10:46:02,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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 10:46:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 377 transitions. [2022-04-27 10:46:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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 10:46:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 377 transitions. [2022-04-27 10:46:02,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 377 transitions. [2022-04-27 10:46:02,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 377 edges. 377 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:02,347 INFO L225 Difference]: With dead ends: 312 [2022-04-27 10:46:02,347 INFO L226 Difference]: Without dead ends: 310 [2022-04-27 10:46:02,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:46:02,348 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 316 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:02,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 416 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 10:46:02,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-04-27 10:46:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 288. [2022-04-27 10:46:02,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:02,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 310 states. Second operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 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 10:46:02,369 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 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 10:46:02,369 INFO L87 Difference]: Start difference. First operand 310 states. Second operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 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 10:46:02,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:02,373 INFO L93 Difference]: Finished difference Result 310 states and 375 transitions. [2022-04-27 10:46:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 375 transitions. [2022-04-27 10:46:02,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:02,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:02,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 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 310 states. [2022-04-27 10:46:02,374 INFO L87 Difference]: Start difference. First operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 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 310 states. [2022-04-27 10:46:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:02,378 INFO L93 Difference]: Finished difference Result 310 states and 375 transitions. [2022-04-27 10:46:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 375 transitions. [2022-04-27 10:46:02,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:02,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:02,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:02,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:02,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 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 10:46:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2022-04-27 10:46:02,382 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 17 [2022-04-27 10:46:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:02,382 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2022-04-27 10:46:02,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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 10:46:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-04-27 10:46:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:46:02,383 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:02,383 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 10:46:02,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 10:46:02,383 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:46:02,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:02,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1350175097, now seen corresponding path program 1 times [2022-04-27 10:46:02,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:02,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512638078] [2022-04-27 10:46:02,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:02,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:02,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:02,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {11421#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {11413#true} is VALID [2022-04-27 10:46:02,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {11413#true} assume true; {11413#true} is VALID [2022-04-27 10:46:02,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11413#true} {11413#true} #1237#return; {11413#true} is VALID [2022-04-27 10:46:02,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {11413#true} call ULTIMATE.init(); {11421#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:02,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {11421#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {11413#true} is VALID [2022-04-27 10:46:02,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {11413#true} assume true; {11413#true} is VALID [2022-04-27 10:46:02,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11413#true} {11413#true} #1237#return; {11413#true} is VALID [2022-04-27 10:46:02,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {11413#true} call #t~ret69 := main(); {11413#true} is VALID [2022-04-27 10:46:02,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {11413#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {11413#true} is VALID [2022-04-27 10:46:02,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {11413#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {11418#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:02,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {11418#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {11418#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:02,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {11418#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {11418#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:02,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {11418#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {11418#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:02,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {11418#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {11418#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:02,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {11418#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11419#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:02,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {11419#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {11419#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:02,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {11419#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {11419#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:02,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {11419#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_4~0); {11419#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:02,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {11419#(<= 1 main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {11420#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-27 10:46:02,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {11420#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {11414#false} is VALID [2022-04-27 10:46:02,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {11414#false} assume !false; {11414#false} is VALID [2022-04-27 10:46:02,425 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 10:46:02,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:02,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512638078] [2022-04-27 10:46:02,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512638078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:02,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:02,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:46:02,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622785501] [2022-04-27 10:46:02,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:02,425 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 10:46:02,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:02,426 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 10:46:02,434 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 10:46:02,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:46:02,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:02,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:46:02,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:46:02,435 INFO L87 Difference]: Start difference. First operand 288 states and 351 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 10:46:03,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:03,925 INFO L93 Difference]: Finished difference Result 311 states and 376 transitions. [2022-04-27 10:46:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:46:03,925 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 10:46:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:03,925 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 10:46:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 373 transitions. [2022-04-27 10:46:03,927 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 10:46:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 373 transitions. [2022-04-27 10:46:03,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 373 transitions. [2022-04-27 10:46:04,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 373 edges. 373 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:04,222 INFO L225 Difference]: With dead ends: 311 [2022-04-27 10:46:04,222 INFO L226 Difference]: Without dead ends: 309 [2022-04-27 10:46:04,223 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 10:46:04,224 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 474 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:04,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 173 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 10:46:04,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-27 10:46:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 286. [2022-04-27 10:46:04,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:04,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 286 states, 275 states have (on average 1.2581818181818183) internal successors, (346), 282 states have internal predecessors, (346), 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 10:46:04,244 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 286 states, 275 states have (on average 1.2581818181818183) internal successors, (346), 282 states have internal predecessors, (346), 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 10:46:04,244 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 286 states, 275 states have (on average 1.2581818181818183) internal successors, (346), 282 states have internal predecessors, (346), 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 10:46:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:04,248 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-04-27 10:46:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 374 transitions. [2022-04-27 10:46:04,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:04,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:04,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 286 states, 275 states have (on average 1.2581818181818183) internal successors, (346), 282 states have internal predecessors, (346), 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 309 states. [2022-04-27 10:46:04,249 INFO L87 Difference]: Start difference. First operand has 286 states, 275 states have (on average 1.2581818181818183) internal successors, (346), 282 states have internal predecessors, (346), 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 309 states. [2022-04-27 10:46:04,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:04,253 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-04-27 10:46:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 374 transitions. [2022-04-27 10:46:04,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:04,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:04,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:04,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 275 states have (on average 1.2581818181818183) internal successors, (346), 282 states have internal predecessors, (346), 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 10:46:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 349 transitions. [2022-04-27 10:46:04,257 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 349 transitions. Word has length 18 [2022-04-27 10:46:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:04,257 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 349 transitions. [2022-04-27 10:46:04,257 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 10:46:04,257 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 349 transitions. [2022-04-27 10:46:04,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:46:04,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:04,258 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 10:46:04,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 10:46:04,258 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:46:04,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1351540517, now seen corresponding path program 1 times [2022-04-27 10:46:04,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:04,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523636056] [2022-04-27 10:46:04,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:04,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:04,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {12675#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {12666#true} is VALID [2022-04-27 10:46:04,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {12666#true} assume true; {12666#true} is VALID [2022-04-27 10:46:04,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12666#true} {12666#true} #1237#return; {12666#true} is VALID [2022-04-27 10:46:04,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {12666#true} call ULTIMATE.init(); {12675#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:04,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {12675#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {12666#true} is VALID [2022-04-27 10:46:04,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {12666#true} assume true; {12666#true} is VALID [2022-04-27 10:46:04,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12666#true} {12666#true} #1237#return; {12666#true} is VALID [2022-04-27 10:46:04,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {12666#true} call #t~ret69 := main(); {12666#true} is VALID [2022-04-27 10:46:04,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {12666#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {12666#true} is VALID [2022-04-27 10:46:04,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {12666#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {12671#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 10:46:04,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {12671#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {12672#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:04,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {12672#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {12672#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:04,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {12672#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {12672#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:04,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {12672#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {12672#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:04,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {12672#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {12673#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:04,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {12673#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {12673#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:04,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {12673#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {12673#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:04,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {12673#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {12673#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:04,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {12673#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {12674#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-27 10:46:04,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {12674#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {12667#false} is VALID [2022-04-27 10:46:04,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {12667#false} assume !false; {12667#false} is VALID [2022-04-27 10:46:04,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 10:46:04,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:04,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523636056] [2022-04-27 10:46:04,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523636056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:04,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:04,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:04,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103831418] [2022-04-27 10:46:04,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:04,343 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 10:46:04,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:04,344 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 10:46:04,354 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 10:46:04,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:04,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:04,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:04,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:04,355 INFO L87 Difference]: Start difference. First operand 286 states and 349 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 10:46:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:05,871 INFO L93 Difference]: Finished difference Result 320 states and 387 transitions. [2022-04-27 10:46:05,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:46:05,871 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 10:46:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:05,872 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 10:46:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 387 transitions. [2022-04-27 10:46:05,873 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 10:46:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 387 transitions. [2022-04-27 10:46:05,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 387 transitions. [2022-04-27 10:46:06,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:06,148 INFO L225 Difference]: With dead ends: 320 [2022-04-27 10:46:06,148 INFO L226 Difference]: Without dead ends: 318 [2022-04-27 10:46:06,149 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 10:46:06,149 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 290 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:06,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 438 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 10:46:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-04-27 10:46:06,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 294. [2022-04-27 10:46:06,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:06,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 318 states. Second operand has 294 states, 283 states have (on average 1.2579505300353357) internal successors, (356), 290 states have internal predecessors, (356), 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 10:46:06,175 INFO L74 IsIncluded]: Start isIncluded. First operand 318 states. Second operand has 294 states, 283 states have (on average 1.2579505300353357) internal successors, (356), 290 states have internal predecessors, (356), 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 10:46:06,175 INFO L87 Difference]: Start difference. First operand 318 states. Second operand has 294 states, 283 states have (on average 1.2579505300353357) internal successors, (356), 290 states have internal predecessors, (356), 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 10:46:06,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:06,179 INFO L93 Difference]: Finished difference Result 318 states and 385 transitions. [2022-04-27 10:46:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 385 transitions. [2022-04-27 10:46:06,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:06,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:06,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 283 states have (on average 1.2579505300353357) internal successors, (356), 290 states have internal predecessors, (356), 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 318 states. [2022-04-27 10:46:06,180 INFO L87 Difference]: Start difference. First operand has 294 states, 283 states have (on average 1.2579505300353357) internal successors, (356), 290 states have internal predecessors, (356), 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 318 states. [2022-04-27 10:46:06,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:06,185 INFO L93 Difference]: Finished difference Result 318 states and 385 transitions. [2022-04-27 10:46:06,185 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 385 transitions. [2022-04-27 10:46:06,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:06,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:06,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:06,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 283 states have (on average 1.2579505300353357) internal successors, (356), 290 states have internal predecessors, (356), 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 10:46:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 359 transitions. [2022-04-27 10:46:06,190 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 359 transitions. Word has length 18 [2022-04-27 10:46:06,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:06,191 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 359 transitions. [2022-04-27 10:46:06,191 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 10:46:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 359 transitions. [2022-04-27 10:46:06,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:46:06,191 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:06,191 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 10:46:06,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 10:46:06,192 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:46:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:06,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1303825267, now seen corresponding path program 1 times [2022-04-27 10:46:06,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:06,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65711634] [2022-04-27 10:46:06,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:06,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:06,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:06,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {13970#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {13961#true} is VALID [2022-04-27 10:46:06,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {13961#true} assume true; {13961#true} is VALID [2022-04-27 10:46:06,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13961#true} {13961#true} #1237#return; {13961#true} is VALID [2022-04-27 10:46:06,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {13961#true} call ULTIMATE.init(); {13970#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:06,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {13970#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {13961#true} is VALID [2022-04-27 10:46:06,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {13961#true} assume true; {13961#true} is VALID [2022-04-27 10:46:06,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13961#true} {13961#true} #1237#return; {13961#true} is VALID [2022-04-27 10:46:06,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {13961#true} call #t~ret69 := main(); {13961#true} is VALID [2022-04-27 10:46:06,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {13961#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {13961#true} is VALID [2022-04-27 10:46:06,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {13961#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {13966#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 10:46:06,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {13966#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {13967#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:06,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {13967#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {13967#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:06,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {13967#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {13967#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:06,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {13967#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {13967#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:06,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {13967#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {13968#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:06,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {13968#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {13968#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:06,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {13968#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet8;havoc #t~nondet8; {13968#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:06,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {13968#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {13968#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:06,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {13968#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {13969#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-27 10:46:06,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {13969#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {13962#false} is VALID [2022-04-27 10:46:06,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {13962#false} assume !false; {13962#false} is VALID [2022-04-27 10:46:06,273 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 10:46:06,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:06,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65711634] [2022-04-27 10:46:06,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65711634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:06,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:06,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:06,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225139726] [2022-04-27 10:46:06,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:06,273 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 10:46:06,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:06,274 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 10:46:06,283 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 10:46:06,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:06,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:06,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:06,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:06,284 INFO L87 Difference]: Start difference. First operand 294 states and 359 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 10:46:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:07,790 INFO L93 Difference]: Finished difference Result 304 states and 369 transitions. [2022-04-27 10:46:07,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:46:07,790 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 10:46:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:07,790 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 10:46:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 369 transitions. [2022-04-27 10:46:07,792 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 10:46:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 369 transitions. [2022-04-27 10:46:07,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 369 transitions. [2022-04-27 10:46:08,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 369 edges. 369 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:08,042 INFO L225 Difference]: With dead ends: 304 [2022-04-27 10:46:08,042 INFO L226 Difference]: Without dead ends: 300 [2022-04-27 10:46:08,042 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 10:46:08,042 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 264 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:08,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 421 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 10:46:08,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-04-27 10:46:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 295. [2022-04-27 10:46:08,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:08,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 300 states. Second operand has 295 states, 284 states have (on average 1.2570422535211268) internal successors, (357), 291 states have internal predecessors, (357), 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 10:46:08,066 INFO L74 IsIncluded]: Start isIncluded. First operand 300 states. Second operand has 295 states, 284 states have (on average 1.2570422535211268) internal successors, (357), 291 states have internal predecessors, (357), 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 10:46:08,067 INFO L87 Difference]: Start difference. First operand 300 states. Second operand has 295 states, 284 states have (on average 1.2570422535211268) internal successors, (357), 291 states have internal predecessors, (357), 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 10:46:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:08,070 INFO L93 Difference]: Finished difference Result 300 states and 365 transitions. [2022-04-27 10:46:08,070 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 365 transitions. [2022-04-27 10:46:08,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:08,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:08,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 284 states have (on average 1.2570422535211268) internal successors, (357), 291 states have internal predecessors, (357), 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 300 states. [2022-04-27 10:46:08,074 INFO L87 Difference]: Start difference. First operand has 295 states, 284 states have (on average 1.2570422535211268) internal successors, (357), 291 states have internal predecessors, (357), 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 300 states. [2022-04-27 10:46:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:08,077 INFO L93 Difference]: Finished difference Result 300 states and 365 transitions. [2022-04-27 10:46:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 365 transitions. [2022-04-27 10:46:08,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:08,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:08,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:08,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 284 states have (on average 1.2570422535211268) internal successors, (357), 291 states have internal predecessors, (357), 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 10:46:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 360 transitions. [2022-04-27 10:46:08,081 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 360 transitions. Word has length 18 [2022-04-27 10:46:08,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:08,081 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 360 transitions. [2022-04-27 10:46:08,082 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 10:46:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 360 transitions. [2022-04-27 10:46:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:46:08,082 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:08,082 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 10:46:08,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 10:46:08,082 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:46:08,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:08,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1094248106, now seen corresponding path program 1 times [2022-04-27 10:46:08,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:08,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283280439] [2022-04-27 10:46:08,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:08,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:08,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:08,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {15212#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {15203#true} is VALID [2022-04-27 10:46:08,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {15203#true} assume true; {15203#true} is VALID [2022-04-27 10:46:08,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15203#true} {15203#true} #1237#return; {15203#true} is VALID [2022-04-27 10:46:08,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {15203#true} call ULTIMATE.init(); {15212#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:08,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {15212#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {15203#true} is VALID [2022-04-27 10:46:08,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {15203#true} assume true; {15203#true} is VALID [2022-04-27 10:46:08,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15203#true} {15203#true} #1237#return; {15203#true} is VALID [2022-04-27 10:46:08,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {15203#true} call #t~ret69 := main(); {15203#true} is VALID [2022-04-27 10:46:08,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {15203#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {15203#true} is VALID [2022-04-27 10:46:08,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {15203#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {15208#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 10:46:08,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {15208#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {15209#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:08,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {15209#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {15209#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:08,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {15209#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {15209#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:08,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {15209#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {15209#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:08,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {15209#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {15210#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:08,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {15210#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {15210#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:08,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {15210#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {15210#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:08,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {15210#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_4~0); {15210#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:08,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {15210#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {15210#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:08,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {15210#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {15211#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 10:46:08,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {15211#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {15204#false} is VALID [2022-04-27 10:46:08,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {15204#false} assume !false; {15204#false} is VALID [2022-04-27 10:46:08,178 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 10:46:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:08,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283280439] [2022-04-27 10:46:08,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283280439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:08,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:08,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:08,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039786477] [2022-04-27 10:46:08,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:08,179 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 10:46:08,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:08,179 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 10:46:08,189 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 10:46:08,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:08,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:08,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:08,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:08,190 INFO L87 Difference]: Start difference. First operand 295 states and 360 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 10:46:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:09,729 INFO L93 Difference]: Finished difference Result 321 states and 388 transitions. [2022-04-27 10:46:09,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:46:09,729 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 10:46:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:09,729 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 10:46:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 388 transitions. [2022-04-27 10:46:09,731 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 10:46:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 388 transitions. [2022-04-27 10:46:09,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 388 transitions. [2022-04-27 10:46:09,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:09,990 INFO L225 Difference]: With dead ends: 321 [2022-04-27 10:46:09,990 INFO L226 Difference]: Without dead ends: 319 [2022-04-27 10:46:09,997 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 10:46:09,998 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 281 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:09,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 466 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 10:46:09,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-27 10:46:10,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 298. [2022-04-27 10:46:10,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:10,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand has 298 states, 287 states have (on average 1.254355400696864) internal successors, (360), 294 states have internal predecessors, (360), 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 10:46:10,029 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand has 298 states, 287 states have (on average 1.254355400696864) internal successors, (360), 294 states have internal predecessors, (360), 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 10:46:10,029 INFO L87 Difference]: Start difference. First operand 319 states. Second operand has 298 states, 287 states have (on average 1.254355400696864) internal successors, (360), 294 states have internal predecessors, (360), 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 10:46:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:10,034 INFO L93 Difference]: Finished difference Result 319 states and 386 transitions. [2022-04-27 10:46:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 386 transitions. [2022-04-27 10:46:10,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:10,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:10,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 298 states, 287 states have (on average 1.254355400696864) internal successors, (360), 294 states have internal predecessors, (360), 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 319 states. [2022-04-27 10:46:10,035 INFO L87 Difference]: Start difference. First operand has 298 states, 287 states have (on average 1.254355400696864) internal successors, (360), 294 states have internal predecessors, (360), 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 319 states. [2022-04-27 10:46:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:10,040 INFO L93 Difference]: Finished difference Result 319 states and 386 transitions. [2022-04-27 10:46:10,041 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 386 transitions. [2022-04-27 10:46:10,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:10,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:10,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:10,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 287 states have (on average 1.254355400696864) internal successors, (360), 294 states have internal predecessors, (360), 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 10:46:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 363 transitions. [2022-04-27 10:46:10,045 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 363 transitions. Word has length 19 [2022-04-27 10:46:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:10,045 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 363 transitions. [2022-04-27 10:46:10,045 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 10:46:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 363 transitions. [2022-04-27 10:46:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:46:10,046 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:10,046 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 10:46:10,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 10:46:10,046 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:46:10,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1750216322, now seen corresponding path program 1 times [2022-04-27 10:46:10,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:10,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066044962] [2022-04-27 10:46:10,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:10,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:10,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:10,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {16513#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {16506#true} is VALID [2022-04-27 10:46:10,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {16506#true} assume true; {16506#true} is VALID [2022-04-27 10:46:10,100 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16506#true} {16506#true} #1237#return; {16506#true} is VALID [2022-04-27 10:46:10,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {16506#true} call ULTIMATE.init(); {16513#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:10,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {16513#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {16506#true} is VALID [2022-04-27 10:46:10,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {16506#true} assume true; {16506#true} is VALID [2022-04-27 10:46:10,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16506#true} {16506#true} #1237#return; {16506#true} is VALID [2022-04-27 10:46:10,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {16506#true} call #t~ret69 := main(); {16506#true} is VALID [2022-04-27 10:46:10,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {16506#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {16506#true} is VALID [2022-04-27 10:46:10,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {16506#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {16511#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:10,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {16511#(<= 0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {16511#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:10,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {16511#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {16511#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:10,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {16511#(<= 0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {16511#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:10,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {16511#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {16511#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:10,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {16511#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {16511#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:10,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {16511#(<= 0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {16511#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:10,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {16511#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {16511#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:10,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {16511#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {16511#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:10,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {16511#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {16511#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:10,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {16511#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {16511#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:10,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {16511#(<= 0 main_~main__tagbuf_len~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {16512#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-27 10:46:10,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {16512#(not (= main_~__VERIFIER_assert__cond~8 0))} assume 0 == ~__VERIFIER_assert__cond~8; {16507#false} is VALID [2022-04-27 10:46:10,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {16507#false} assume !false; {16507#false} is VALID [2022-04-27 10:46:10,108 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 10:46:10,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:10,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066044962] [2022-04-27 10:46:10,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066044962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:10,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:10,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:46:10,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933705970] [2022-04-27 10:46:10,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:10,110 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 10:46:10,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:10,111 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 10:46:10,121 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 10:46:10,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:46:10,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:10,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:46:10,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:46:10,122 INFO L87 Difference]: Start difference. First operand 298 states and 363 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 10:46:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:10,970 INFO L93 Difference]: Finished difference Result 298 states and 363 transitions. [2022-04-27 10:46:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:46:10,970 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 10:46:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:10,970 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 10:46:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 346 transitions. [2022-04-27 10:46:10,972 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 10:46:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 346 transitions. [2022-04-27 10:46:10,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 346 transitions. [2022-04-27 10:46:11,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:11,283 INFO L225 Difference]: With dead ends: 298 [2022-04-27 10:46:11,283 INFO L226 Difference]: Without dead ends: 296 [2022-04-27 10:46:11,283 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 10:46:11,283 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 569 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:11,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 254 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:46:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-04-27 10:46:11,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-04-27 10:46:11,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:11,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 296 states. Second operand has 296 states, 286 states have (on average 1.2517482517482517) internal successors, (358), 292 states have internal predecessors, (358), 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 10:46:11,305 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand has 296 states, 286 states have (on average 1.2517482517482517) internal successors, (358), 292 states have internal predecessors, (358), 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 10:46:11,306 INFO L87 Difference]: Start difference. First operand 296 states. Second operand has 296 states, 286 states have (on average 1.2517482517482517) internal successors, (358), 292 states have internal predecessors, (358), 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 10:46:11,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:11,309 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2022-04-27 10:46:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 361 transitions. [2022-04-27 10:46:11,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:11,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:11,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 296 states, 286 states have (on average 1.2517482517482517) internal successors, (358), 292 states have internal predecessors, (358), 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 296 states. [2022-04-27 10:46:11,310 INFO L87 Difference]: Start difference. First operand has 296 states, 286 states have (on average 1.2517482517482517) internal successors, (358), 292 states have internal predecessors, (358), 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 296 states. [2022-04-27 10:46:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:11,314 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2022-04-27 10:46:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 361 transitions. [2022-04-27 10:46:11,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:11,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:11,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:11,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 286 states have (on average 1.2517482517482517) internal successors, (358), 292 states have internal predecessors, (358), 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 10:46:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 361 transitions. [2022-04-27 10:46:11,319 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 361 transitions. Word has length 20 [2022-04-27 10:46:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:11,320 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 361 transitions. [2022-04-27 10:46:11,320 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 10:46:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 361 transitions. [2022-04-27 10:46:11,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 10:46:11,320 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:11,320 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 10:46:11,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 10:46:11,321 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:46:11,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:11,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1577872003, now seen corresponding path program 1 times [2022-04-27 10:46:11,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:11,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315211522] [2022-04-27 10:46:11,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:11,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:11,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:11,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {17737#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {17730#true} is VALID [2022-04-27 10:46:11,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-27 10:46:11,385 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17730#true} {17730#true} #1237#return; {17730#true} is VALID [2022-04-27 10:46:11,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {17730#true} call ULTIMATE.init(); {17737#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:11,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {17737#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {17730#true} is VALID [2022-04-27 10:46:11,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-27 10:46:11,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17730#true} #1237#return; {17730#true} is VALID [2022-04-27 10:46:11,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {17730#true} call #t~ret69 := main(); {17730#true} is VALID [2022-04-27 10:46:11,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {17730#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {17730#true} is VALID [2022-04-27 10:46:11,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {17730#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {17730#true} is VALID [2022-04-27 10:46:11,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {17730#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {17730#true} is VALID [2022-04-27 10:46:11,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {17730#true} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {17730#true} is VALID [2022-04-27 10:46:11,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {17730#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {17730#true} is VALID [2022-04-27 10:46:11,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {17730#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {17730#true} is VALID [2022-04-27 10:46:11,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {17730#true} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {17730#true} is VALID [2022-04-27 10:46:11,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {17730#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {17730#true} is VALID [2022-04-27 10:46:11,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {17730#true} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {17730#true} is VALID [2022-04-27 10:46:11,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {17730#true} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {17730#true} is VALID [2022-04-27 10:46:11,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {17730#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {17730#true} is VALID [2022-04-27 10:46:11,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {17730#true} assume !(0 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {17730#true} is VALID [2022-04-27 10:46:11,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {17730#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {17735#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:11,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {17735#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {17736#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-27 10:46:11,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {17736#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {17731#false} is VALID [2022-04-27 10:46:11,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {17731#false} assume !false; {17731#false} is VALID [2022-04-27 10:46:11,388 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 10:46:11,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:11,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315211522] [2022-04-27 10:46:11,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315211522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:11,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:11,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:46:11,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507767335] [2022-04-27 10:46:11,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:11,389 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 10:46:11,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:11,389 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 10:46:11,401 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 10:46:11,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:46:11,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:11,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:46:11,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:46:11,401 INFO L87 Difference]: Start difference. First operand 296 states and 361 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 10:46:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:12,463 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2022-04-27 10:46:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:46:12,463 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 10:46:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:12,464 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 10:46:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 347 transitions. [2022-04-27 10:46:12,466 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 10:46:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 347 transitions. [2022-04-27 10:46:12,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 347 transitions. [2022-04-27 10:46:12,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:12,713 INFO L225 Difference]: With dead ends: 296 [2022-04-27 10:46:12,713 INFO L226 Difference]: Without dead ends: 292 [2022-04-27 10:46:12,715 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 10:46:12,715 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 245 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:12,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 397 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:46:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-27 10:46:12,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-04-27 10:46:12,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:12,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 292 states. Second operand has 292 states, 283 states have (on average 1.2508833922261484) internal successors, (354), 288 states have internal predecessors, (354), 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 10:46:12,751 INFO L74 IsIncluded]: Start isIncluded. First operand 292 states. Second operand has 292 states, 283 states have (on average 1.2508833922261484) internal successors, (354), 288 states have internal predecessors, (354), 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 10:46:12,751 INFO L87 Difference]: Start difference. First operand 292 states. Second operand has 292 states, 283 states have (on average 1.2508833922261484) internal successors, (354), 288 states have internal predecessors, (354), 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 10:46:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:12,755 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2022-04-27 10:46:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2022-04-27 10:46:12,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:12,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:12,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 283 states have (on average 1.2508833922261484) internal successors, (354), 288 states have internal predecessors, (354), 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 292 states. [2022-04-27 10:46:12,756 INFO L87 Difference]: Start difference. First operand has 292 states, 283 states have (on average 1.2508833922261484) internal successors, (354), 288 states have internal predecessors, (354), 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 292 states. [2022-04-27 10:46:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:12,760 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2022-04-27 10:46:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2022-04-27 10:46:12,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:12,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:12,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:12,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 283 states have (on average 1.2508833922261484) internal successors, (354), 288 states have internal predecessors, (354), 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 10:46:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 357 transitions. [2022-04-27 10:46:12,764 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 357 transitions. Word has length 21 [2022-04-27 10:46:12,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:12,764 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 357 transitions. [2022-04-27 10:46:12,764 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 10:46:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2022-04-27 10:46:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 10:46:12,766 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:12,766 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 10:46:12,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 10:46:12,766 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:46:12,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:12,767 INFO L85 PathProgramCache]: Analyzing trace with hash -383054022, now seen corresponding path program 1 times [2022-04-27 10:46:12,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:12,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695019442] [2022-04-27 10:46:12,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:12,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:12,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:12,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {18950#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {18941#true} is VALID [2022-04-27 10:46:12,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {18941#true} assume true; {18941#true} is VALID [2022-04-27 10:46:12,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18941#true} {18941#true} #1237#return; {18941#true} is VALID [2022-04-27 10:46:12,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {18941#true} call ULTIMATE.init(); {18950#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:12,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {18950#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {18941#true} is VALID [2022-04-27 10:46:12,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {18941#true} assume true; {18941#true} is VALID [2022-04-27 10:46:12,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18941#true} {18941#true} #1237#return; {18941#true} is VALID [2022-04-27 10:46:12,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {18941#true} call #t~ret69 := main(); {18941#true} is VALID [2022-04-27 10:46:12,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {18941#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {18941#true} is VALID [2022-04-27 10:46:12,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {18941#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {18941#true} is VALID [2022-04-27 10:46:12,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {18941#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {18941#true} is VALID [2022-04-27 10:46:12,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {18941#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {18941#true} is VALID [2022-04-27 10:46:12,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {18941#true} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {18941#true} is VALID [2022-04-27 10:46:12,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {18941#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {18941#true} is VALID [2022-04-27 10:46:12,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {18941#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {18946#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:12,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {18946#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {18946#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:12,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {18946#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {18947#(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 10:46:12,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {18947#(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)))} assume !(0 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {18948#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:12,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {18948#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_0~2 := #t~nondet10;havoc #t~nondet10; {18948#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:12,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {18948#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_0~2);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~2; {18948#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:12,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {18948#(<= main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {18948#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:12,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {18948#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {18949#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-27 10:46:12,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {18949#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {18942#false} is VALID [2022-04-27 10:46:12,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {18942#false} assume !false; {18942#false} is VALID [2022-04-27 10:46:12,848 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 10:46:12,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:12,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695019442] [2022-04-27 10:46:12,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695019442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:12,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:12,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:12,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201998794] [2022-04-27 10:46:12,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:12,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 10:46:12,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:12,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 10:46:12,863 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 10:46:12,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:12,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:12,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:12,864 INFO L87 Difference]: Start difference. First operand 292 states and 357 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 10:46:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:14,365 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2022-04-27 10:46:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:46:14,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 10:46:14,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 10:46:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 340 transitions. [2022-04-27 10:46:14,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 10:46:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 340 transitions. [2022-04-27 10:46:14,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 340 transitions. [2022-04-27 10:46:14,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 340 edges. 340 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:14,636 INFO L225 Difference]: With dead ends: 292 [2022-04-27 10:46:14,636 INFO L226 Difference]: Without dead ends: 290 [2022-04-27 10:46:14,637 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 10:46:14,637 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 871 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:14,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 107 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 10:46:14,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-04-27 10:46:14,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2022-04-27 10:46:14,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:14,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 290 states. Second operand has 287 states, 279 states have (on average 1.2508960573476702) internal successors, (349), 283 states have internal predecessors, (349), 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 10:46:14,657 INFO L74 IsIncluded]: Start isIncluded. First operand 290 states. Second operand has 287 states, 279 states have (on average 1.2508960573476702) internal successors, (349), 283 states have internal predecessors, (349), 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 10:46:14,657 INFO L87 Difference]: Start difference. First operand 290 states. Second operand has 287 states, 279 states have (on average 1.2508960573476702) internal successors, (349), 283 states have internal predecessors, (349), 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 10:46:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:14,660 INFO L93 Difference]: Finished difference Result 290 states and 355 transitions. [2022-04-27 10:46:14,660 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 355 transitions. [2022-04-27 10:46:14,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:14,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:14,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 279 states have (on average 1.2508960573476702) internal successors, (349), 283 states have internal predecessors, (349), 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 290 states. [2022-04-27 10:46:14,661 INFO L87 Difference]: Start difference. First operand has 287 states, 279 states have (on average 1.2508960573476702) internal successors, (349), 283 states have internal predecessors, (349), 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 290 states. [2022-04-27 10:46:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:14,664 INFO L93 Difference]: Finished difference Result 290 states and 355 transitions. [2022-04-27 10:46:14,665 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 355 transitions. [2022-04-27 10:46:14,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:14,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:14,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:14,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 279 states have (on average 1.2508960573476702) internal successors, (349), 283 states have internal predecessors, (349), 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 10:46:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2022-04-27 10:46:14,669 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 21 [2022-04-27 10:46:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:14,670 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2022-04-27 10:46:14,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 10:46:14,670 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2022-04-27 10:46:14,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:46:14,670 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:14,670 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 10:46:14,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 10:46:14,670 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:46:14,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:14,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1682632114, now seen corresponding path program 1 times [2022-04-27 10:46:14,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:14,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963992473] [2022-04-27 10:46:14,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:14,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:14,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:14,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {20156#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {20147#true} is VALID [2022-04-27 10:46:14,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {20147#true} assume true; {20147#true} is VALID [2022-04-27 10:46:14,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20147#true} {20147#true} #1237#return; {20147#true} is VALID [2022-04-27 10:46:14,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {20147#true} call ULTIMATE.init(); {20156#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:14,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {20156#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {20147#true} is VALID [2022-04-27 10:46:14,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {20147#true} assume true; {20147#true} is VALID [2022-04-27 10:46:14,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20147#true} {20147#true} #1237#return; {20147#true} is VALID [2022-04-27 10:46:14,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {20147#true} call #t~ret69 := main(); {20147#true} is VALID [2022-04-27 10:46:14,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {20147#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {20147#true} is VALID [2022-04-27 10:46:14,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {20147#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {20147#true} is VALID [2022-04-27 10:46:14,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {20147#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {20147#true} is VALID [2022-04-27 10:46:14,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {20147#true} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {20147#true} is VALID [2022-04-27 10:46:14,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {20147#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {20147#true} is VALID [2022-04-27 10:46:14,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {20147#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {20147#true} is VALID [2022-04-27 10:46:14,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {20147#true} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {20147#true} is VALID [2022-04-27 10:46:14,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {20147#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {20152#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:14,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {20152#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {20152#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:14,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {20152#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {20152#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:14,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {20152#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {20153#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~7 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2022-04-27 10:46:14,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {20153#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~7 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {20154#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:14,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {20154#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {20154#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:14,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {20154#(<= main_~main__t~0 main_~main__tagbuf_len~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {20154#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:14,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {20154#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {20155#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 10:46:14,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {20155#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {20148#false} is VALID [2022-04-27 10:46:14,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {20148#false} assume !false; {20148#false} is VALID [2022-04-27 10:46:14,727 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 10:46:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:14,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963992473] [2022-04-27 10:46:14,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963992473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:14,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:14,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:14,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410380819] [2022-04-27 10:46:14,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:14,728 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 10:46:14,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:14,729 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 10:46:14,740 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 10:46:14,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:14,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:14,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:14,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:14,740 INFO L87 Difference]: Start difference. First operand 287 states and 352 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 10:46:16,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:16,264 INFO L93 Difference]: Finished difference Result 302 states and 369 transitions. [2022-04-27 10:46:16,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:46:16,264 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 10:46:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:16,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 10:46:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 355 transitions. [2022-04-27 10:46:16,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 10:46:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 355 transitions. [2022-04-27 10:46:16,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 355 transitions. [2022-04-27 10:46:16,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 355 edges. 355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:16,536 INFO L225 Difference]: With dead ends: 302 [2022-04-27 10:46:16,536 INFO L226 Difference]: Without dead ends: 300 [2022-04-27 10:46:16,536 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 10:46:16,537 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 862 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:16,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 121 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 10:46:16,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-04-27 10:46:16,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 282. [2022-04-27 10:46:16,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:16,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 300 states. Second operand has 282 states, 275 states have (on average 1.250909090909091) internal successors, (344), 278 states have internal predecessors, (344), 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 10:46:16,562 INFO L74 IsIncluded]: Start isIncluded. First operand 300 states. Second operand has 282 states, 275 states have (on average 1.250909090909091) internal successors, (344), 278 states have internal predecessors, (344), 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 10:46:16,562 INFO L87 Difference]: Start difference. First operand 300 states. Second operand has 282 states, 275 states have (on average 1.250909090909091) internal successors, (344), 278 states have internal predecessors, (344), 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 10:46:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:16,566 INFO L93 Difference]: Finished difference Result 300 states and 367 transitions. [2022-04-27 10:46:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 367 transitions. [2022-04-27 10:46:16,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:16,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:16,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 282 states, 275 states have (on average 1.250909090909091) internal successors, (344), 278 states have internal predecessors, (344), 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 300 states. [2022-04-27 10:46:16,567 INFO L87 Difference]: Start difference. First operand has 282 states, 275 states have (on average 1.250909090909091) internal successors, (344), 278 states have internal predecessors, (344), 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 300 states. [2022-04-27 10:46:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:16,571 INFO L93 Difference]: Finished difference Result 300 states and 367 transitions. [2022-04-27 10:46:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 367 transitions. [2022-04-27 10:46:16,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:16,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:16,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:16,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 275 states have (on average 1.250909090909091) internal successors, (344), 278 states have internal predecessors, (344), 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 10:46:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 347 transitions. [2022-04-27 10:46:16,574 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 347 transitions. Word has length 22 [2022-04-27 10:46:16,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:16,574 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 347 transitions. [2022-04-27 10:46:16,575 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 10:46:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 347 transitions. [2022-04-27 10:46:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:46:16,575 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:16,575 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 10:46:16,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 10:46:16,575 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:46:16,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:16,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1297761964, now seen corresponding path program 1 times [2022-04-27 10:46:16,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:16,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664604708] [2022-04-27 10:46:16,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:16,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:16,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:16,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {21388#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {21379#true} is VALID [2022-04-27 10:46:16,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {21379#true} assume true; {21379#true} is VALID [2022-04-27 10:46:16,657 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21379#true} {21379#true} #1237#return; {21379#true} is VALID [2022-04-27 10:46:16,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {21379#true} call ULTIMATE.init(); {21388#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:16,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {21388#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {21379#true} is VALID [2022-04-27 10:46:16,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {21379#true} assume true; {21379#true} is VALID [2022-04-27 10:46:16,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21379#true} {21379#true} #1237#return; {21379#true} is VALID [2022-04-27 10:46:16,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {21379#true} call #t~ret69 := main(); {21379#true} is VALID [2022-04-27 10:46:16,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {21379#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {21379#true} is VALID [2022-04-27 10:46:16,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {21379#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {21379#true} is VALID [2022-04-27 10:46:16,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {21379#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {21379#true} is VALID [2022-04-27 10:46:16,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {21379#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {21379#true} is VALID [2022-04-27 10:46:16,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {21379#true} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {21379#true} is VALID [2022-04-27 10:46:16,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {21379#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {21379#true} is VALID [2022-04-27 10:46:16,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {21379#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {21384#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:16,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {21384#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~1; {21384#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:16,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {21384#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {21384#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:16,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {21384#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {21385#(and (or (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~3 0)) (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2022-04-27 10:46:16,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {21385#(and (or (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~3 0)) (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {21386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {21386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {21386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {21386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {21386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {21386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {21386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {21386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {21387#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-27 10:46:16,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {21387#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {21380#false} is VALID [2022-04-27 10:46:16,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {21380#false} assume !false; {21380#false} is VALID [2022-04-27 10:46:16,662 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 10:46:16,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:16,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664604708] [2022-04-27 10:46:16,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664604708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:16,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:16,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:16,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262809212] [2022-04-27 10:46:16,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:16,663 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 10:46:16,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:16,663 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 10:46:16,676 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 10:46:16,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:16,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:16,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:16,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:16,677 INFO L87 Difference]: Start difference. First operand 282 states and 347 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 10:46:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:18,188 INFO L93 Difference]: Finished difference Result 294 states and 361 transitions. [2022-04-27 10:46:18,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:46:18,188 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 10:46:18,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:18,188 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 10:46:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 350 transitions. [2022-04-27 10:46:18,190 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 10:46:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 350 transitions. [2022-04-27 10:46:18,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 350 transitions. [2022-04-27 10:46:18,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 350 edges. 350 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:18,458 INFO L225 Difference]: With dead ends: 294 [2022-04-27 10:46:18,458 INFO L226 Difference]: Without dead ends: 292 [2022-04-27 10:46:18,458 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 10:46:18,459 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 853 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:18,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 115 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 10:46:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-27 10:46:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 277. [2022-04-27 10:46:18,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:18,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 292 states. Second operand has 277 states, 271 states have (on average 1.2472324723247232) internal successors, (338), 273 states have internal predecessors, (338), 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 10:46:18,480 INFO L74 IsIncluded]: Start isIncluded. First operand 292 states. Second operand has 277 states, 271 states have (on average 1.2472324723247232) internal successors, (338), 273 states have internal predecessors, (338), 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 10:46:18,480 INFO L87 Difference]: Start difference. First operand 292 states. Second operand has 277 states, 271 states have (on average 1.2472324723247232) internal successors, (338), 273 states have internal predecessors, (338), 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 10:46:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:18,483 INFO L93 Difference]: Finished difference Result 292 states and 359 transitions. [2022-04-27 10:46:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 359 transitions. [2022-04-27 10:46:18,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:18,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:18,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 277 states, 271 states have (on average 1.2472324723247232) internal successors, (338), 273 states have internal predecessors, (338), 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 292 states. [2022-04-27 10:46:18,484 INFO L87 Difference]: Start difference. First operand has 277 states, 271 states have (on average 1.2472324723247232) internal successors, (338), 273 states have internal predecessors, (338), 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 292 states. [2022-04-27 10:46:18,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:18,487 INFO L93 Difference]: Finished difference Result 292 states and 359 transitions. [2022-04-27 10:46:18,487 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 359 transitions. [2022-04-27 10:46:18,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:18,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:18,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:18,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 271 states have (on average 1.2472324723247232) internal successors, (338), 273 states have internal predecessors, (338), 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 10:46:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 341 transitions. [2022-04-27 10:46:18,491 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 341 transitions. Word has length 22 [2022-04-27 10:46:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:18,491 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 341 transitions. [2022-04-27 10:46:18,491 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 10:46:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 341 transitions. [2022-04-27 10:46:18,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:46:18,492 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:18,492 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 10:46:18,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 10:46:18,492 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:46:18,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:18,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1345477214, now seen corresponding path program 1 times [2022-04-27 10:46:18,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:18,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520240886] [2022-04-27 10:46:18,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:18,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:18,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:18,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {22589#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {22580#true} is VALID [2022-04-27 10:46:18,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {22580#true} assume true; {22580#true} is VALID [2022-04-27 10:46:18,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22580#true} {22580#true} #1237#return; {22580#true} is VALID [2022-04-27 10:46:18,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {22580#true} call ULTIMATE.init(); {22589#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:18,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {22589#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {22580#true} is VALID [2022-04-27 10:46:18,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {22580#true} assume true; {22580#true} is VALID [2022-04-27 10:46:18,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22580#true} {22580#true} #1237#return; {22580#true} is VALID [2022-04-27 10:46:18,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {22580#true} call #t~ret69 := main(); {22580#true} is VALID [2022-04-27 10:46:18,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {22580#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {22580#true} is VALID [2022-04-27 10:46:18,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {22580#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {22580#true} is VALID [2022-04-27 10:46:18,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {22580#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {22580#true} is VALID [2022-04-27 10:46:18,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {22580#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {22580#true} is VALID [2022-04-27 10:46:18,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {22580#true} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {22580#true} is VALID [2022-04-27 10:46:18,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {22580#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {22580#true} is VALID [2022-04-27 10:46:18,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {22580#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {22585#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:18,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {22585#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~1; {22585#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:18,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {22585#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2609_0~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {22585#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:18,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {22585#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {22586#(and (or (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~3 0)) (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2022-04-27 10:46:18,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {22586#(and (or (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~3 0)) (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {22587#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:18,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {22587#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {22587#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:18,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {22587#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet8;havoc #t~nondet8; {22587#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:18,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {22587#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {22587#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:18,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {22587#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {22588#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-27 10:46:18,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {22588#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {22581#false} is VALID [2022-04-27 10:46:18,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {22581#false} assume !false; {22581#false} is VALID [2022-04-27 10:46:18,564 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 10:46:18,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:18,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520240886] [2022-04-27 10:46:18,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520240886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:18,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:18,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:18,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337322200] [2022-04-27 10:46:18,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:18,565 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 10:46:18,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:18,566 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 10:46:18,576 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 10:46:18,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:18,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:18,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:18,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:18,577 INFO L87 Difference]: Start difference. First operand 277 states and 341 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 10:46:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:20,044 INFO L93 Difference]: Finished difference Result 277 states and 341 transitions. [2022-04-27 10:46:20,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:46:20,045 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 10:46:20,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:20,045 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 10:46:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 334 transitions. [2022-04-27 10:46:20,046 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 10:46:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 334 transitions. [2022-04-27 10:46:20,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 334 transitions. [2022-04-27 10:46:20,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:20,304 INFO L225 Difference]: With dead ends: 277 [2022-04-27 10:46:20,304 INFO L226 Difference]: Without dead ends: 254 [2022-04-27 10:46:20,304 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 10:46:20,305 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 834 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:20,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 105 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 10:46:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-27 10:46:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2022-04-27 10:46:20,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:20,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 254 states, 249 states have (on average 1.0080321285140563) internal successors, (251), 250 states have internal predecessors, (251), 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 10:46:20,315 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 254 states, 249 states have (on average 1.0080321285140563) internal successors, (251), 250 states have internal predecessors, (251), 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 10:46:20,315 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 254 states, 249 states have (on average 1.0080321285140563) internal successors, (251), 250 states have internal predecessors, (251), 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 10:46:20,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:20,318 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2022-04-27 10:46:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2022-04-27 10:46:20,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:20,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:20,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 249 states have (on average 1.0080321285140563) internal successors, (251), 250 states have internal predecessors, (251), 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 254 states. [2022-04-27 10:46:20,319 INFO L87 Difference]: Start difference. First operand has 254 states, 249 states have (on average 1.0080321285140563) internal successors, (251), 250 states have internal predecessors, (251), 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 254 states. [2022-04-27 10:46:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:20,323 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2022-04-27 10:46:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2022-04-27 10:46:20,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:20,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:20,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:20,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 249 states have (on average 1.0080321285140563) internal successors, (251), 250 states have internal predecessors, (251), 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 10:46:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2022-04-27 10:46:20,327 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 22 [2022-04-27 10:46:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:20,327 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2022-04-27 10:46:20,327 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 10:46:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2022-04-27 10:46:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-04-27 10:46:20,329 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:20,329 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, 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, 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, 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, 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, 1, 1, 1] [2022-04-27 10:46:20,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 10:46:20,331 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:46:20,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:20,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1242952801, now seen corresponding path program 1 times [2022-04-27 10:46:20,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:20,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075163716] [2022-04-27 10:46:20,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:21,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:21,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {23722#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {23656#true} is VALID [2022-04-27 10:46:21,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {23656#true} assume true; {23656#true} is VALID [2022-04-27 10:46:21,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23656#true} {23656#true} #1237#return; {23656#true} is VALID [2022-04-27 10:46:21,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {23656#true} call ULTIMATE.init(); {23722#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:21,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {23722#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {23656#true} is VALID [2022-04-27 10:46:21,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {23656#true} assume true; {23656#true} is VALID [2022-04-27 10:46:21,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23656#true} {23656#true} #1237#return; {23656#true} is VALID [2022-04-27 10:46:21,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {23656#true} call #t~ret69 := main(); {23656#true} is VALID [2022-04-27 10:46:21,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {23656#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {23656#true} is VALID [2022-04-27 10:46:21,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {23656#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {23661#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:21,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {23661#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {23661#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:21,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {23661#(= main_~main__t~0 0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {23661#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:21,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {23661#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {23661#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:21,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {23661#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23662#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:21,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {23662#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {23662#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:21,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {23662#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {23662#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:21,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {23662#(<= 1 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {23662#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:21,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {23662#(<= 1 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23663#(<= 2 main_~main__t~0)} is VALID [2022-04-27 10:46:21,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {23663#(<= 2 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_0~2 := #t~nondet10;havoc #t~nondet10; {23663#(<= 2 main_~main__t~0)} is VALID [2022-04-27 10:46:21,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {23663#(<= 2 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {23663#(<= 2 main_~main__t~0)} is VALID [2022-04-27 10:46:21,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {23663#(<= 2 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {23663#(<= 2 main_~main__t~0)} is VALID [2022-04-27 10:46:21,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {23663#(<= 2 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23664#(<= 3 main_~main__t~0)} is VALID [2022-04-27 10:46:21,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {23664#(<= 3 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~main____CPAchecker_TMP_0~3 := #t~nondet11;havoc #t~nondet11; {23664#(<= 3 main_~main__t~0)} is VALID [2022-04-27 10:46:21,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {23664#(<= 3 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_21~0;~__tmp_21~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {23664#(<= 3 main_~main__t~0)} is VALID [2022-04-27 10:46:21,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {23664#(<= 3 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {23664#(<= 3 main_~main__t~0)} is VALID [2022-04-27 10:46:21,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {23664#(<= 3 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23665#(<= 4 main_~main__t~0)} is VALID [2022-04-27 10:46:21,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {23665#(<= 4 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~main____CPAchecker_TMP_0~4 := #t~nondet12;havoc #t~nondet12; {23665#(<= 4 main_~main__t~0)} is VALID [2022-04-27 10:46:21,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {23665#(<= 4 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_23~0;~__tmp_23~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {23665#(<= 4 main_~main__t~0)} is VALID [2022-04-27 10:46:21,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {23665#(<= 4 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {23665#(<= 4 main_~main__t~0)} is VALID [2022-04-27 10:46:21,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {23665#(<= 4 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23666#(<= 5 main_~main__t~0)} is VALID [2022-04-27 10:46:21,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {23666#(<= 5 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~main____CPAchecker_TMP_0~5 := #t~nondet13;havoc #t~nondet13; {23666#(<= 5 main_~main__t~0)} is VALID [2022-04-27 10:46:21,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {23666#(<= 5 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_25~0;~__tmp_25~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {23666#(<= 5 main_~main__t~0)} is VALID [2022-04-27 10:46:21,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {23666#(<= 5 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {23666#(<= 5 main_~main__t~0)} is VALID [2022-04-27 10:46:21,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {23666#(<= 5 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23667#(<= 6 main_~main__t~0)} is VALID [2022-04-27 10:46:21,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {23667#(<= 6 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~main____CPAchecker_TMP_0~6 := #t~nondet14;havoc #t~nondet14; {23667#(<= 6 main_~main__t~0)} is VALID [2022-04-27 10:46:21,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {23667#(<= 6 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_27~0;~__tmp_27~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {23667#(<= 6 main_~main__t~0)} is VALID [2022-04-27 10:46:21,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {23667#(<= 6 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {23667#(<= 6 main_~main__t~0)} is VALID [2022-04-27 10:46:21,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {23667#(<= 6 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23668#(<= 7 main_~main__t~0)} is VALID [2022-04-27 10:46:21,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {23668#(<= 7 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~main____CPAchecker_TMP_0~7 := #t~nondet15;havoc #t~nondet15; {23668#(<= 7 main_~main__t~0)} is VALID [2022-04-27 10:46:21,887 INFO L290 TraceCheckUtils]: 36: Hoare triple {23668#(<= 7 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~7);havoc ~__tmp_29~0;~__tmp_29~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~28;~__VERIFIER_assert__cond~28 := ~__tmp_29~0; {23668#(<= 7 main_~main__t~0)} is VALID [2022-04-27 10:46:21,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {23668#(<= 7 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~28);havoc ~__tmp_30~0;~__tmp_30~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~29;~__VERIFIER_assert__cond~29 := ~__tmp_30~0; {23668#(<= 7 main_~main__t~0)} is VALID [2022-04-27 10:46:21,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {23668#(<= 7 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~29);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23669#(<= 8 main_~main__t~0)} is VALID [2022-04-27 10:46:21,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {23669#(<= 8 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~main____CPAchecker_TMP_0~8 := #t~nondet16;havoc #t~nondet16; {23669#(<= 8 main_~main__t~0)} is VALID [2022-04-27 10:46:21,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {23669#(<= 8 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~8);havoc ~__tmp_31~0;~__tmp_31~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {23669#(<= 8 main_~main__t~0)} is VALID [2022-04-27 10:46:21,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {23669#(<= 8 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~30);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {23669#(<= 8 main_~main__t~0)} is VALID [2022-04-27 10:46:21,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {23669#(<= 8 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~31);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23670#(<= 9 main_~main__t~0)} is VALID [2022-04-27 10:46:21,890 INFO L290 TraceCheckUtils]: 43: Hoare triple {23670#(<= 9 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~9;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~main____CPAchecker_TMP_0~9 := #t~nondet17;havoc #t~nondet17; {23670#(<= 9 main_~main__t~0)} is VALID [2022-04-27 10:46:21,891 INFO L290 TraceCheckUtils]: 44: Hoare triple {23670#(<= 9 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~9);havoc ~__tmp_33~0;~__tmp_33~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~32;~__VERIFIER_assert__cond~32 := ~__tmp_33~0; {23670#(<= 9 main_~main__t~0)} is VALID [2022-04-27 10:46:21,891 INFO L290 TraceCheckUtils]: 45: Hoare triple {23670#(<= 9 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~32);havoc ~__tmp_34~0;~__tmp_34~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~33;~__VERIFIER_assert__cond~33 := ~__tmp_34~0; {23670#(<= 9 main_~main__t~0)} is VALID [2022-04-27 10:46:21,891 INFO L290 TraceCheckUtils]: 46: Hoare triple {23670#(<= 9 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~33);~main____CPAchecker_TMP_1~9 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23671#(<= 10 main_~main__t~0)} is VALID [2022-04-27 10:46:21,891 INFO L290 TraceCheckUtils]: 47: Hoare triple {23671#(<= 10 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~10;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~main____CPAchecker_TMP_0~10 := #t~nondet18;havoc #t~nondet18; {23671#(<= 10 main_~main__t~0)} is VALID [2022-04-27 10:46:21,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {23671#(<= 10 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~10);havoc ~__tmp_35~0;~__tmp_35~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {23671#(<= 10 main_~main__t~0)} is VALID [2022-04-27 10:46:21,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {23671#(<= 10 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {23671#(<= 10 main_~main__t~0)} is VALID [2022-04-27 10:46:21,892 INFO L290 TraceCheckUtils]: 50: Hoare triple {23671#(<= 10 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~10 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23672#(<= 11 main_~main__t~0)} is VALID [2022-04-27 10:46:21,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {23672#(<= 11 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~11;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~main____CPAchecker_TMP_0~11 := #t~nondet19;havoc #t~nondet19; {23672#(<= 11 main_~main__t~0)} is VALID [2022-04-27 10:46:21,893 INFO L290 TraceCheckUtils]: 52: Hoare triple {23672#(<= 11 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~11);havoc ~__tmp_37~0;~__tmp_37~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~36;~__VERIFIER_assert__cond~36 := ~__tmp_37~0; {23672#(<= 11 main_~main__t~0)} is VALID [2022-04-27 10:46:21,893 INFO L290 TraceCheckUtils]: 53: Hoare triple {23672#(<= 11 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~36);havoc ~__tmp_38~0;~__tmp_38~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~37;~__VERIFIER_assert__cond~37 := ~__tmp_38~0; {23672#(<= 11 main_~main__t~0)} is VALID [2022-04-27 10:46:21,894 INFO L290 TraceCheckUtils]: 54: Hoare triple {23672#(<= 11 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~37);~main____CPAchecker_TMP_1~11 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23673#(<= 12 main_~main__t~0)} is VALID [2022-04-27 10:46:21,894 INFO L290 TraceCheckUtils]: 55: Hoare triple {23673#(<= 12 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~12;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~main____CPAchecker_TMP_0~12 := #t~nondet20;havoc #t~nondet20; {23673#(<= 12 main_~main__t~0)} is VALID [2022-04-27 10:46:21,894 INFO L290 TraceCheckUtils]: 56: Hoare triple {23673#(<= 12 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~12);havoc ~__tmp_39~0;~__tmp_39~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {23673#(<= 12 main_~main__t~0)} is VALID [2022-04-27 10:46:21,894 INFO L290 TraceCheckUtils]: 57: Hoare triple {23673#(<= 12 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {23673#(<= 12 main_~main__t~0)} is VALID [2022-04-27 10:46:21,895 INFO L290 TraceCheckUtils]: 58: Hoare triple {23673#(<= 12 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~12 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23674#(<= 13 main_~main__t~0)} is VALID [2022-04-27 10:46:21,899 INFO L290 TraceCheckUtils]: 59: Hoare triple {23674#(<= 13 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~13;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~main____CPAchecker_TMP_0~13 := #t~nondet21;havoc #t~nondet21; {23674#(<= 13 main_~main__t~0)} is VALID [2022-04-27 10:46:21,901 INFO L290 TraceCheckUtils]: 60: Hoare triple {23674#(<= 13 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~13);havoc ~__tmp_41~0;~__tmp_41~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~40;~__VERIFIER_assert__cond~40 := ~__tmp_41~0; {23674#(<= 13 main_~main__t~0)} is VALID [2022-04-27 10:46:21,901 INFO L290 TraceCheckUtils]: 61: Hoare triple {23674#(<= 13 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~40);havoc ~__tmp_42~0;~__tmp_42~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~41;~__VERIFIER_assert__cond~41 := ~__tmp_42~0; {23674#(<= 13 main_~main__t~0)} is VALID [2022-04-27 10:46:21,901 INFO L290 TraceCheckUtils]: 62: Hoare triple {23674#(<= 13 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~41);~main____CPAchecker_TMP_1~13 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23675#(<= 14 main_~main__t~0)} is VALID [2022-04-27 10:46:21,902 INFO L290 TraceCheckUtils]: 63: Hoare triple {23675#(<= 14 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~14;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~main____CPAchecker_TMP_0~14 := #t~nondet22;havoc #t~nondet22; {23675#(<= 14 main_~main__t~0)} is VALID [2022-04-27 10:46:21,902 INFO L290 TraceCheckUtils]: 64: Hoare triple {23675#(<= 14 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~14);havoc ~__tmp_43~0;~__tmp_43~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {23675#(<= 14 main_~main__t~0)} is VALID [2022-04-27 10:46:21,902 INFO L290 TraceCheckUtils]: 65: Hoare triple {23675#(<= 14 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {23675#(<= 14 main_~main__t~0)} is VALID [2022-04-27 10:46:21,903 INFO L290 TraceCheckUtils]: 66: Hoare triple {23675#(<= 14 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~14 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23676#(<= 15 main_~main__t~0)} is VALID [2022-04-27 10:46:21,903 INFO L290 TraceCheckUtils]: 67: Hoare triple {23676#(<= 15 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~15;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~main____CPAchecker_TMP_0~15 := #t~nondet23;havoc #t~nondet23; {23676#(<= 15 main_~main__t~0)} is VALID [2022-04-27 10:46:21,903 INFO L290 TraceCheckUtils]: 68: Hoare triple {23676#(<= 15 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~15);havoc ~__tmp_45~0;~__tmp_45~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~44;~__VERIFIER_assert__cond~44 := ~__tmp_45~0; {23676#(<= 15 main_~main__t~0)} is VALID [2022-04-27 10:46:21,903 INFO L290 TraceCheckUtils]: 69: Hoare triple {23676#(<= 15 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~44);havoc ~__tmp_46~0;~__tmp_46~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~45;~__VERIFIER_assert__cond~45 := ~__tmp_46~0; {23676#(<= 15 main_~main__t~0)} is VALID [2022-04-27 10:46:21,904 INFO L290 TraceCheckUtils]: 70: Hoare triple {23676#(<= 15 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~45);~main____CPAchecker_TMP_1~15 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23677#(<= 16 main_~main__t~0)} is VALID [2022-04-27 10:46:21,904 INFO L290 TraceCheckUtils]: 71: Hoare triple {23677#(<= 16 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~16;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~main____CPAchecker_TMP_0~16 := #t~nondet24;havoc #t~nondet24; {23677#(<= 16 main_~main__t~0)} is VALID [2022-04-27 10:46:21,905 INFO L290 TraceCheckUtils]: 72: Hoare triple {23677#(<= 16 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~16);havoc ~__tmp_47~0;~__tmp_47~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {23677#(<= 16 main_~main__t~0)} is VALID [2022-04-27 10:46:21,905 INFO L290 TraceCheckUtils]: 73: Hoare triple {23677#(<= 16 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {23677#(<= 16 main_~main__t~0)} is VALID [2022-04-27 10:46:21,905 INFO L290 TraceCheckUtils]: 74: Hoare triple {23677#(<= 16 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~16 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23678#(<= 17 main_~main__t~0)} is VALID [2022-04-27 10:46:21,906 INFO L290 TraceCheckUtils]: 75: Hoare triple {23678#(<= 17 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~17;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~main____CPAchecker_TMP_0~17 := #t~nondet25;havoc #t~nondet25; {23678#(<= 17 main_~main__t~0)} is VALID [2022-04-27 10:46:21,906 INFO L290 TraceCheckUtils]: 76: Hoare triple {23678#(<= 17 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~17);havoc ~__tmp_49~0;~__tmp_49~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~48;~__VERIFIER_assert__cond~48 := ~__tmp_49~0; {23678#(<= 17 main_~main__t~0)} is VALID [2022-04-27 10:46:21,906 INFO L290 TraceCheckUtils]: 77: Hoare triple {23678#(<= 17 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~48);havoc ~__tmp_50~0;~__tmp_50~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~49;~__VERIFIER_assert__cond~49 := ~__tmp_50~0; {23678#(<= 17 main_~main__t~0)} is VALID [2022-04-27 10:46:21,907 INFO L290 TraceCheckUtils]: 78: Hoare triple {23678#(<= 17 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~49);~main____CPAchecker_TMP_1~17 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23679#(<= 18 main_~main__t~0)} is VALID [2022-04-27 10:46:21,907 INFO L290 TraceCheckUtils]: 79: Hoare triple {23679#(<= 18 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~18;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~main____CPAchecker_TMP_0~18 := #t~nondet26;havoc #t~nondet26; {23679#(<= 18 main_~main__t~0)} is VALID [2022-04-27 10:46:21,907 INFO L290 TraceCheckUtils]: 80: Hoare triple {23679#(<= 18 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~18);havoc ~__tmp_51~0;~__tmp_51~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {23679#(<= 18 main_~main__t~0)} is VALID [2022-04-27 10:46:21,907 INFO L290 TraceCheckUtils]: 81: Hoare triple {23679#(<= 18 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {23679#(<= 18 main_~main__t~0)} is VALID [2022-04-27 10:46:21,908 INFO L290 TraceCheckUtils]: 82: Hoare triple {23679#(<= 18 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~18 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23680#(<= 19 main_~main__t~0)} is VALID [2022-04-27 10:46:21,908 INFO L290 TraceCheckUtils]: 83: Hoare triple {23680#(<= 19 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~19;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~main____CPAchecker_TMP_0~19 := #t~nondet27;havoc #t~nondet27; {23680#(<= 19 main_~main__t~0)} is VALID [2022-04-27 10:46:21,908 INFO L290 TraceCheckUtils]: 84: Hoare triple {23680#(<= 19 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~19);havoc ~__tmp_53~0;~__tmp_53~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~52;~__VERIFIER_assert__cond~52 := ~__tmp_53~0; {23680#(<= 19 main_~main__t~0)} is VALID [2022-04-27 10:46:21,908 INFO L290 TraceCheckUtils]: 85: Hoare triple {23680#(<= 19 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~52);havoc ~__tmp_54~0;~__tmp_54~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~53;~__VERIFIER_assert__cond~53 := ~__tmp_54~0; {23680#(<= 19 main_~main__t~0)} is VALID [2022-04-27 10:46:21,909 INFO L290 TraceCheckUtils]: 86: Hoare triple {23680#(<= 19 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~53);~main____CPAchecker_TMP_1~19 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23681#(<= 20 main_~main__t~0)} is VALID [2022-04-27 10:46:21,909 INFO L290 TraceCheckUtils]: 87: Hoare triple {23681#(<= 20 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~20;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~main____CPAchecker_TMP_0~20 := #t~nondet28;havoc #t~nondet28; {23681#(<= 20 main_~main__t~0)} is VALID [2022-04-27 10:46:21,909 INFO L290 TraceCheckUtils]: 88: Hoare triple {23681#(<= 20 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~20);havoc ~__tmp_55~0;~__tmp_55~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~54;~__VERIFIER_assert__cond~54 := ~__tmp_55~0; {23681#(<= 20 main_~main__t~0)} is VALID [2022-04-27 10:46:21,910 INFO L290 TraceCheckUtils]: 89: Hoare triple {23681#(<= 20 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~54);havoc ~__tmp_56~0;~__tmp_56~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~55;~__VERIFIER_assert__cond~55 := ~__tmp_56~0; {23681#(<= 20 main_~main__t~0)} is VALID [2022-04-27 10:46:21,910 INFO L290 TraceCheckUtils]: 90: Hoare triple {23681#(<= 20 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~55);~main____CPAchecker_TMP_1~20 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23682#(<= 21 main_~main__t~0)} is VALID [2022-04-27 10:46:21,910 INFO L290 TraceCheckUtils]: 91: Hoare triple {23682#(<= 21 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~21;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~main____CPAchecker_TMP_0~21 := #t~nondet29;havoc #t~nondet29; {23682#(<= 21 main_~main__t~0)} is VALID [2022-04-27 10:46:21,910 INFO L290 TraceCheckUtils]: 92: Hoare triple {23682#(<= 21 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~21);havoc ~__tmp_57~0;~__tmp_57~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~56;~__VERIFIER_assert__cond~56 := ~__tmp_57~0; {23682#(<= 21 main_~main__t~0)} is VALID [2022-04-27 10:46:21,911 INFO L290 TraceCheckUtils]: 93: Hoare triple {23682#(<= 21 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~56);havoc ~__tmp_58~0;~__tmp_58~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~57;~__VERIFIER_assert__cond~57 := ~__tmp_58~0; {23682#(<= 21 main_~main__t~0)} is VALID [2022-04-27 10:46:21,911 INFO L290 TraceCheckUtils]: 94: Hoare triple {23682#(<= 21 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~57);~main____CPAchecker_TMP_1~21 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23683#(<= 22 main_~main__t~0)} is VALID [2022-04-27 10:46:21,911 INFO L290 TraceCheckUtils]: 95: Hoare triple {23683#(<= 22 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~22;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~main____CPAchecker_TMP_0~22 := #t~nondet30;havoc #t~nondet30; {23683#(<= 22 main_~main__t~0)} is VALID [2022-04-27 10:46:21,912 INFO L290 TraceCheckUtils]: 96: Hoare triple {23683#(<= 22 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~22);havoc ~__tmp_59~0;~__tmp_59~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~58;~__VERIFIER_assert__cond~58 := ~__tmp_59~0; {23683#(<= 22 main_~main__t~0)} is VALID [2022-04-27 10:46:21,912 INFO L290 TraceCheckUtils]: 97: Hoare triple {23683#(<= 22 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~58);havoc ~__tmp_60~0;~__tmp_60~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~59;~__VERIFIER_assert__cond~59 := ~__tmp_60~0; {23683#(<= 22 main_~main__t~0)} is VALID [2022-04-27 10:46:21,912 INFO L290 TraceCheckUtils]: 98: Hoare triple {23683#(<= 22 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~59);~main____CPAchecker_TMP_1~22 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23684#(<= 23 main_~main__t~0)} is VALID [2022-04-27 10:46:21,913 INFO L290 TraceCheckUtils]: 99: Hoare triple {23684#(<= 23 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~23;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~main____CPAchecker_TMP_0~23 := #t~nondet31;havoc #t~nondet31; {23684#(<= 23 main_~main__t~0)} is VALID [2022-04-27 10:46:21,913 INFO L290 TraceCheckUtils]: 100: Hoare triple {23684#(<= 23 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~23);havoc ~__tmp_61~0;~__tmp_61~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~60;~__VERIFIER_assert__cond~60 := ~__tmp_61~0; {23684#(<= 23 main_~main__t~0)} is VALID [2022-04-27 10:46:21,913 INFO L290 TraceCheckUtils]: 101: Hoare triple {23684#(<= 23 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~60);havoc ~__tmp_62~0;~__tmp_62~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~61;~__VERIFIER_assert__cond~61 := ~__tmp_62~0; {23684#(<= 23 main_~main__t~0)} is VALID [2022-04-27 10:46:21,913 INFO L290 TraceCheckUtils]: 102: Hoare triple {23684#(<= 23 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~61);~main____CPAchecker_TMP_1~23 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23685#(<= 24 main_~main__t~0)} is VALID [2022-04-27 10:46:21,914 INFO L290 TraceCheckUtils]: 103: Hoare triple {23685#(<= 24 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~24;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~main____CPAchecker_TMP_0~24 := #t~nondet32;havoc #t~nondet32; {23685#(<= 24 main_~main__t~0)} is VALID [2022-04-27 10:46:21,915 INFO L290 TraceCheckUtils]: 104: Hoare triple {23685#(<= 24 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~24);havoc ~__tmp_63~0;~__tmp_63~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~62;~__VERIFIER_assert__cond~62 := ~__tmp_63~0; {23685#(<= 24 main_~main__t~0)} is VALID [2022-04-27 10:46:21,915 INFO L290 TraceCheckUtils]: 105: Hoare triple {23685#(<= 24 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~62);havoc ~__tmp_64~0;~__tmp_64~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~63;~__VERIFIER_assert__cond~63 := ~__tmp_64~0; {23685#(<= 24 main_~main__t~0)} is VALID [2022-04-27 10:46:21,915 INFO L290 TraceCheckUtils]: 106: Hoare triple {23685#(<= 24 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~63);~main____CPAchecker_TMP_1~24 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23686#(<= 25 main_~main__t~0)} is VALID [2022-04-27 10:46:21,915 INFO L290 TraceCheckUtils]: 107: Hoare triple {23686#(<= 25 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~25;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~main____CPAchecker_TMP_0~25 := #t~nondet33;havoc #t~nondet33; {23686#(<= 25 main_~main__t~0)} is VALID [2022-04-27 10:46:21,916 INFO L290 TraceCheckUtils]: 108: Hoare triple {23686#(<= 25 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~25);havoc ~__tmp_65~0;~__tmp_65~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~64;~__VERIFIER_assert__cond~64 := ~__tmp_65~0; {23686#(<= 25 main_~main__t~0)} is VALID [2022-04-27 10:46:21,916 INFO L290 TraceCheckUtils]: 109: Hoare triple {23686#(<= 25 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~64);havoc ~__tmp_66~0;~__tmp_66~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~65;~__VERIFIER_assert__cond~65 := ~__tmp_66~0; {23686#(<= 25 main_~main__t~0)} is VALID [2022-04-27 10:46:21,916 INFO L290 TraceCheckUtils]: 110: Hoare triple {23686#(<= 25 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~65);~main____CPAchecker_TMP_1~25 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23687#(<= 26 main_~main__t~0)} is VALID [2022-04-27 10:46:21,918 INFO L290 TraceCheckUtils]: 111: Hoare triple {23687#(<= 26 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~26;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~main____CPAchecker_TMP_0~26 := #t~nondet34;havoc #t~nondet34; {23687#(<= 26 main_~main__t~0)} is VALID [2022-04-27 10:46:21,918 INFO L290 TraceCheckUtils]: 112: Hoare triple {23687#(<= 26 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~26);havoc ~__tmp_67~0;~__tmp_67~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~66;~__VERIFIER_assert__cond~66 := ~__tmp_67~0; {23687#(<= 26 main_~main__t~0)} is VALID [2022-04-27 10:46:21,918 INFO L290 TraceCheckUtils]: 113: Hoare triple {23687#(<= 26 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~66);havoc ~__tmp_68~0;~__tmp_68~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~67;~__VERIFIER_assert__cond~67 := ~__tmp_68~0; {23687#(<= 26 main_~main__t~0)} is VALID [2022-04-27 10:46:21,919 INFO L290 TraceCheckUtils]: 114: Hoare triple {23687#(<= 26 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~67);~main____CPAchecker_TMP_1~26 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23688#(<= 27 main_~main__t~0)} is VALID [2022-04-27 10:46:21,919 INFO L290 TraceCheckUtils]: 115: Hoare triple {23688#(<= 27 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~27;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~main____CPAchecker_TMP_0~27 := #t~nondet35;havoc #t~nondet35; {23688#(<= 27 main_~main__t~0)} is VALID [2022-04-27 10:46:21,919 INFO L290 TraceCheckUtils]: 116: Hoare triple {23688#(<= 27 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~27);havoc ~__tmp_69~0;~__tmp_69~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~68;~__VERIFIER_assert__cond~68 := ~__tmp_69~0; {23688#(<= 27 main_~main__t~0)} is VALID [2022-04-27 10:46:21,920 INFO L290 TraceCheckUtils]: 117: Hoare triple {23688#(<= 27 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~68);havoc ~__tmp_70~0;~__tmp_70~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~69;~__VERIFIER_assert__cond~69 := ~__tmp_70~0; {23688#(<= 27 main_~main__t~0)} is VALID [2022-04-27 10:46:21,920 INFO L290 TraceCheckUtils]: 118: Hoare triple {23688#(<= 27 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~69);~main____CPAchecker_TMP_1~27 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23689#(<= 28 main_~main__t~0)} is VALID [2022-04-27 10:46:21,920 INFO L290 TraceCheckUtils]: 119: Hoare triple {23689#(<= 28 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~28;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~main____CPAchecker_TMP_0~28 := #t~nondet36;havoc #t~nondet36; {23689#(<= 28 main_~main__t~0)} is VALID [2022-04-27 10:46:21,920 INFO L290 TraceCheckUtils]: 120: Hoare triple {23689#(<= 28 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~28);havoc ~__tmp_71~0;~__tmp_71~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~70;~__VERIFIER_assert__cond~70 := ~__tmp_71~0; {23689#(<= 28 main_~main__t~0)} is VALID [2022-04-27 10:46:21,921 INFO L290 TraceCheckUtils]: 121: Hoare triple {23689#(<= 28 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~70);havoc ~__tmp_72~0;~__tmp_72~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~71;~__VERIFIER_assert__cond~71 := ~__tmp_72~0; {23689#(<= 28 main_~main__t~0)} is VALID [2022-04-27 10:46:21,921 INFO L290 TraceCheckUtils]: 122: Hoare triple {23689#(<= 28 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~71);~main____CPAchecker_TMP_1~28 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23690#(<= 29 main_~main__t~0)} is VALID [2022-04-27 10:46:21,921 INFO L290 TraceCheckUtils]: 123: Hoare triple {23690#(<= 29 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~29;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~main____CPAchecker_TMP_0~29 := #t~nondet37;havoc #t~nondet37; {23690#(<= 29 main_~main__t~0)} is VALID [2022-04-27 10:46:21,922 INFO L290 TraceCheckUtils]: 124: Hoare triple {23690#(<= 29 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~29);havoc ~__tmp_73~0;~__tmp_73~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~72;~__VERIFIER_assert__cond~72 := ~__tmp_73~0; {23690#(<= 29 main_~main__t~0)} is VALID [2022-04-27 10:46:21,922 INFO L290 TraceCheckUtils]: 125: Hoare triple {23690#(<= 29 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~72);havoc ~__tmp_74~0;~__tmp_74~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~73;~__VERIFIER_assert__cond~73 := ~__tmp_74~0; {23690#(<= 29 main_~main__t~0)} is VALID [2022-04-27 10:46:21,922 INFO L290 TraceCheckUtils]: 126: Hoare triple {23690#(<= 29 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~73);~main____CPAchecker_TMP_1~29 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23691#(<= 30 main_~main__t~0)} is VALID [2022-04-27 10:46:21,923 INFO L290 TraceCheckUtils]: 127: Hoare triple {23691#(<= 30 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~30;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~main____CPAchecker_TMP_0~30 := #t~nondet38;havoc #t~nondet38; {23691#(<= 30 main_~main__t~0)} is VALID [2022-04-27 10:46:21,923 INFO L290 TraceCheckUtils]: 128: Hoare triple {23691#(<= 30 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~30);havoc ~__tmp_75~0;~__tmp_75~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~74;~__VERIFIER_assert__cond~74 := ~__tmp_75~0; {23691#(<= 30 main_~main__t~0)} is VALID [2022-04-27 10:46:21,923 INFO L290 TraceCheckUtils]: 129: Hoare triple {23691#(<= 30 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~74);havoc ~__tmp_76~0;~__tmp_76~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~75;~__VERIFIER_assert__cond~75 := ~__tmp_76~0; {23691#(<= 30 main_~main__t~0)} is VALID [2022-04-27 10:46:21,923 INFO L290 TraceCheckUtils]: 130: Hoare triple {23691#(<= 30 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~75);~main____CPAchecker_TMP_1~30 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23692#(<= 31 main_~main__t~0)} is VALID [2022-04-27 10:46:21,924 INFO L290 TraceCheckUtils]: 131: Hoare triple {23692#(<= 31 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~31;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~main____CPAchecker_TMP_0~31 := #t~nondet39;havoc #t~nondet39; {23692#(<= 31 main_~main__t~0)} is VALID [2022-04-27 10:46:21,924 INFO L290 TraceCheckUtils]: 132: Hoare triple {23692#(<= 31 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~31);havoc ~__tmp_77~0;~__tmp_77~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~76;~__VERIFIER_assert__cond~76 := ~__tmp_77~0; {23692#(<= 31 main_~main__t~0)} is VALID [2022-04-27 10:46:21,925 INFO L290 TraceCheckUtils]: 133: Hoare triple {23692#(<= 31 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~76);havoc ~__tmp_78~0;~__tmp_78~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~77;~__VERIFIER_assert__cond~77 := ~__tmp_78~0; {23692#(<= 31 main_~main__t~0)} is VALID [2022-04-27 10:46:21,925 INFO L290 TraceCheckUtils]: 134: Hoare triple {23692#(<= 31 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~77);~main____CPAchecker_TMP_1~31 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23693#(<= 32 main_~main__t~0)} is VALID [2022-04-27 10:46:21,925 INFO L290 TraceCheckUtils]: 135: Hoare triple {23693#(<= 32 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~32;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~main____CPAchecker_TMP_0~32 := #t~nondet40;havoc #t~nondet40; {23693#(<= 32 main_~main__t~0)} is VALID [2022-04-27 10:46:21,926 INFO L290 TraceCheckUtils]: 136: Hoare triple {23693#(<= 32 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~32);havoc ~__tmp_79~0;~__tmp_79~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~78;~__VERIFIER_assert__cond~78 := ~__tmp_79~0; {23693#(<= 32 main_~main__t~0)} is VALID [2022-04-27 10:46:21,926 INFO L290 TraceCheckUtils]: 137: Hoare triple {23693#(<= 32 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~78);havoc ~__tmp_80~0;~__tmp_80~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~79;~__VERIFIER_assert__cond~79 := ~__tmp_80~0; {23693#(<= 32 main_~main__t~0)} is VALID [2022-04-27 10:46:21,926 INFO L290 TraceCheckUtils]: 138: Hoare triple {23693#(<= 32 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~79);~main____CPAchecker_TMP_1~32 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23694#(<= 33 main_~main__t~0)} is VALID [2022-04-27 10:46:21,926 INFO L290 TraceCheckUtils]: 139: Hoare triple {23694#(<= 33 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~33;assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~main____CPAchecker_TMP_0~33 := #t~nondet41;havoc #t~nondet41; {23694#(<= 33 main_~main__t~0)} is VALID [2022-04-27 10:46:21,927 INFO L290 TraceCheckUtils]: 140: Hoare triple {23694#(<= 33 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~33);havoc ~__tmp_81~0;~__tmp_81~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~80;~__VERIFIER_assert__cond~80 := ~__tmp_81~0; {23694#(<= 33 main_~main__t~0)} is VALID [2022-04-27 10:46:21,927 INFO L290 TraceCheckUtils]: 141: Hoare triple {23694#(<= 33 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~80);havoc ~__tmp_82~0;~__tmp_82~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~81;~__VERIFIER_assert__cond~81 := ~__tmp_82~0; {23694#(<= 33 main_~main__t~0)} is VALID [2022-04-27 10:46:21,927 INFO L290 TraceCheckUtils]: 142: Hoare triple {23694#(<= 33 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~81);~main____CPAchecker_TMP_1~33 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23695#(<= 34 main_~main__t~0)} is VALID [2022-04-27 10:46:21,928 INFO L290 TraceCheckUtils]: 143: Hoare triple {23695#(<= 34 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~34;assume -2147483648 <= #t~nondet42 && #t~nondet42 <= 2147483647;~main____CPAchecker_TMP_0~34 := #t~nondet42;havoc #t~nondet42; {23695#(<= 34 main_~main__t~0)} is VALID [2022-04-27 10:46:21,931 INFO L290 TraceCheckUtils]: 144: Hoare triple {23695#(<= 34 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~34);havoc ~__tmp_83~0;~__tmp_83~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~82;~__VERIFIER_assert__cond~82 := ~__tmp_83~0; {23695#(<= 34 main_~main__t~0)} is VALID [2022-04-27 10:46:21,931 INFO L290 TraceCheckUtils]: 145: Hoare triple {23695#(<= 34 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~82);havoc ~__tmp_84~0;~__tmp_84~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~83;~__VERIFIER_assert__cond~83 := ~__tmp_84~0; {23695#(<= 34 main_~main__t~0)} is VALID [2022-04-27 10:46:21,931 INFO L290 TraceCheckUtils]: 146: Hoare triple {23695#(<= 34 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~83);~main____CPAchecker_TMP_1~34 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23696#(<= 35 main_~main__t~0)} is VALID [2022-04-27 10:46:21,932 INFO L290 TraceCheckUtils]: 147: Hoare triple {23696#(<= 35 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~35;assume -2147483648 <= #t~nondet43 && #t~nondet43 <= 2147483647;~main____CPAchecker_TMP_0~35 := #t~nondet43;havoc #t~nondet43; {23696#(<= 35 main_~main__t~0)} is VALID [2022-04-27 10:46:21,932 INFO L290 TraceCheckUtils]: 148: Hoare triple {23696#(<= 35 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~35);havoc ~__tmp_85~0;~__tmp_85~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~84;~__VERIFIER_assert__cond~84 := ~__tmp_85~0; {23696#(<= 35 main_~main__t~0)} is VALID [2022-04-27 10:46:21,933 INFO L290 TraceCheckUtils]: 149: Hoare triple {23696#(<= 35 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~84);havoc ~__tmp_86~0;~__tmp_86~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~85;~__VERIFIER_assert__cond~85 := ~__tmp_86~0; {23696#(<= 35 main_~main__t~0)} is VALID [2022-04-27 10:46:21,933 INFO L290 TraceCheckUtils]: 150: Hoare triple {23696#(<= 35 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~85);~main____CPAchecker_TMP_1~35 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23697#(<= 36 main_~main__t~0)} is VALID [2022-04-27 10:46:21,933 INFO L290 TraceCheckUtils]: 151: Hoare triple {23697#(<= 36 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~36;assume -2147483648 <= #t~nondet44 && #t~nondet44 <= 2147483647;~main____CPAchecker_TMP_0~36 := #t~nondet44;havoc #t~nondet44; {23697#(<= 36 main_~main__t~0)} is VALID [2022-04-27 10:46:21,934 INFO L290 TraceCheckUtils]: 152: Hoare triple {23697#(<= 36 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~36);havoc ~__tmp_87~0;~__tmp_87~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~86;~__VERIFIER_assert__cond~86 := ~__tmp_87~0; {23697#(<= 36 main_~main__t~0)} is VALID [2022-04-27 10:46:21,934 INFO L290 TraceCheckUtils]: 153: Hoare triple {23697#(<= 36 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~86);havoc ~__tmp_88~0;~__tmp_88~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~87;~__VERIFIER_assert__cond~87 := ~__tmp_88~0; {23697#(<= 36 main_~main__t~0)} is VALID [2022-04-27 10:46:21,934 INFO L290 TraceCheckUtils]: 154: Hoare triple {23697#(<= 36 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~87);~main____CPAchecker_TMP_1~36 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23698#(<= 37 main_~main__t~0)} is VALID [2022-04-27 10:46:21,934 INFO L290 TraceCheckUtils]: 155: Hoare triple {23698#(<= 37 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~37;assume -2147483648 <= #t~nondet45 && #t~nondet45 <= 2147483647;~main____CPAchecker_TMP_0~37 := #t~nondet45;havoc #t~nondet45; {23698#(<= 37 main_~main__t~0)} is VALID [2022-04-27 10:46:21,935 INFO L290 TraceCheckUtils]: 156: Hoare triple {23698#(<= 37 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~37);havoc ~__tmp_89~0;~__tmp_89~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~88;~__VERIFIER_assert__cond~88 := ~__tmp_89~0; {23698#(<= 37 main_~main__t~0)} is VALID [2022-04-27 10:46:21,935 INFO L290 TraceCheckUtils]: 157: Hoare triple {23698#(<= 37 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~88);havoc ~__tmp_90~0;~__tmp_90~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~89;~__VERIFIER_assert__cond~89 := ~__tmp_90~0; {23698#(<= 37 main_~main__t~0)} is VALID [2022-04-27 10:46:21,935 INFO L290 TraceCheckUtils]: 158: Hoare triple {23698#(<= 37 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~89);~main____CPAchecker_TMP_1~37 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23699#(<= 38 main_~main__t~0)} is VALID [2022-04-27 10:46:21,936 INFO L290 TraceCheckUtils]: 159: Hoare triple {23699#(<= 38 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~38;assume -2147483648 <= #t~nondet46 && #t~nondet46 <= 2147483647;~main____CPAchecker_TMP_0~38 := #t~nondet46;havoc #t~nondet46; {23699#(<= 38 main_~main__t~0)} is VALID [2022-04-27 10:46:21,936 INFO L290 TraceCheckUtils]: 160: Hoare triple {23699#(<= 38 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~38);havoc ~__tmp_91~0;~__tmp_91~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~90;~__VERIFIER_assert__cond~90 := ~__tmp_91~0; {23699#(<= 38 main_~main__t~0)} is VALID [2022-04-27 10:46:21,936 INFO L290 TraceCheckUtils]: 161: Hoare triple {23699#(<= 38 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~90);havoc ~__tmp_92~0;~__tmp_92~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~91;~__VERIFIER_assert__cond~91 := ~__tmp_92~0; {23699#(<= 38 main_~main__t~0)} is VALID [2022-04-27 10:46:21,936 INFO L290 TraceCheckUtils]: 162: Hoare triple {23699#(<= 38 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~91);~main____CPAchecker_TMP_1~38 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23700#(<= 39 main_~main__t~0)} is VALID [2022-04-27 10:46:21,937 INFO L290 TraceCheckUtils]: 163: Hoare triple {23700#(<= 39 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~39;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~main____CPAchecker_TMP_0~39 := #t~nondet47;havoc #t~nondet47; {23700#(<= 39 main_~main__t~0)} is VALID [2022-04-27 10:46:21,937 INFO L290 TraceCheckUtils]: 164: Hoare triple {23700#(<= 39 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~39);havoc ~__tmp_93~0;~__tmp_93~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~92;~__VERIFIER_assert__cond~92 := ~__tmp_93~0; {23700#(<= 39 main_~main__t~0)} is VALID [2022-04-27 10:46:21,937 INFO L290 TraceCheckUtils]: 165: Hoare triple {23700#(<= 39 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~92);havoc ~__tmp_94~0;~__tmp_94~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~93;~__VERIFIER_assert__cond~93 := ~__tmp_94~0; {23700#(<= 39 main_~main__t~0)} is VALID [2022-04-27 10:46:21,945 INFO L290 TraceCheckUtils]: 166: Hoare triple {23700#(<= 39 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~93);~main____CPAchecker_TMP_1~39 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23701#(<= 40 main_~main__t~0)} is VALID [2022-04-27 10:46:21,946 INFO L290 TraceCheckUtils]: 167: Hoare triple {23701#(<= 40 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~40;assume -2147483648 <= #t~nondet48 && #t~nondet48 <= 2147483647;~main____CPAchecker_TMP_0~40 := #t~nondet48;havoc #t~nondet48; {23701#(<= 40 main_~main__t~0)} is VALID [2022-04-27 10:46:21,946 INFO L290 TraceCheckUtils]: 168: Hoare triple {23701#(<= 40 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~40);havoc ~__tmp_95~0;~__tmp_95~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~94;~__VERIFIER_assert__cond~94 := ~__tmp_95~0; {23701#(<= 40 main_~main__t~0)} is VALID [2022-04-27 10:46:21,946 INFO L290 TraceCheckUtils]: 169: Hoare triple {23701#(<= 40 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~94);havoc ~__tmp_96~0;~__tmp_96~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~95;~__VERIFIER_assert__cond~95 := ~__tmp_96~0; {23701#(<= 40 main_~main__t~0)} is VALID [2022-04-27 10:46:21,947 INFO L290 TraceCheckUtils]: 170: Hoare triple {23701#(<= 40 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~95);~main____CPAchecker_TMP_1~40 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23702#(<= 41 main_~main__t~0)} is VALID [2022-04-27 10:46:21,947 INFO L290 TraceCheckUtils]: 171: Hoare triple {23702#(<= 41 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~41;assume -2147483648 <= #t~nondet49 && #t~nondet49 <= 2147483647;~main____CPAchecker_TMP_0~41 := #t~nondet49;havoc #t~nondet49; {23702#(<= 41 main_~main__t~0)} is VALID [2022-04-27 10:46:21,947 INFO L290 TraceCheckUtils]: 172: Hoare triple {23702#(<= 41 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~41);havoc ~__tmp_97~0;~__tmp_97~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~96;~__VERIFIER_assert__cond~96 := ~__tmp_97~0; {23702#(<= 41 main_~main__t~0)} is VALID [2022-04-27 10:46:21,948 INFO L290 TraceCheckUtils]: 173: Hoare triple {23702#(<= 41 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~96);havoc ~__tmp_98~0;~__tmp_98~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~97;~__VERIFIER_assert__cond~97 := ~__tmp_98~0; {23702#(<= 41 main_~main__t~0)} is VALID [2022-04-27 10:46:21,948 INFO L290 TraceCheckUtils]: 174: Hoare triple {23702#(<= 41 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~97);~main____CPAchecker_TMP_1~41 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23703#(<= 42 main_~main__t~0)} is VALID [2022-04-27 10:46:21,948 INFO L290 TraceCheckUtils]: 175: Hoare triple {23703#(<= 42 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~42;assume -2147483648 <= #t~nondet50 && #t~nondet50 <= 2147483647;~main____CPAchecker_TMP_0~42 := #t~nondet50;havoc #t~nondet50; {23703#(<= 42 main_~main__t~0)} is VALID [2022-04-27 10:46:21,949 INFO L290 TraceCheckUtils]: 176: Hoare triple {23703#(<= 42 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~42);havoc ~__tmp_99~0;~__tmp_99~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~98;~__VERIFIER_assert__cond~98 := ~__tmp_99~0; {23703#(<= 42 main_~main__t~0)} is VALID [2022-04-27 10:46:21,949 INFO L290 TraceCheckUtils]: 177: Hoare triple {23703#(<= 42 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~98);havoc ~__tmp_100~0;~__tmp_100~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~99;~__VERIFIER_assert__cond~99 := ~__tmp_100~0; {23703#(<= 42 main_~main__t~0)} is VALID [2022-04-27 10:46:21,949 INFO L290 TraceCheckUtils]: 178: Hoare triple {23703#(<= 42 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~99);~main____CPAchecker_TMP_1~42 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23704#(<= 43 main_~main__t~0)} is VALID [2022-04-27 10:46:21,949 INFO L290 TraceCheckUtils]: 179: Hoare triple {23704#(<= 43 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~43;assume -2147483648 <= #t~nondet51 && #t~nondet51 <= 2147483647;~main____CPAchecker_TMP_0~43 := #t~nondet51;havoc #t~nondet51; {23704#(<= 43 main_~main__t~0)} is VALID [2022-04-27 10:46:21,950 INFO L290 TraceCheckUtils]: 180: Hoare triple {23704#(<= 43 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~43);havoc ~__tmp_101~0;~__tmp_101~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~100;~__VERIFIER_assert__cond~100 := ~__tmp_101~0; {23704#(<= 43 main_~main__t~0)} is VALID [2022-04-27 10:46:21,950 INFO L290 TraceCheckUtils]: 181: Hoare triple {23704#(<= 43 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~100);havoc ~__tmp_102~0;~__tmp_102~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~101;~__VERIFIER_assert__cond~101 := ~__tmp_102~0; {23704#(<= 43 main_~main__t~0)} is VALID [2022-04-27 10:46:21,950 INFO L290 TraceCheckUtils]: 182: Hoare triple {23704#(<= 43 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~101);~main____CPAchecker_TMP_1~43 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23705#(<= 44 main_~main__t~0)} is VALID [2022-04-27 10:46:21,951 INFO L290 TraceCheckUtils]: 183: Hoare triple {23705#(<= 44 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~44;assume -2147483648 <= #t~nondet52 && #t~nondet52 <= 2147483647;~main____CPAchecker_TMP_0~44 := #t~nondet52;havoc #t~nondet52; {23705#(<= 44 main_~main__t~0)} is VALID [2022-04-27 10:46:21,951 INFO L290 TraceCheckUtils]: 184: Hoare triple {23705#(<= 44 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~44);havoc ~__tmp_103~0;~__tmp_103~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~102;~__VERIFIER_assert__cond~102 := ~__tmp_103~0; {23705#(<= 44 main_~main__t~0)} is VALID [2022-04-27 10:46:21,951 INFO L290 TraceCheckUtils]: 185: Hoare triple {23705#(<= 44 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~102);havoc ~__tmp_104~0;~__tmp_104~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~103;~__VERIFIER_assert__cond~103 := ~__tmp_104~0; {23705#(<= 44 main_~main__t~0)} is VALID [2022-04-27 10:46:21,951 INFO L290 TraceCheckUtils]: 186: Hoare triple {23705#(<= 44 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~103);~main____CPAchecker_TMP_1~44 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23706#(<= 45 main_~main__t~0)} is VALID [2022-04-27 10:46:21,952 INFO L290 TraceCheckUtils]: 187: Hoare triple {23706#(<= 45 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~45;assume -2147483648 <= #t~nondet53 && #t~nondet53 <= 2147483647;~main____CPAchecker_TMP_0~45 := #t~nondet53;havoc #t~nondet53; {23706#(<= 45 main_~main__t~0)} is VALID [2022-04-27 10:46:21,952 INFO L290 TraceCheckUtils]: 188: Hoare triple {23706#(<= 45 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~45);havoc ~__tmp_105~0;~__tmp_105~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~104;~__VERIFIER_assert__cond~104 := ~__tmp_105~0; {23706#(<= 45 main_~main__t~0)} is VALID [2022-04-27 10:46:21,952 INFO L290 TraceCheckUtils]: 189: Hoare triple {23706#(<= 45 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~104);havoc ~__tmp_106~0;~__tmp_106~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~105;~__VERIFIER_assert__cond~105 := ~__tmp_106~0; {23706#(<= 45 main_~main__t~0)} is VALID [2022-04-27 10:46:21,953 INFO L290 TraceCheckUtils]: 190: Hoare triple {23706#(<= 45 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~105);~main____CPAchecker_TMP_1~45 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23707#(<= 46 main_~main__t~0)} is VALID [2022-04-27 10:46:21,953 INFO L290 TraceCheckUtils]: 191: Hoare triple {23707#(<= 46 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~46;assume -2147483648 <= #t~nondet54 && #t~nondet54 <= 2147483647;~main____CPAchecker_TMP_0~46 := #t~nondet54;havoc #t~nondet54; {23707#(<= 46 main_~main__t~0)} is VALID [2022-04-27 10:46:21,953 INFO L290 TraceCheckUtils]: 192: Hoare triple {23707#(<= 46 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~46);havoc ~__tmp_107~0;~__tmp_107~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~106;~__VERIFIER_assert__cond~106 := ~__tmp_107~0; {23707#(<= 46 main_~main__t~0)} is VALID [2022-04-27 10:46:21,953 INFO L290 TraceCheckUtils]: 193: Hoare triple {23707#(<= 46 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~106);havoc ~__tmp_108~0;~__tmp_108~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~107;~__VERIFIER_assert__cond~107 := ~__tmp_108~0; {23707#(<= 46 main_~main__t~0)} is VALID [2022-04-27 10:46:21,954 INFO L290 TraceCheckUtils]: 194: Hoare triple {23707#(<= 46 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~107);~main____CPAchecker_TMP_1~46 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23708#(<= 47 main_~main__t~0)} is VALID [2022-04-27 10:46:21,954 INFO L290 TraceCheckUtils]: 195: Hoare triple {23708#(<= 47 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~47;assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~main____CPAchecker_TMP_0~47 := #t~nondet55;havoc #t~nondet55; {23708#(<= 47 main_~main__t~0)} is VALID [2022-04-27 10:46:21,954 INFO L290 TraceCheckUtils]: 196: Hoare triple {23708#(<= 47 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~47);havoc ~__tmp_109~0;~__tmp_109~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~108;~__VERIFIER_assert__cond~108 := ~__tmp_109~0; {23708#(<= 47 main_~main__t~0)} is VALID [2022-04-27 10:46:21,955 INFO L290 TraceCheckUtils]: 197: Hoare triple {23708#(<= 47 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~108);havoc ~__tmp_110~0;~__tmp_110~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~109;~__VERIFIER_assert__cond~109 := ~__tmp_110~0; {23708#(<= 47 main_~main__t~0)} is VALID [2022-04-27 10:46:21,957 INFO L290 TraceCheckUtils]: 198: Hoare triple {23708#(<= 47 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~109);~main____CPAchecker_TMP_1~47 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23709#(<= 48 main_~main__t~0)} is VALID [2022-04-27 10:46:21,957 INFO L290 TraceCheckUtils]: 199: Hoare triple {23709#(<= 48 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~48;assume -2147483648 <= #t~nondet56 && #t~nondet56 <= 2147483647;~main____CPAchecker_TMP_0~48 := #t~nondet56;havoc #t~nondet56; {23709#(<= 48 main_~main__t~0)} is VALID [2022-04-27 10:46:21,957 INFO L290 TraceCheckUtils]: 200: Hoare triple {23709#(<= 48 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~48);havoc ~__tmp_111~0;~__tmp_111~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~110;~__VERIFIER_assert__cond~110 := ~__tmp_111~0; {23709#(<= 48 main_~main__t~0)} is VALID [2022-04-27 10:46:21,958 INFO L290 TraceCheckUtils]: 201: Hoare triple {23709#(<= 48 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~110);havoc ~__tmp_112~0;~__tmp_112~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~111;~__VERIFIER_assert__cond~111 := ~__tmp_112~0; {23709#(<= 48 main_~main__t~0)} is VALID [2022-04-27 10:46:21,958 INFO L290 TraceCheckUtils]: 202: Hoare triple {23709#(<= 48 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~111);~main____CPAchecker_TMP_1~48 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23710#(<= 49 main_~main__t~0)} is VALID [2022-04-27 10:46:21,961 INFO L290 TraceCheckUtils]: 203: Hoare triple {23710#(<= 49 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~49;assume -2147483648 <= #t~nondet57 && #t~nondet57 <= 2147483647;~main____CPAchecker_TMP_0~49 := #t~nondet57;havoc #t~nondet57; {23710#(<= 49 main_~main__t~0)} is VALID [2022-04-27 10:46:21,961 INFO L290 TraceCheckUtils]: 204: Hoare triple {23710#(<= 49 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~49);havoc ~__tmp_113~0;~__tmp_113~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~112;~__VERIFIER_assert__cond~112 := ~__tmp_113~0; {23710#(<= 49 main_~main__t~0)} is VALID [2022-04-27 10:46:21,962 INFO L290 TraceCheckUtils]: 205: Hoare triple {23710#(<= 49 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~112);havoc ~__tmp_114~0;~__tmp_114~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~113;~__VERIFIER_assert__cond~113 := ~__tmp_114~0; {23710#(<= 49 main_~main__t~0)} is VALID [2022-04-27 10:46:21,962 INFO L290 TraceCheckUtils]: 206: Hoare triple {23710#(<= 49 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~113);~main____CPAchecker_TMP_1~49 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23711#(<= 50 main_~main__t~0)} is VALID [2022-04-27 10:46:21,962 INFO L290 TraceCheckUtils]: 207: Hoare triple {23711#(<= 50 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~50;assume -2147483648 <= #t~nondet58 && #t~nondet58 <= 2147483647;~main____CPAchecker_TMP_0~50 := #t~nondet58;havoc #t~nondet58; {23711#(<= 50 main_~main__t~0)} is VALID [2022-04-27 10:46:21,963 INFO L290 TraceCheckUtils]: 208: Hoare triple {23711#(<= 50 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~50);havoc ~__tmp_115~0;~__tmp_115~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~114;~__VERIFIER_assert__cond~114 := ~__tmp_115~0; {23711#(<= 50 main_~main__t~0)} is VALID [2022-04-27 10:46:21,963 INFO L290 TraceCheckUtils]: 209: Hoare triple {23711#(<= 50 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~114);havoc ~__tmp_116~0;~__tmp_116~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~115;~__VERIFIER_assert__cond~115 := ~__tmp_116~0; {23711#(<= 50 main_~main__t~0)} is VALID [2022-04-27 10:46:21,963 INFO L290 TraceCheckUtils]: 210: Hoare triple {23711#(<= 50 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~115);~main____CPAchecker_TMP_1~50 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23712#(<= 51 main_~main__t~0)} is VALID [2022-04-27 10:46:21,964 INFO L290 TraceCheckUtils]: 211: Hoare triple {23712#(<= 51 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~51;assume -2147483648 <= #t~nondet59 && #t~nondet59 <= 2147483647;~main____CPAchecker_TMP_0~51 := #t~nondet59;havoc #t~nondet59; {23712#(<= 51 main_~main__t~0)} is VALID [2022-04-27 10:46:21,964 INFO L290 TraceCheckUtils]: 212: Hoare triple {23712#(<= 51 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~51);havoc ~__tmp_117~0;~__tmp_117~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~116;~__VERIFIER_assert__cond~116 := ~__tmp_117~0; {23712#(<= 51 main_~main__t~0)} is VALID [2022-04-27 10:46:21,964 INFO L290 TraceCheckUtils]: 213: Hoare triple {23712#(<= 51 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~116);havoc ~__tmp_118~0;~__tmp_118~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~117;~__VERIFIER_assert__cond~117 := ~__tmp_118~0; {23712#(<= 51 main_~main__t~0)} is VALID [2022-04-27 10:46:21,964 INFO L290 TraceCheckUtils]: 214: Hoare triple {23712#(<= 51 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~117);~main____CPAchecker_TMP_1~51 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23713#(<= 52 main_~main__t~0)} is VALID [2022-04-27 10:46:21,965 INFO L290 TraceCheckUtils]: 215: Hoare triple {23713#(<= 52 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~52;assume -2147483648 <= #t~nondet60 && #t~nondet60 <= 2147483647;~main____CPAchecker_TMP_0~52 := #t~nondet60;havoc #t~nondet60; {23713#(<= 52 main_~main__t~0)} is VALID [2022-04-27 10:46:21,965 INFO L290 TraceCheckUtils]: 216: Hoare triple {23713#(<= 52 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~52);havoc ~__tmp_119~0;~__tmp_119~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~118;~__VERIFIER_assert__cond~118 := ~__tmp_119~0; {23713#(<= 52 main_~main__t~0)} is VALID [2022-04-27 10:46:21,965 INFO L290 TraceCheckUtils]: 217: Hoare triple {23713#(<= 52 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~118);havoc ~__tmp_120~0;~__tmp_120~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~119;~__VERIFIER_assert__cond~119 := ~__tmp_120~0; {23713#(<= 52 main_~main__t~0)} is VALID [2022-04-27 10:46:21,966 INFO L290 TraceCheckUtils]: 218: Hoare triple {23713#(<= 52 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~119);~main____CPAchecker_TMP_1~52 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23714#(<= 53 main_~main__t~0)} is VALID [2022-04-27 10:46:21,966 INFO L290 TraceCheckUtils]: 219: Hoare triple {23714#(<= 53 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~53;assume -2147483648 <= #t~nondet61 && #t~nondet61 <= 2147483647;~main____CPAchecker_TMP_0~53 := #t~nondet61;havoc #t~nondet61; {23714#(<= 53 main_~main__t~0)} is VALID [2022-04-27 10:46:21,966 INFO L290 TraceCheckUtils]: 220: Hoare triple {23714#(<= 53 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~53);havoc ~__tmp_121~0;~__tmp_121~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~120;~__VERIFIER_assert__cond~120 := ~__tmp_121~0; {23714#(<= 53 main_~main__t~0)} is VALID [2022-04-27 10:46:21,966 INFO L290 TraceCheckUtils]: 221: Hoare triple {23714#(<= 53 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~120);havoc ~__tmp_122~0;~__tmp_122~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~121;~__VERIFIER_assert__cond~121 := ~__tmp_122~0; {23714#(<= 53 main_~main__t~0)} is VALID [2022-04-27 10:46:21,967 INFO L290 TraceCheckUtils]: 222: Hoare triple {23714#(<= 53 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~121);~main____CPAchecker_TMP_1~53 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23715#(<= 54 main_~main__t~0)} is VALID [2022-04-27 10:46:21,967 INFO L290 TraceCheckUtils]: 223: Hoare triple {23715#(<= 54 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~54;assume -2147483648 <= #t~nondet62 && #t~nondet62 <= 2147483647;~main____CPAchecker_TMP_0~54 := #t~nondet62;havoc #t~nondet62; {23715#(<= 54 main_~main__t~0)} is VALID [2022-04-27 10:46:21,967 INFO L290 TraceCheckUtils]: 224: Hoare triple {23715#(<= 54 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~54);havoc ~__tmp_123~0;~__tmp_123~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~122;~__VERIFIER_assert__cond~122 := ~__tmp_123~0; {23715#(<= 54 main_~main__t~0)} is VALID [2022-04-27 10:46:21,968 INFO L290 TraceCheckUtils]: 225: Hoare triple {23715#(<= 54 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~122);havoc ~__tmp_124~0;~__tmp_124~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~123;~__VERIFIER_assert__cond~123 := ~__tmp_124~0; {23715#(<= 54 main_~main__t~0)} is VALID [2022-04-27 10:46:21,968 INFO L290 TraceCheckUtils]: 226: Hoare triple {23715#(<= 54 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~123);~main____CPAchecker_TMP_1~54 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23716#(<= 55 main_~main__t~0)} is VALID [2022-04-27 10:46:21,968 INFO L290 TraceCheckUtils]: 227: Hoare triple {23716#(<= 55 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~55;assume -2147483648 <= #t~nondet63 && #t~nondet63 <= 2147483647;~main____CPAchecker_TMP_0~55 := #t~nondet63;havoc #t~nondet63; {23716#(<= 55 main_~main__t~0)} is VALID [2022-04-27 10:46:21,968 INFO L290 TraceCheckUtils]: 228: Hoare triple {23716#(<= 55 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~55);havoc ~__tmp_125~0;~__tmp_125~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~124;~__VERIFIER_assert__cond~124 := ~__tmp_125~0; {23716#(<= 55 main_~main__t~0)} is VALID [2022-04-27 10:46:21,969 INFO L290 TraceCheckUtils]: 229: Hoare triple {23716#(<= 55 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~124);havoc ~__tmp_126~0;~__tmp_126~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~125;~__VERIFIER_assert__cond~125 := ~__tmp_126~0; {23716#(<= 55 main_~main__t~0)} is VALID [2022-04-27 10:46:21,969 INFO L290 TraceCheckUtils]: 230: Hoare triple {23716#(<= 55 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~125);~main____CPAchecker_TMP_1~55 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23717#(<= 56 main_~main__t~0)} is VALID [2022-04-27 10:46:21,969 INFO L290 TraceCheckUtils]: 231: Hoare triple {23717#(<= 56 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~56;assume -2147483648 <= #t~nondet64 && #t~nondet64 <= 2147483647;~main____CPAchecker_TMP_0~56 := #t~nondet64;havoc #t~nondet64; {23717#(<= 56 main_~main__t~0)} is VALID [2022-04-27 10:46:21,970 INFO L290 TraceCheckUtils]: 232: Hoare triple {23717#(<= 56 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~56);havoc ~__tmp_127~0;~__tmp_127~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~126;~__VERIFIER_assert__cond~126 := ~__tmp_127~0; {23717#(<= 56 main_~main__t~0)} is VALID [2022-04-27 10:46:21,970 INFO L290 TraceCheckUtils]: 233: Hoare triple {23717#(<= 56 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~126);havoc ~__tmp_128~0;~__tmp_128~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~127;~__VERIFIER_assert__cond~127 := ~__tmp_128~0; {23717#(<= 56 main_~main__t~0)} is VALID [2022-04-27 10:46:21,970 INFO L290 TraceCheckUtils]: 234: Hoare triple {23717#(<= 56 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~127);~main____CPAchecker_TMP_1~56 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23718#(<= 57 main_~main__t~0)} is VALID [2022-04-27 10:46:21,970 INFO L290 TraceCheckUtils]: 235: Hoare triple {23718#(<= 57 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~57;assume -2147483648 <= #t~nondet65 && #t~nondet65 <= 2147483647;~main____CPAchecker_TMP_0~57 := #t~nondet65;havoc #t~nondet65; {23718#(<= 57 main_~main__t~0)} is VALID [2022-04-27 10:46:21,971 INFO L290 TraceCheckUtils]: 236: Hoare triple {23718#(<= 57 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~57);havoc ~__tmp_129~0;~__tmp_129~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~128;~__VERIFIER_assert__cond~128 := ~__tmp_129~0; {23718#(<= 57 main_~main__t~0)} is VALID [2022-04-27 10:46:21,971 INFO L290 TraceCheckUtils]: 237: Hoare triple {23718#(<= 57 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~128);havoc ~__tmp_130~0;~__tmp_130~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~129;~__VERIFIER_assert__cond~129 := ~__tmp_130~0; {23718#(<= 57 main_~main__t~0)} is VALID [2022-04-27 10:46:21,971 INFO L290 TraceCheckUtils]: 238: Hoare triple {23718#(<= 57 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~129);~main____CPAchecker_TMP_1~57 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23719#(<= 58 main_~main__t~0)} is VALID [2022-04-27 10:46:21,972 INFO L290 TraceCheckUtils]: 239: Hoare triple {23719#(<= 58 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~58;assume -2147483648 <= #t~nondet66 && #t~nondet66 <= 2147483647;~main____CPAchecker_TMP_0~58 := #t~nondet66;havoc #t~nondet66; {23719#(<= 58 main_~main__t~0)} is VALID [2022-04-27 10:46:21,972 INFO L290 TraceCheckUtils]: 240: Hoare triple {23719#(<= 58 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~58);havoc ~__tmp_131~0;~__tmp_131~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~130;~__VERIFIER_assert__cond~130 := ~__tmp_131~0; {23719#(<= 58 main_~main__t~0)} is VALID [2022-04-27 10:46:21,972 INFO L290 TraceCheckUtils]: 241: Hoare triple {23719#(<= 58 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~130);havoc ~__tmp_132~0;~__tmp_132~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~131;~__VERIFIER_assert__cond~131 := ~__tmp_132~0; {23719#(<= 58 main_~main__t~0)} is VALID [2022-04-27 10:46:21,973 INFO L290 TraceCheckUtils]: 242: Hoare triple {23719#(<= 58 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~131);~main____CPAchecker_TMP_1~58 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {23720#(<= 59 main_~main__t~0)} is VALID [2022-04-27 10:46:21,973 INFO L290 TraceCheckUtils]: 243: Hoare triple {23720#(<= 59 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~59;assume -2147483648 <= #t~nondet67 && #t~nondet67 <= 2147483647;~main____CPAchecker_TMP_0~59 := #t~nondet67;havoc #t~nondet67; {23720#(<= 59 main_~main__t~0)} is VALID [2022-04-27 10:46:21,973 INFO L290 TraceCheckUtils]: 244: Hoare triple {23720#(<= 59 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~59);~__tmp_3904_0~0 := ~main____CPAchecker_TMP_0~59;~__tmp_3904_1~0 := ~main____CPAchecker_TMP_1~58; {23720#(<= 59 main_~main__t~0)} is VALID [2022-04-27 10:46:21,973 INFO L290 TraceCheckUtils]: 245: Hoare triple {23720#(<= 59 main_~main__t~0)} ~main____CPAchecker_TMP_0~59 := ~__tmp_3904_0~0;~main____CPAchecker_TMP_1~58 := ~__tmp_3904_1~0;havoc ~__tmp_133~0;~__tmp_133~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~132;~__VERIFIER_assert__cond~132 := ~__tmp_133~0; {23721#(not (= main_~__VERIFIER_assert__cond~132 0))} is VALID [2022-04-27 10:46:21,974 INFO L290 TraceCheckUtils]: 246: Hoare triple {23721#(not (= main_~__VERIFIER_assert__cond~132 0))} assume 0 == ~__VERIFIER_assert__cond~132; {23657#false} is VALID [2022-04-27 10:46:21,974 INFO L290 TraceCheckUtils]: 247: Hoare triple {23657#false} assume !false; {23657#false} is VALID [2022-04-27 10:46:21,974 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 10:46:21,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:21,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075163716] [2022-04-27 10:46:21,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075163716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:21,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:21,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-27 10:46:21,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895516299] [2022-04-27 10:46:21,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:21,976 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.828125) internal successors, (245), 63 states have internal predecessors, (245), 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 248 [2022-04-27 10:46:21,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:21,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 3.828125) internal successors, (245), 63 states have internal predecessors, (245), 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 10:46:22,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:22,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-27 10:46:22,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:22,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-27 10:46:22,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1836, Invalid=2196, Unknown=0, NotChecked=0, Total=4032 [2022-04-27 10:46:22,127 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand has 64 states, 64 states have (on average 3.828125) internal successors, (245), 63 states have internal predecessors, (245), 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 10:46:26,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:26,189 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2022-04-27 10:46:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-27 10:46:26,190 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.828125) internal successors, (245), 63 states have internal predecessors, (245), 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 248 [2022-04-27 10:46:26,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 3.828125) internal successors, (245), 63 states have internal predecessors, (245), 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 10:46:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 255 transitions. [2022-04-27 10:46:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 3.828125) internal successors, (245), 63 states have internal predecessors, (245), 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 10:46:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 255 transitions. [2022-04-27 10:46:26,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 255 transitions. [2022-04-27 10:46:26,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:26,430 INFO L225 Difference]: With dead ends: 255 [2022-04-27 10:46:26,430 INFO L226 Difference]: Without dead ends: 253 [2022-04-27 10:46:26,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=5560, Invalid=9940, Unknown=0, NotChecked=0, Total=15500 [2022-04-27 10:46:26,434 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 922 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:26,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 41 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-27 10:46:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-27 10:46:26,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2022-04-27 10:46:26,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:26,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 252 states, 248 states have (on average 1.0040322580645162) internal successors, (249), 248 states have internal predecessors, (249), 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 10:46:26,455 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 252 states, 248 states have (on average 1.0040322580645162) internal successors, (249), 248 states have internal predecessors, (249), 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 10:46:26,455 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 252 states, 248 states have (on average 1.0040322580645162) internal successors, (249), 248 states have internal predecessors, (249), 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 10:46:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:26,457 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2022-04-27 10:46:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2022-04-27 10:46:26,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:26,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:26,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 248 states have (on average 1.0040322580645162) internal successors, (249), 248 states have internal predecessors, (249), 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 253 states. [2022-04-27 10:46:26,458 INFO L87 Difference]: Start difference. First operand has 252 states, 248 states have (on average 1.0040322580645162) internal successors, (249), 248 states have internal predecessors, (249), 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 253 states. [2022-04-27 10:46:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:26,460 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2022-04-27 10:46:26,460 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2022-04-27 10:46:26,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:26,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:26,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:26,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 248 states have (on average 1.0040322580645162) internal successors, (249), 248 states have internal predecessors, (249), 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 10:46:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2022-04-27 10:46:26,464 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2022-04-27 10:46:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:26,465 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2022-04-27 10:46:26,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.828125) internal successors, (245), 63 states have internal predecessors, (245), 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 10:46:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2022-04-27 10:46:26,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-04-27 10:46:26,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:26,466 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, 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, 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, 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, 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, 1, 1, 1, 1] [2022-04-27 10:46:26,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 10:46:26,467 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:46:26,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:26,467 INFO L85 PathProgramCache]: Analyzing trace with hash 123173085, now seen corresponding path program 1 times [2022-04-27 10:46:26,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:26,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807348755] [2022-04-27 10:46:26,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:26,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:27,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:27,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {24881#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {24871#true} is VALID [2022-04-27 10:46:27,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {24871#true} assume true; {24871#true} is VALID [2022-04-27 10:46:27,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24871#true} {24871#true} #1237#return; {24871#true} is VALID [2022-04-27 10:46:27,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {24871#true} call ULTIMATE.init(); {24881#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:27,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {24881#(and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2609_0~0 := 0;~__tmp_3904_0~0 := 0;~__tmp_3904_1~0 := 0; {24871#true} is VALID [2022-04-27 10:46:27,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {24871#true} assume true; {24871#true} is VALID [2022-04-27 10:46:27,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24871#true} {24871#true} #1237#return; {24871#true} is VALID [2022-04-27 10:46:27,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {24871#true} call #t~ret69 := main(); {24871#true} is VALID [2022-04-27 10:46:27,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {24871#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {24871#true} is VALID [2022-04-27 10:46:27,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {24871#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {24871#true} is VALID [2022-04-27 10:46:27,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {24871#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {24871#true} is VALID [2022-04-27 10:46:27,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {24871#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {24871#true} is VALID [2022-04-27 10:46:27,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {24871#true} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {24871#true} is VALID [2022-04-27 10:46:27,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {24871#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24871#true} is VALID [2022-04-27 10:46:27,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {24871#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {24876#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:27,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {24876#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {24876#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:27,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {24876#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {24877#(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 10:46:27,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {24877#(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)))} assume !(0 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_0~2 := #t~nondet10;havoc #t~nondet10; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~main____CPAchecker_TMP_0~3 := #t~nondet11;havoc #t~nondet11; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_21~0;~__tmp_21~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~main____CPAchecker_TMP_0~4 := #t~nondet12;havoc #t~nondet12; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_23~0;~__tmp_23~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~main____CPAchecker_TMP_0~5 := #t~nondet13;havoc #t~nondet13; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_25~0;~__tmp_25~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~main____CPAchecker_TMP_0~6 := #t~nondet14;havoc #t~nondet14; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_27~0;~__tmp_27~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~main____CPAchecker_TMP_0~7 := #t~nondet15;havoc #t~nondet15; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~7);havoc ~__tmp_29~0;~__tmp_29~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~28;~__VERIFIER_assert__cond~28 := ~__tmp_29~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~28);havoc ~__tmp_30~0;~__tmp_30~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~29;~__VERIFIER_assert__cond~29 := ~__tmp_30~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~29);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,596 INFO L290 TraceCheckUtils]: 39: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~main____CPAchecker_TMP_0~8 := #t~nondet16;havoc #t~nondet16; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,596 INFO L290 TraceCheckUtils]: 40: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~8);havoc ~__tmp_31~0;~__tmp_31~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,596 INFO L290 TraceCheckUtils]: 41: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~30);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~31);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~9;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~main____CPAchecker_TMP_0~9 := #t~nondet17;havoc #t~nondet17; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~9);havoc ~__tmp_33~0;~__tmp_33~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~32;~__VERIFIER_assert__cond~32 := ~__tmp_33~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~32);havoc ~__tmp_34~0;~__tmp_34~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~33;~__VERIFIER_assert__cond~33 := ~__tmp_34~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~33);~main____CPAchecker_TMP_1~9 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,599 INFO L290 TraceCheckUtils]: 47: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~10;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~main____CPAchecker_TMP_0~10 := #t~nondet18;havoc #t~nondet18; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~10);havoc ~__tmp_35~0;~__tmp_35~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,599 INFO L290 TraceCheckUtils]: 49: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,600 INFO L290 TraceCheckUtils]: 50: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~10 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,600 INFO L290 TraceCheckUtils]: 51: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~11;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~main____CPAchecker_TMP_0~11 := #t~nondet19;havoc #t~nondet19; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,600 INFO L290 TraceCheckUtils]: 52: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~11);havoc ~__tmp_37~0;~__tmp_37~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~36;~__VERIFIER_assert__cond~36 := ~__tmp_37~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,601 INFO L290 TraceCheckUtils]: 53: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~36);havoc ~__tmp_38~0;~__tmp_38~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~37;~__VERIFIER_assert__cond~37 := ~__tmp_38~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,601 INFO L290 TraceCheckUtils]: 54: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~37);~main____CPAchecker_TMP_1~11 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,602 INFO L290 TraceCheckUtils]: 55: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~12;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~main____CPAchecker_TMP_0~12 := #t~nondet20;havoc #t~nondet20; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,602 INFO L290 TraceCheckUtils]: 56: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~12);havoc ~__tmp_39~0;~__tmp_39~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,602 INFO L290 TraceCheckUtils]: 57: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,602 INFO L290 TraceCheckUtils]: 58: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~12 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,603 INFO L290 TraceCheckUtils]: 59: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~13;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~main____CPAchecker_TMP_0~13 := #t~nondet21;havoc #t~nondet21; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,603 INFO L290 TraceCheckUtils]: 60: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~13);havoc ~__tmp_41~0;~__tmp_41~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~40;~__VERIFIER_assert__cond~40 := ~__tmp_41~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,603 INFO L290 TraceCheckUtils]: 61: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~40);havoc ~__tmp_42~0;~__tmp_42~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~41;~__VERIFIER_assert__cond~41 := ~__tmp_42~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,604 INFO L290 TraceCheckUtils]: 62: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~41);~main____CPAchecker_TMP_1~13 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,604 INFO L290 TraceCheckUtils]: 63: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~14;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~main____CPAchecker_TMP_0~14 := #t~nondet22;havoc #t~nondet22; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,605 INFO L290 TraceCheckUtils]: 64: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~14);havoc ~__tmp_43~0;~__tmp_43~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,605 INFO L290 TraceCheckUtils]: 65: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,605 INFO L290 TraceCheckUtils]: 66: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~14 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,606 INFO L290 TraceCheckUtils]: 67: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~15;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~main____CPAchecker_TMP_0~15 := #t~nondet23;havoc #t~nondet23; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,606 INFO L290 TraceCheckUtils]: 68: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~15);havoc ~__tmp_45~0;~__tmp_45~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~44;~__VERIFIER_assert__cond~44 := ~__tmp_45~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,606 INFO L290 TraceCheckUtils]: 69: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~44);havoc ~__tmp_46~0;~__tmp_46~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~45;~__VERIFIER_assert__cond~45 := ~__tmp_46~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,607 INFO L290 TraceCheckUtils]: 70: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~45);~main____CPAchecker_TMP_1~15 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,607 INFO L290 TraceCheckUtils]: 71: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~16;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~main____CPAchecker_TMP_0~16 := #t~nondet24;havoc #t~nondet24; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,607 INFO L290 TraceCheckUtils]: 72: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~16);havoc ~__tmp_47~0;~__tmp_47~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,608 INFO L290 TraceCheckUtils]: 73: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,608 INFO L290 TraceCheckUtils]: 74: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~16 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,608 INFO L290 TraceCheckUtils]: 75: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~17;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~main____CPAchecker_TMP_0~17 := #t~nondet25;havoc #t~nondet25; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,609 INFO L290 TraceCheckUtils]: 76: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~17);havoc ~__tmp_49~0;~__tmp_49~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~48;~__VERIFIER_assert__cond~48 := ~__tmp_49~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,609 INFO L290 TraceCheckUtils]: 77: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~48);havoc ~__tmp_50~0;~__tmp_50~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~49;~__VERIFIER_assert__cond~49 := ~__tmp_50~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,609 INFO L290 TraceCheckUtils]: 78: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~49);~main____CPAchecker_TMP_1~17 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,610 INFO L290 TraceCheckUtils]: 79: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~18;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~main____CPAchecker_TMP_0~18 := #t~nondet26;havoc #t~nondet26; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,610 INFO L290 TraceCheckUtils]: 80: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~18);havoc ~__tmp_51~0;~__tmp_51~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,610 INFO L290 TraceCheckUtils]: 81: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,611 INFO L290 TraceCheckUtils]: 82: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~18 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,611 INFO L290 TraceCheckUtils]: 83: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~19;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~main____CPAchecker_TMP_0~19 := #t~nondet27;havoc #t~nondet27; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,612 INFO L290 TraceCheckUtils]: 84: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~19);havoc ~__tmp_53~0;~__tmp_53~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~52;~__VERIFIER_assert__cond~52 := ~__tmp_53~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,612 INFO L290 TraceCheckUtils]: 85: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~52);havoc ~__tmp_54~0;~__tmp_54~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~53;~__VERIFIER_assert__cond~53 := ~__tmp_54~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,612 INFO L290 TraceCheckUtils]: 86: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~53);~main____CPAchecker_TMP_1~19 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,613 INFO L290 TraceCheckUtils]: 87: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~20;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~main____CPAchecker_TMP_0~20 := #t~nondet28;havoc #t~nondet28; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,613 INFO L290 TraceCheckUtils]: 88: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~20);havoc ~__tmp_55~0;~__tmp_55~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~54;~__VERIFIER_assert__cond~54 := ~__tmp_55~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,613 INFO L290 TraceCheckUtils]: 89: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~54);havoc ~__tmp_56~0;~__tmp_56~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~55;~__VERIFIER_assert__cond~55 := ~__tmp_56~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,614 INFO L290 TraceCheckUtils]: 90: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~55);~main____CPAchecker_TMP_1~20 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,614 INFO L290 TraceCheckUtils]: 91: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~21;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~main____CPAchecker_TMP_0~21 := #t~nondet29;havoc #t~nondet29; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,614 INFO L290 TraceCheckUtils]: 92: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~21);havoc ~__tmp_57~0;~__tmp_57~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~56;~__VERIFIER_assert__cond~56 := ~__tmp_57~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,615 INFO L290 TraceCheckUtils]: 93: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~56);havoc ~__tmp_58~0;~__tmp_58~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~57;~__VERIFIER_assert__cond~57 := ~__tmp_58~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,615 INFO L290 TraceCheckUtils]: 94: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~57);~main____CPAchecker_TMP_1~21 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,615 INFO L290 TraceCheckUtils]: 95: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~22;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~main____CPAchecker_TMP_0~22 := #t~nondet30;havoc #t~nondet30; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,616 INFO L290 TraceCheckUtils]: 96: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~22);havoc ~__tmp_59~0;~__tmp_59~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~58;~__VERIFIER_assert__cond~58 := ~__tmp_59~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,616 INFO L290 TraceCheckUtils]: 97: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~58);havoc ~__tmp_60~0;~__tmp_60~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~59;~__VERIFIER_assert__cond~59 := ~__tmp_60~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,616 INFO L290 TraceCheckUtils]: 98: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~59);~main____CPAchecker_TMP_1~22 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,617 INFO L290 TraceCheckUtils]: 99: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~23;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~main____CPAchecker_TMP_0~23 := #t~nondet31;havoc #t~nondet31; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,617 INFO L290 TraceCheckUtils]: 100: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~23);havoc ~__tmp_61~0;~__tmp_61~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~60;~__VERIFIER_assert__cond~60 := ~__tmp_61~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,617 INFO L290 TraceCheckUtils]: 101: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~60);havoc ~__tmp_62~0;~__tmp_62~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~61;~__VERIFIER_assert__cond~61 := ~__tmp_62~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,618 INFO L290 TraceCheckUtils]: 102: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~61);~main____CPAchecker_TMP_1~23 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,618 INFO L290 TraceCheckUtils]: 103: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~24;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~main____CPAchecker_TMP_0~24 := #t~nondet32;havoc #t~nondet32; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,619 INFO L290 TraceCheckUtils]: 104: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~24);havoc ~__tmp_63~0;~__tmp_63~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~62;~__VERIFIER_assert__cond~62 := ~__tmp_63~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,619 INFO L290 TraceCheckUtils]: 105: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~62);havoc ~__tmp_64~0;~__tmp_64~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~63;~__VERIFIER_assert__cond~63 := ~__tmp_64~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,619 INFO L290 TraceCheckUtils]: 106: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~63);~main____CPAchecker_TMP_1~24 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,620 INFO L290 TraceCheckUtils]: 107: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~25;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~main____CPAchecker_TMP_0~25 := #t~nondet33;havoc #t~nondet33; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,620 INFO L290 TraceCheckUtils]: 108: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~25);havoc ~__tmp_65~0;~__tmp_65~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~64;~__VERIFIER_assert__cond~64 := ~__tmp_65~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,620 INFO L290 TraceCheckUtils]: 109: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~64);havoc ~__tmp_66~0;~__tmp_66~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~65;~__VERIFIER_assert__cond~65 := ~__tmp_66~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,621 INFO L290 TraceCheckUtils]: 110: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~65);~main____CPAchecker_TMP_1~25 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,621 INFO L290 TraceCheckUtils]: 111: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~26;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~main____CPAchecker_TMP_0~26 := #t~nondet34;havoc #t~nondet34; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,621 INFO L290 TraceCheckUtils]: 112: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~26);havoc ~__tmp_67~0;~__tmp_67~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~66;~__VERIFIER_assert__cond~66 := ~__tmp_67~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,622 INFO L290 TraceCheckUtils]: 113: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~66);havoc ~__tmp_68~0;~__tmp_68~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~67;~__VERIFIER_assert__cond~67 := ~__tmp_68~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,622 INFO L290 TraceCheckUtils]: 114: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~67);~main____CPAchecker_TMP_1~26 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,622 INFO L290 TraceCheckUtils]: 115: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~27;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~main____CPAchecker_TMP_0~27 := #t~nondet35;havoc #t~nondet35; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,623 INFO L290 TraceCheckUtils]: 116: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~27);havoc ~__tmp_69~0;~__tmp_69~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~68;~__VERIFIER_assert__cond~68 := ~__tmp_69~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,623 INFO L290 TraceCheckUtils]: 117: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~68);havoc ~__tmp_70~0;~__tmp_70~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~69;~__VERIFIER_assert__cond~69 := ~__tmp_70~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,623 INFO L290 TraceCheckUtils]: 118: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~69);~main____CPAchecker_TMP_1~27 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,624 INFO L290 TraceCheckUtils]: 119: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~28;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~main____CPAchecker_TMP_0~28 := #t~nondet36;havoc #t~nondet36; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,624 INFO L290 TraceCheckUtils]: 120: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~28);havoc ~__tmp_71~0;~__tmp_71~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~70;~__VERIFIER_assert__cond~70 := ~__tmp_71~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,624 INFO L290 TraceCheckUtils]: 121: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~70);havoc ~__tmp_72~0;~__tmp_72~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~71;~__VERIFIER_assert__cond~71 := ~__tmp_72~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,625 INFO L290 TraceCheckUtils]: 122: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~71);~main____CPAchecker_TMP_1~28 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,625 INFO L290 TraceCheckUtils]: 123: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~29;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~main____CPAchecker_TMP_0~29 := #t~nondet37;havoc #t~nondet37; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,625 INFO L290 TraceCheckUtils]: 124: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~29);havoc ~__tmp_73~0;~__tmp_73~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~72;~__VERIFIER_assert__cond~72 := ~__tmp_73~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,626 INFO L290 TraceCheckUtils]: 125: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~72);havoc ~__tmp_74~0;~__tmp_74~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~73;~__VERIFIER_assert__cond~73 := ~__tmp_74~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,626 INFO L290 TraceCheckUtils]: 126: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~73);~main____CPAchecker_TMP_1~29 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,627 INFO L290 TraceCheckUtils]: 127: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~30;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~main____CPAchecker_TMP_0~30 := #t~nondet38;havoc #t~nondet38; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,627 INFO L290 TraceCheckUtils]: 128: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~30);havoc ~__tmp_75~0;~__tmp_75~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~74;~__VERIFIER_assert__cond~74 := ~__tmp_75~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,627 INFO L290 TraceCheckUtils]: 129: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~74);havoc ~__tmp_76~0;~__tmp_76~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~75;~__VERIFIER_assert__cond~75 := ~__tmp_76~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,628 INFO L290 TraceCheckUtils]: 130: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~75);~main____CPAchecker_TMP_1~30 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,628 INFO L290 TraceCheckUtils]: 131: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~31;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~main____CPAchecker_TMP_0~31 := #t~nondet39;havoc #t~nondet39; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,628 INFO L290 TraceCheckUtils]: 132: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~31);havoc ~__tmp_77~0;~__tmp_77~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~76;~__VERIFIER_assert__cond~76 := ~__tmp_77~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,628 INFO L290 TraceCheckUtils]: 133: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~76);havoc ~__tmp_78~0;~__tmp_78~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~77;~__VERIFIER_assert__cond~77 := ~__tmp_78~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,629 INFO L290 TraceCheckUtils]: 134: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~77);~main____CPAchecker_TMP_1~31 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,629 INFO L290 TraceCheckUtils]: 135: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~32;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~main____CPAchecker_TMP_0~32 := #t~nondet40;havoc #t~nondet40; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,630 INFO L290 TraceCheckUtils]: 136: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~32);havoc ~__tmp_79~0;~__tmp_79~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~78;~__VERIFIER_assert__cond~78 := ~__tmp_79~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,630 INFO L290 TraceCheckUtils]: 137: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~78);havoc ~__tmp_80~0;~__tmp_80~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~79;~__VERIFIER_assert__cond~79 := ~__tmp_80~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,630 INFO L290 TraceCheckUtils]: 138: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~79);~main____CPAchecker_TMP_1~32 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,631 INFO L290 TraceCheckUtils]: 139: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~33;assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~main____CPAchecker_TMP_0~33 := #t~nondet41;havoc #t~nondet41; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,631 INFO L290 TraceCheckUtils]: 140: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~33);havoc ~__tmp_81~0;~__tmp_81~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~80;~__VERIFIER_assert__cond~80 := ~__tmp_81~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,631 INFO L290 TraceCheckUtils]: 141: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~80);havoc ~__tmp_82~0;~__tmp_82~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~81;~__VERIFIER_assert__cond~81 := ~__tmp_82~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,632 INFO L290 TraceCheckUtils]: 142: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~81);~main____CPAchecker_TMP_1~33 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,632 INFO L290 TraceCheckUtils]: 143: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~34;assume -2147483648 <= #t~nondet42 && #t~nondet42 <= 2147483647;~main____CPAchecker_TMP_0~34 := #t~nondet42;havoc #t~nondet42; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,632 INFO L290 TraceCheckUtils]: 144: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~34);havoc ~__tmp_83~0;~__tmp_83~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~82;~__VERIFIER_assert__cond~82 := ~__tmp_83~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,633 INFO L290 TraceCheckUtils]: 145: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~82);havoc ~__tmp_84~0;~__tmp_84~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~83;~__VERIFIER_assert__cond~83 := ~__tmp_84~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,633 INFO L290 TraceCheckUtils]: 146: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~83);~main____CPAchecker_TMP_1~34 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,633 INFO L290 TraceCheckUtils]: 147: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~35;assume -2147483648 <= #t~nondet43 && #t~nondet43 <= 2147483647;~main____CPAchecker_TMP_0~35 := #t~nondet43;havoc #t~nondet43; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,634 INFO L290 TraceCheckUtils]: 148: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~35);havoc ~__tmp_85~0;~__tmp_85~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~84;~__VERIFIER_assert__cond~84 := ~__tmp_85~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,634 INFO L290 TraceCheckUtils]: 149: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~84);havoc ~__tmp_86~0;~__tmp_86~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~85;~__VERIFIER_assert__cond~85 := ~__tmp_86~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,634 INFO L290 TraceCheckUtils]: 150: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~85);~main____CPAchecker_TMP_1~35 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,635 INFO L290 TraceCheckUtils]: 151: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~36;assume -2147483648 <= #t~nondet44 && #t~nondet44 <= 2147483647;~main____CPAchecker_TMP_0~36 := #t~nondet44;havoc #t~nondet44; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,635 INFO L290 TraceCheckUtils]: 152: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~36);havoc ~__tmp_87~0;~__tmp_87~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~86;~__VERIFIER_assert__cond~86 := ~__tmp_87~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,635 INFO L290 TraceCheckUtils]: 153: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~86);havoc ~__tmp_88~0;~__tmp_88~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~87;~__VERIFIER_assert__cond~87 := ~__tmp_88~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,636 INFO L290 TraceCheckUtils]: 154: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~87);~main____CPAchecker_TMP_1~36 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,636 INFO L290 TraceCheckUtils]: 155: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~37;assume -2147483648 <= #t~nondet45 && #t~nondet45 <= 2147483647;~main____CPAchecker_TMP_0~37 := #t~nondet45;havoc #t~nondet45; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,637 INFO L290 TraceCheckUtils]: 156: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~37);havoc ~__tmp_89~0;~__tmp_89~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~88;~__VERIFIER_assert__cond~88 := ~__tmp_89~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,637 INFO L290 TraceCheckUtils]: 157: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~88);havoc ~__tmp_90~0;~__tmp_90~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~89;~__VERIFIER_assert__cond~89 := ~__tmp_90~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,637 INFO L290 TraceCheckUtils]: 158: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~89);~main____CPAchecker_TMP_1~37 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,638 INFO L290 TraceCheckUtils]: 159: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~38;assume -2147483648 <= #t~nondet46 && #t~nondet46 <= 2147483647;~main____CPAchecker_TMP_0~38 := #t~nondet46;havoc #t~nondet46; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,638 INFO L290 TraceCheckUtils]: 160: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~38);havoc ~__tmp_91~0;~__tmp_91~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~90;~__VERIFIER_assert__cond~90 := ~__tmp_91~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,638 INFO L290 TraceCheckUtils]: 161: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~90);havoc ~__tmp_92~0;~__tmp_92~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~91;~__VERIFIER_assert__cond~91 := ~__tmp_92~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,639 INFO L290 TraceCheckUtils]: 162: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~91);~main____CPAchecker_TMP_1~38 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,639 INFO L290 TraceCheckUtils]: 163: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~39;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~main____CPAchecker_TMP_0~39 := #t~nondet47;havoc #t~nondet47; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,639 INFO L290 TraceCheckUtils]: 164: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~39);havoc ~__tmp_93~0;~__tmp_93~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~92;~__VERIFIER_assert__cond~92 := ~__tmp_93~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,640 INFO L290 TraceCheckUtils]: 165: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~92);havoc ~__tmp_94~0;~__tmp_94~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~93;~__VERIFIER_assert__cond~93 := ~__tmp_94~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,640 INFO L290 TraceCheckUtils]: 166: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~93);~main____CPAchecker_TMP_1~39 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,640 INFO L290 TraceCheckUtils]: 167: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~40;assume -2147483648 <= #t~nondet48 && #t~nondet48 <= 2147483647;~main____CPAchecker_TMP_0~40 := #t~nondet48;havoc #t~nondet48; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,641 INFO L290 TraceCheckUtils]: 168: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~40);havoc ~__tmp_95~0;~__tmp_95~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~94;~__VERIFIER_assert__cond~94 := ~__tmp_95~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,641 INFO L290 TraceCheckUtils]: 169: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~94);havoc ~__tmp_96~0;~__tmp_96~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~95;~__VERIFIER_assert__cond~95 := ~__tmp_96~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,641 INFO L290 TraceCheckUtils]: 170: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~95);~main____CPAchecker_TMP_1~40 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,642 INFO L290 TraceCheckUtils]: 171: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~41;assume -2147483648 <= #t~nondet49 && #t~nondet49 <= 2147483647;~main____CPAchecker_TMP_0~41 := #t~nondet49;havoc #t~nondet49; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,642 INFO L290 TraceCheckUtils]: 172: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~41);havoc ~__tmp_97~0;~__tmp_97~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~96;~__VERIFIER_assert__cond~96 := ~__tmp_97~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,642 INFO L290 TraceCheckUtils]: 173: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~96);havoc ~__tmp_98~0;~__tmp_98~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~97;~__VERIFIER_assert__cond~97 := ~__tmp_98~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,643 INFO L290 TraceCheckUtils]: 174: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~97);~main____CPAchecker_TMP_1~41 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,643 INFO L290 TraceCheckUtils]: 175: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~42;assume -2147483648 <= #t~nondet50 && #t~nondet50 <= 2147483647;~main____CPAchecker_TMP_0~42 := #t~nondet50;havoc #t~nondet50; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,643 INFO L290 TraceCheckUtils]: 176: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~42);havoc ~__tmp_99~0;~__tmp_99~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~98;~__VERIFIER_assert__cond~98 := ~__tmp_99~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,644 INFO L290 TraceCheckUtils]: 177: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~98);havoc ~__tmp_100~0;~__tmp_100~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~99;~__VERIFIER_assert__cond~99 := ~__tmp_100~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,644 INFO L290 TraceCheckUtils]: 178: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~99);~main____CPAchecker_TMP_1~42 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,645 INFO L290 TraceCheckUtils]: 179: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~43;assume -2147483648 <= #t~nondet51 && #t~nondet51 <= 2147483647;~main____CPAchecker_TMP_0~43 := #t~nondet51;havoc #t~nondet51; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,645 INFO L290 TraceCheckUtils]: 180: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~43);havoc ~__tmp_101~0;~__tmp_101~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~100;~__VERIFIER_assert__cond~100 := ~__tmp_101~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,645 INFO L290 TraceCheckUtils]: 181: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~100);havoc ~__tmp_102~0;~__tmp_102~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~101;~__VERIFIER_assert__cond~101 := ~__tmp_102~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,645 INFO L290 TraceCheckUtils]: 182: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~101);~main____CPAchecker_TMP_1~43 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,646 INFO L290 TraceCheckUtils]: 183: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~44;assume -2147483648 <= #t~nondet52 && #t~nondet52 <= 2147483647;~main____CPAchecker_TMP_0~44 := #t~nondet52;havoc #t~nondet52; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,646 INFO L290 TraceCheckUtils]: 184: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~44);havoc ~__tmp_103~0;~__tmp_103~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~102;~__VERIFIER_assert__cond~102 := ~__tmp_103~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,646 INFO L290 TraceCheckUtils]: 185: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~102);havoc ~__tmp_104~0;~__tmp_104~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~103;~__VERIFIER_assert__cond~103 := ~__tmp_104~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,647 INFO L290 TraceCheckUtils]: 186: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~103);~main____CPAchecker_TMP_1~44 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,647 INFO L290 TraceCheckUtils]: 187: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~45;assume -2147483648 <= #t~nondet53 && #t~nondet53 <= 2147483647;~main____CPAchecker_TMP_0~45 := #t~nondet53;havoc #t~nondet53; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,648 INFO L290 TraceCheckUtils]: 188: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~45);havoc ~__tmp_105~0;~__tmp_105~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~104;~__VERIFIER_assert__cond~104 := ~__tmp_105~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,648 INFO L290 TraceCheckUtils]: 189: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~104);havoc ~__tmp_106~0;~__tmp_106~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~105;~__VERIFIER_assert__cond~105 := ~__tmp_106~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,648 INFO L290 TraceCheckUtils]: 190: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~105);~main____CPAchecker_TMP_1~45 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,649 INFO L290 TraceCheckUtils]: 191: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~46;assume -2147483648 <= #t~nondet54 && #t~nondet54 <= 2147483647;~main____CPAchecker_TMP_0~46 := #t~nondet54;havoc #t~nondet54; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,649 INFO L290 TraceCheckUtils]: 192: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~46);havoc ~__tmp_107~0;~__tmp_107~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~106;~__VERIFIER_assert__cond~106 := ~__tmp_107~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,649 INFO L290 TraceCheckUtils]: 193: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~106);havoc ~__tmp_108~0;~__tmp_108~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~107;~__VERIFIER_assert__cond~107 := ~__tmp_108~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,650 INFO L290 TraceCheckUtils]: 194: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~107);~main____CPAchecker_TMP_1~46 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,650 INFO L290 TraceCheckUtils]: 195: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~47;assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~main____CPAchecker_TMP_0~47 := #t~nondet55;havoc #t~nondet55; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,650 INFO L290 TraceCheckUtils]: 196: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~47);havoc ~__tmp_109~0;~__tmp_109~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~108;~__VERIFIER_assert__cond~108 := ~__tmp_109~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,651 INFO L290 TraceCheckUtils]: 197: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~108);havoc ~__tmp_110~0;~__tmp_110~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~109;~__VERIFIER_assert__cond~109 := ~__tmp_110~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,651 INFO L290 TraceCheckUtils]: 198: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~109);~main____CPAchecker_TMP_1~47 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,651 INFO L290 TraceCheckUtils]: 199: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~48;assume -2147483648 <= #t~nondet56 && #t~nondet56 <= 2147483647;~main____CPAchecker_TMP_0~48 := #t~nondet56;havoc #t~nondet56; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,652 INFO L290 TraceCheckUtils]: 200: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~48);havoc ~__tmp_111~0;~__tmp_111~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~110;~__VERIFIER_assert__cond~110 := ~__tmp_111~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,652 INFO L290 TraceCheckUtils]: 201: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~110);havoc ~__tmp_112~0;~__tmp_112~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~111;~__VERIFIER_assert__cond~111 := ~__tmp_112~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,652 INFO L290 TraceCheckUtils]: 202: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~111);~main____CPAchecker_TMP_1~48 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,653 INFO L290 TraceCheckUtils]: 203: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~49;assume -2147483648 <= #t~nondet57 && #t~nondet57 <= 2147483647;~main____CPAchecker_TMP_0~49 := #t~nondet57;havoc #t~nondet57; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,653 INFO L290 TraceCheckUtils]: 204: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~49);havoc ~__tmp_113~0;~__tmp_113~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~112;~__VERIFIER_assert__cond~112 := ~__tmp_113~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,653 INFO L290 TraceCheckUtils]: 205: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~112);havoc ~__tmp_114~0;~__tmp_114~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~113;~__VERIFIER_assert__cond~113 := ~__tmp_114~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,654 INFO L290 TraceCheckUtils]: 206: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~113);~main____CPAchecker_TMP_1~49 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,654 INFO L290 TraceCheckUtils]: 207: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~50;assume -2147483648 <= #t~nondet58 && #t~nondet58 <= 2147483647;~main____CPAchecker_TMP_0~50 := #t~nondet58;havoc #t~nondet58; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,654 INFO L290 TraceCheckUtils]: 208: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~50);havoc ~__tmp_115~0;~__tmp_115~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~114;~__VERIFIER_assert__cond~114 := ~__tmp_115~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,655 INFO L290 TraceCheckUtils]: 209: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~114);havoc ~__tmp_116~0;~__tmp_116~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~115;~__VERIFIER_assert__cond~115 := ~__tmp_116~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,655 INFO L290 TraceCheckUtils]: 210: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~115);~main____CPAchecker_TMP_1~50 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,656 INFO L290 TraceCheckUtils]: 211: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~51;assume -2147483648 <= #t~nondet59 && #t~nondet59 <= 2147483647;~main____CPAchecker_TMP_0~51 := #t~nondet59;havoc #t~nondet59; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,656 INFO L290 TraceCheckUtils]: 212: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~51);havoc ~__tmp_117~0;~__tmp_117~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~116;~__VERIFIER_assert__cond~116 := ~__tmp_117~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,656 INFO L290 TraceCheckUtils]: 213: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~116);havoc ~__tmp_118~0;~__tmp_118~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~117;~__VERIFIER_assert__cond~117 := ~__tmp_118~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,657 INFO L290 TraceCheckUtils]: 214: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~117);~main____CPAchecker_TMP_1~51 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,657 INFO L290 TraceCheckUtils]: 215: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~52;assume -2147483648 <= #t~nondet60 && #t~nondet60 <= 2147483647;~main____CPAchecker_TMP_0~52 := #t~nondet60;havoc #t~nondet60; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,657 INFO L290 TraceCheckUtils]: 216: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~52);havoc ~__tmp_119~0;~__tmp_119~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~118;~__VERIFIER_assert__cond~118 := ~__tmp_119~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,658 INFO L290 TraceCheckUtils]: 217: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~118);havoc ~__tmp_120~0;~__tmp_120~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~119;~__VERIFIER_assert__cond~119 := ~__tmp_120~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,658 INFO L290 TraceCheckUtils]: 218: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~119);~main____CPAchecker_TMP_1~52 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,658 INFO L290 TraceCheckUtils]: 219: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~53;assume -2147483648 <= #t~nondet61 && #t~nondet61 <= 2147483647;~main____CPAchecker_TMP_0~53 := #t~nondet61;havoc #t~nondet61; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,659 INFO L290 TraceCheckUtils]: 220: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~53);havoc ~__tmp_121~0;~__tmp_121~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~120;~__VERIFIER_assert__cond~120 := ~__tmp_121~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,659 INFO L290 TraceCheckUtils]: 221: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~120);havoc ~__tmp_122~0;~__tmp_122~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~121;~__VERIFIER_assert__cond~121 := ~__tmp_122~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,659 INFO L290 TraceCheckUtils]: 222: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~121);~main____CPAchecker_TMP_1~53 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,660 INFO L290 TraceCheckUtils]: 223: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~54;assume -2147483648 <= #t~nondet62 && #t~nondet62 <= 2147483647;~main____CPAchecker_TMP_0~54 := #t~nondet62;havoc #t~nondet62; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,660 INFO L290 TraceCheckUtils]: 224: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~54);havoc ~__tmp_123~0;~__tmp_123~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~122;~__VERIFIER_assert__cond~122 := ~__tmp_123~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,660 INFO L290 TraceCheckUtils]: 225: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~122);havoc ~__tmp_124~0;~__tmp_124~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~123;~__VERIFIER_assert__cond~123 := ~__tmp_124~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,661 INFO L290 TraceCheckUtils]: 226: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~123);~main____CPAchecker_TMP_1~54 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,661 INFO L290 TraceCheckUtils]: 227: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~55;assume -2147483648 <= #t~nondet63 && #t~nondet63 <= 2147483647;~main____CPAchecker_TMP_0~55 := #t~nondet63;havoc #t~nondet63; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,661 INFO L290 TraceCheckUtils]: 228: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~55);havoc ~__tmp_125~0;~__tmp_125~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~124;~__VERIFIER_assert__cond~124 := ~__tmp_125~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,662 INFO L290 TraceCheckUtils]: 229: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~124);havoc ~__tmp_126~0;~__tmp_126~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~125;~__VERIFIER_assert__cond~125 := ~__tmp_126~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,662 INFO L290 TraceCheckUtils]: 230: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~125);~main____CPAchecker_TMP_1~55 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,662 INFO L290 TraceCheckUtils]: 231: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~56;assume -2147483648 <= #t~nondet64 && #t~nondet64 <= 2147483647;~main____CPAchecker_TMP_0~56 := #t~nondet64;havoc #t~nondet64; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,663 INFO L290 TraceCheckUtils]: 232: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~56);havoc ~__tmp_127~0;~__tmp_127~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~126;~__VERIFIER_assert__cond~126 := ~__tmp_127~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,663 INFO L290 TraceCheckUtils]: 233: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~126);havoc ~__tmp_128~0;~__tmp_128~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~127;~__VERIFIER_assert__cond~127 := ~__tmp_128~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,663 INFO L290 TraceCheckUtils]: 234: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~127);~main____CPAchecker_TMP_1~56 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,664 INFO L290 TraceCheckUtils]: 235: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~57;assume -2147483648 <= #t~nondet65 && #t~nondet65 <= 2147483647;~main____CPAchecker_TMP_0~57 := #t~nondet65;havoc #t~nondet65; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,664 INFO L290 TraceCheckUtils]: 236: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~57);havoc ~__tmp_129~0;~__tmp_129~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~128;~__VERIFIER_assert__cond~128 := ~__tmp_129~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,664 INFO L290 TraceCheckUtils]: 237: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~128);havoc ~__tmp_130~0;~__tmp_130~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~129;~__VERIFIER_assert__cond~129 := ~__tmp_130~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,665 INFO L290 TraceCheckUtils]: 238: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~129);~main____CPAchecker_TMP_1~57 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,665 INFO L290 TraceCheckUtils]: 239: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~58;assume -2147483648 <= #t~nondet66 && #t~nondet66 <= 2147483647;~main____CPAchecker_TMP_0~58 := #t~nondet66;havoc #t~nondet66; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,665 INFO L290 TraceCheckUtils]: 240: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~58);havoc ~__tmp_131~0;~__tmp_131~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~130;~__VERIFIER_assert__cond~130 := ~__tmp_131~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,666 INFO L290 TraceCheckUtils]: 241: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~130);havoc ~__tmp_132~0;~__tmp_132~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~131;~__VERIFIER_assert__cond~131 := ~__tmp_132~0; {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:27,666 INFO L290 TraceCheckUtils]: 242: Hoare triple {24879#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~131);~main____CPAchecker_TMP_1~58 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,666 INFO L290 TraceCheckUtils]: 243: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~59;assume -2147483648 <= #t~nondet67 && #t~nondet67 <= 2147483647;~main____CPAchecker_TMP_0~59 := #t~nondet67;havoc #t~nondet67; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,667 INFO L290 TraceCheckUtils]: 244: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !!(0 == ~main____CPAchecker_TMP_0~59);~__tmp_3904_0~0 := ~main____CPAchecker_TMP_0~59;~__tmp_3904_1~0 := ~main____CPAchecker_TMP_1~58; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,667 INFO L290 TraceCheckUtils]: 245: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} ~main____CPAchecker_TMP_0~59 := ~__tmp_3904_0~0;~main____CPAchecker_TMP_1~58 := ~__tmp_3904_1~0;havoc ~__tmp_133~0;~__tmp_133~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~132;~__VERIFIER_assert__cond~132 := ~__tmp_133~0; {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:46:27,667 INFO L290 TraceCheckUtils]: 246: Hoare triple {24878#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(0 == ~__VERIFIER_assert__cond~132);havoc ~__tmp_134~0;~__tmp_134~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~133;~__VERIFIER_assert__cond~133 := ~__tmp_134~0; {24880#(not (= main_~__VERIFIER_assert__cond~133 0))} is VALID [2022-04-27 10:46:27,668 INFO L290 TraceCheckUtils]: 247: Hoare triple {24880#(not (= main_~__VERIFIER_assert__cond~133 0))} assume 0 == ~__VERIFIER_assert__cond~133; {24872#false} is VALID [2022-04-27 10:46:27,668 INFO L290 TraceCheckUtils]: 248: Hoare triple {24872#false} assume !false; {24872#false} is VALID [2022-04-27 10:46:27,668 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 10:46:27,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:27,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807348755] [2022-04-27 10:46:27,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807348755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:27,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:27,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:46:27,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249235476] [2022-04-27 10:46:27,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:27,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.75) internal successors, (246), 7 states have internal predecessors, (246), 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 249 [2022-04-27 10:46:27,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:27,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 30.75) internal successors, (246), 7 states have internal predecessors, (246), 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 10:46:27,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:27,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:46:27,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:27,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:46:27,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:46:27,820 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand has 8 states, 8 states have (on average 30.75) internal successors, (246), 7 states have internal predecessors, (246), 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 10:46:28,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:28,908 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2022-04-27 10:46:28,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:46:28,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.75) internal successors, (246), 7 states have internal predecessors, (246), 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 249 [2022-04-27 10:46:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 30.75) internal successors, (246), 7 states have internal predecessors, (246), 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 10:46:28,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 254 transitions. [2022-04-27 10:46:28,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 30.75) internal successors, (246), 7 states have internal predecessors, (246), 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 10:46:28,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 254 transitions. [2022-04-27 10:46:28,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 254 transitions. [2022-04-27 10:46:29,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:29,112 INFO L225 Difference]: With dead ends: 254 [2022-04-27 10:46:29,112 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:46:29,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 117 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 10:46:29,114 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 606 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:29,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 26 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 10:46:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:46:29,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:46:29,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:29,114 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 10:46:29,114 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 10:46:29,114 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 10:46:29,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:29,115 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:46:29,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:46:29,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:29,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:29,115 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 10:46:29,115 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 10:46:29,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:29,115 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:46:29,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:46:29,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:29,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:29,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:29,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:29,115 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 10:46:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:46:29,115 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2022-04-27 10:46:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:29,116 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:46:29,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.75) internal successors, (246), 7 states have internal predecessors, (246), 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 10:46:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:46:29,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:29,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-04-27 10:46:29,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-04-27 10:46:29,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-04-27 10:46:29,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-04-27 10:46:29,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-04-27 10:46:29,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-04-27 10:46:29,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-04-27 10:46:29,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-04-27 10:46:29,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-04-27 10:46:29,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-04-27 10:46:29,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-04-27 10:46:29,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-04-27 10:46:29,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-04-27 10:46:29,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-04-27 10:46:29,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-04-27 10:46:29,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-04-27 10:46:29,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 10:46:29,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:46:30,545 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 16 3008) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L1555(lines 1555 2805) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L2546(lines 2546 2653) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L2480(lines 2480 2663) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 2978) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 2937) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L1688(lines 1688 2785) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L1622(lines 1622 2795) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 125) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L1953(lines 1953 2744) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 2917) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 2927) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L2614(lines 2614 2643) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L2218(lines 2218 2703) no Hoare annotation was computed. [2022-04-27 10:46:30,546 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1095 2876) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L1360(lines 1360 2835) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L2351(lines 2351 2683) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L2285(lines 2285 2693) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 193) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L2616(line 2616) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L502(lines 502 2967) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L1493(lines 1493 2815) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L1427(lines 1427 2825) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L1758(lines 1758 2774) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L635(lines 635 2947) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L569(lines 569 2957) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L2023(lines 2023 2733) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L900(lines 900 2906) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L1165(lines 1165 2865) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L2156(lines 2156 2713) no Hoare annotation was computed. [2022-04-27 10:46:30,547 INFO L899 garLoopResultBuilder]: For program point L2090(lines 2090 2723) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L2421(lines 2421 2672) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L307(lines 307 2997) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L1298(lines 1298 2845) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L1232(lines 1232 2855) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L1563(lines 1563 2804) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L440(lines 440 2977) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L374(lines 374 2987) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L1828(lines 1828 2763) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 2936) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 55) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L970(lines 970 2895) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L1961(lines 1961 2743) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L1895(lines 1895 2753) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L2226(lines 2226 2702) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L1103(lines 1103 2875) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L1037(lines 1037 2885) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L2623(lines 2623 2642) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L2491(lines 2491 2661) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L1368(lines 1368 2834) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L1633(lines 1633 2793) no Hoare annotation was computed. [2022-04-27 10:46:30,548 INFO L899 garLoopResultBuilder]: For program point L2558(lines 2558 2651) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 2966) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 281) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point L775(lines 775 2925) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point L1766(lines 1766 2773) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point L1700(lines 1700 2783) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L895 garLoopResultBuilder]: At program point L2625(lines 25 3002) the Hoare annotation is: (and (<= 0 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 123) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point L2031(lines 2031 2732) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point L908(lines 908 2905) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point L842(lines 842 2915) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point L2296(lines 2296 2691) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point L1173(lines 1173 2864) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point L1438(lines 1438 2823) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point L2429(lines 2429 2671) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 2996) no Hoare annotation was computed. [2022-04-27 10:46:30,549 INFO L899 garLoopResultBuilder]: For program point L2363(lines 2363 2681) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 191) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L580(lines 580 2955) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L1571(lines 1571 2803) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L1505(lines 1505 2813) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L1836(lines 1836 2762) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L713(lines 713 2935) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L647(lines 647 2945) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L2101(lines 2101 2721) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L978(lines 978 2894) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 2604) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L1243(lines 1243 2853) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L2234(lines 2234 2701) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L2168(lines 2168 2711) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L2631(lines 2631 2641) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L2499(lines 2499 2660) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 2985) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L1376(lines 1376 2833) no Hoare annotation was computed. [2022-04-27 10:46:30,550 INFO L899 garLoopResultBuilder]: For program point L1310(lines 1310 2843) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L253(lines 253 275) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L1641(lines 1641 2792) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 2965) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L452(lines 452 2975) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L1906(lines 1906 2751) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L783(lines 783 2924) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L1048(lines 1048 2883) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L2039(lines 2039 2731) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L1973(lines 1973 2741) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L895 garLoopResultBuilder]: At program point L2634(lines 64 3001) the Hoare annotation is: (and (or (= main_~main__t~0 0) (<= 1 main_~main__t~0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L2304(lines 2304 2690) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L1181(lines 1181 2863) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L1115(lines 1115 2873) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L2569(lines 2569 2649) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L1446(lines 1446 2822) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 2995) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L1711(lines 1711 2781) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L588(lines 588 2954) no Hoare annotation was computed. [2022-04-27 10:46:30,551 INFO L899 garLoopResultBuilder]: For program point L853(lines 853 2913) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L1844(lines 1844 2761) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L1778(lines 1778 2771) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L2109(lines 2109 2720) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L986(lines 986 2893) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L920(lines 920 2903) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L2374(lines 2374 2679) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L1251(lines 1251 2852) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L1516(lines 1516 2811) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L2507(lines 2507 2659) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 2984) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L2441(lines 2441 2669) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L658(lines 658 2943) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L1649(lines 1649 2791) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L895 garLoopResultBuilder]: At program point L2640(lines 2591 2647) the Hoare annotation is: (and (<= 59 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L1583(lines 1583 2801) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 3001) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point L1914(lines 1914 2750) no Hoare annotation was computed. [2022-04-27 10:46:30,552 INFO L899 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L791(lines 791 2923) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L725(lines 725 2933) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L2179(lines 2179 2709) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L1056(lines 1056 2882) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L1321(lines 1321 2841) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L2312(lines 2312 2689) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L2246(lines 2246 2699) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 282) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L2577(lines 2577 2648) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L463(lines 463 2973) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L1454(lines 1454 2821) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L1388(lines 1388 2831) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 273) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L1719(lines 1719 2780) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 2953) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 2963) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L1984(lines 1984 2739) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 2912) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L267(line 267) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L1126(lines 1126 2871) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L2117(lines 2117 2719) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L2051(lines 2051 2729) no Hoare annotation was computed. [2022-04-27 10:46:30,553 INFO L899 garLoopResultBuilder]: For program point L2382(lines 2382 2678) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L1259(lines 1259 2851) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L1193(lines 1193 2861) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 240) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L1524(lines 1524 2810) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 2983) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 2993) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 16 3008) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L1789(lines 1789 2769) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L666(lines 666 2942) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L931(lines 931 2901) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L1922(lines 1922 2749) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L1856(lines 1856 2759) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 229) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L2187(lines 2187 2708) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L1064(lines 1064 2881) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L998(lines 998 2891) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L2452(lines 2452 2667) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L1329(lines 1329 2840) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 286) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L1594(lines 1594 2799) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L2585(lines 2585 2647) no Hoare annotation was computed. [2022-04-27 10:46:30,554 INFO L899 garLoopResultBuilder]: For program point L471(lines 471 2972) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L2519(lines 2519 2657) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L736(lines 736 2931) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L1727(lines 1727 2779) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L1661(lines 1661 2789) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L1992(lines 1992 2738) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L869(lines 869 2911) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 2921) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L2257(lines 2257 2697) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 234) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L1134(lines 1134 2870) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L1399(lines 1399 2829) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L2390(lines 2390 2677) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L2324(lines 2324 2687) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 2961) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L1532(lines 1532 2809) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L1466(lines 1466 2819) no Hoare annotation was computed. [2022-04-27 10:46:30,555 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L1797(lines 1797 2768) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 2941) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L608(lines 608 2951) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L2062(lines 2062 2727) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L939(lines 939 2900) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L1204(lines 1204 2859) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L2195(lines 2195 2707) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L2129(lines 2129 2717) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L2460(lines 2460 2666) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L346(lines 346 2991) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L1337(lines 1337 2839) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L895 garLoopResultBuilder]: At program point L280(lines 132 282) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L1271(lines 1271 2849) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L1602(lines 1602 2798) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 2971) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L413(lines 413 2981) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L1867(lines 1867 2757) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L744(lines 744 2930) no Hoare annotation was computed. [2022-04-27 10:46:30,556 INFO L899 garLoopResultBuilder]: For program point L1009(lines 1009 2889) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L2000(lines 2000 2737) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L1934(lines 1934 2747) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 227) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L2265(lines 2265 2696) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L1142(lines 1142 2869) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L1076(lines 1076 2879) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L2530(lines 2530 2655) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L1407(lines 1407 2828) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 284) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L1672(lines 1672 2787) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L549(lines 549 2960) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 3007) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 2919) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L1805(lines 1805 2767) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L1739(lines 1739 2777) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L2070(lines 2070 2726) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L947(lines 947 2899) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L881(lines 881 2909) no Hoare annotation was computed. [2022-04-27 10:46:30,557 INFO L899 garLoopResultBuilder]: For program point L2335(lines 2335 2685) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L1212(lines 1212 2858) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 232) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 2616) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L1477(lines 1477 2817) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L2468(lines 2468 2665) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L2402(lines 2402 2675) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L354(lines 354 2990) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 2949) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L1610(lines 1610 2797) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L1544(lines 1544 2807) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 3002) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L1875(lines 1875 2756) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L752(lines 752 2929) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L686(lines 686 2939) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L2602(lines 2602 2645) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L2140(lines 2140 2715) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L1017(lines 1017 2888) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L1282(lines 1282 2847) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L2273(lines 2273 2695) no Hoare annotation was computed. [2022-04-27 10:46:30,558 INFO L899 garLoopResultBuilder]: For program point L2207(lines 2207 2705) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L2604(line 2604) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L2538(lines 2538 2654) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 2979) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L1415(lines 1415 2827) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L1349(lines 1349 2837) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L895 garLoopResultBuilder]: At program point L226(lines 92 284) the Hoare annotation is: (and (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L1680(lines 1680 2786) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L557(lines 557 2959) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L491(lines 491 2969) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L1945(lines 1945 2745) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L822(lines 822 2918) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L1087(lines 1087 2877) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L2078(lines 2078 2725) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 16 3008) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L2012(lines 2012 2735) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L2343(lines 2343 2684) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L1220(lines 1220 2857) no Hoare annotation was computed. [2022-04-27 10:46:30,559 INFO L899 garLoopResultBuilder]: For program point L1154(lines 1154 2867) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L1485(lines 1485 2816) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 2989) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 2999) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 231) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L1750(lines 1750 2775) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L627(lines 627 2948) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 57) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L895 garLoopResultBuilder]: At program point L3006(lines 21 3007) the Hoare annotation is: (or (<= 0 main_~main__t~0) (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0))) [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L892(lines 892 2907) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L1883(lines 1883 2755) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L1817(lines 1817 2765) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L2148(lines 2148 2714) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L1025(lines 1025 2887) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L959(lines 959 2897) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L2413(lines 2413 2673) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L1290(lines 1290 2846) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:46:30,560 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:46:30,561 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:46:30,561 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:46:30,563 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, 1, 1] [2022-04-27 10:46:30,564 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:46:30,567 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:46:30,567 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-04-27 10:46:30,568 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L307 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L307 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L315 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L315 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-04-27 10:46:30,569 WARN L170 areAnnotationChecker]: L323 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L323 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L335 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L335 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L246 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L246 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L346 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L346 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L205 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L354 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L354 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-04-27 10:46:30,570 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L205 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L205 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L217 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L217 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L267 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L267 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L374 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L374 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L219 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L219 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-04-27 10:46:30,571 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L393 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L393 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L401 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L401 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L413 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L413 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L424 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L424 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L432 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L432 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L440 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L440 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L463 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L463 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L471 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L471 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L479 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L479 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L491 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L491 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L502 has no Hoare annotation [2022-04-27 10:46:30,572 WARN L170 areAnnotationChecker]: L502 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L510 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L510 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L518 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L518 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L530 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L530 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L541 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L541 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L549 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L549 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L557 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L557 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L569 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L569 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L580 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L580 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L588 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L588 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L596 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L596 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L619 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L619 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L627 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L627 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2022-04-27 10:46:30,573 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L647 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L647 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L666 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L666 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L674 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L674 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L686 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L686 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L697 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L697 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L705 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L705 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L713 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L713 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L725 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L725 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L744 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L744 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L752 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L752 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L764 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L764 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L775 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L775 has no Hoare annotation [2022-04-27 10:46:30,574 WARN L170 areAnnotationChecker]: L783 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L783 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L791 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L791 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L803 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L803 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L822 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L822 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L830 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L830 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L842 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L842 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L853 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L853 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L861 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L861 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L869 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L869 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L881 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L881 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L900 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L900 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L908 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L908 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L920 has no Hoare annotation [2022-04-27 10:46:30,575 WARN L170 areAnnotationChecker]: L920 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L931 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L931 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L939 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L939 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L947 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L947 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L959 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L959 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L970 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L970 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L978 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L978 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L986 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L986 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L998 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L998 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L1009 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L1009 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L1017 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L1017 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L1025 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L1025 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L1037 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L1037 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L1048 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L1048 has no Hoare annotation [2022-04-27 10:46:30,576 WARN L170 areAnnotationChecker]: L1056 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1056 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1076 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1076 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1087 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1087 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1095 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1095 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1103 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1103 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1115 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1115 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1126 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1126 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1134 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1134 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1154 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1154 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1165 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1165 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1181 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1181 has no Hoare annotation [2022-04-27 10:46:30,577 WARN L170 areAnnotationChecker]: L1193 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1193 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1220 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1220 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1232 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1232 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1243 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1243 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1259 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1259 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1282 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1282 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1310 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1310 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1329 has no Hoare annotation [2022-04-27 10:46:30,578 WARN L170 areAnnotationChecker]: L1329 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1337 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1337 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1349 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1349 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1368 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1368 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1376 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1376 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1388 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1388 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1399 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1399 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1407 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1407 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1415 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1415 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1427 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1427 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1438 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1438 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1446 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1446 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1454 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1454 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-27 10:46:30,579 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1477 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1477 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1485 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1485 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1493 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1493 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1516 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1516 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1532 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1532 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1555 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1555 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1583 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1583 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1594 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1594 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1602 has no Hoare annotation [2022-04-27 10:46:30,580 WARN L170 areAnnotationChecker]: L1602 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1610 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1610 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1622 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1622 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1633 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1633 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1641 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1641 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1649 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1649 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1661 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1661 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1672 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1672 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1680 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1680 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1688 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1688 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1700 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1700 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1711 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1711 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1719 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1719 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1739 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1739 has no Hoare annotation [2022-04-27 10:46:30,581 WARN L170 areAnnotationChecker]: L1750 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1750 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1758 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1758 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1766 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1766 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1778 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1778 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1789 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1789 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1797 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1797 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1805 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1805 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1817 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1817 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1828 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1828 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1836 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1836 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1844 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1844 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1856 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1856 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1867 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1867 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1875 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1875 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1883 has no Hoare annotation [2022-04-27 10:46:30,582 WARN L170 areAnnotationChecker]: L1883 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1895 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1895 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1906 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1906 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1914 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1914 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1922 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1922 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1934 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1934 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1945 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1945 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1953 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1953 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1961 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1961 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1973 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1973 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1984 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1984 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1992 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L1992 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L2000 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L2000 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L2012 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L2012 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L2023 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L2023 has no Hoare annotation [2022-04-27 10:46:30,583 WARN L170 areAnnotationChecker]: L2031 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2031 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2039 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2039 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2051 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2051 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2062 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2062 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2070 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2070 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2078 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2078 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2090 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2090 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2101 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2101 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2109 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2109 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2117 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2117 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2129 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2129 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2140 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2140 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2148 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2148 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2156 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2156 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2168 has no Hoare annotation [2022-04-27 10:46:30,584 WARN L170 areAnnotationChecker]: L2168 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2179 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2179 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2187 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2187 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2195 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2195 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2207 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2207 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2218 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2218 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2226 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2226 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2234 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2234 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2246 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2246 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2257 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2257 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2265 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2265 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2273 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2273 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2285 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2285 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2296 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2296 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2304 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2304 has no Hoare annotation [2022-04-27 10:46:30,585 WARN L170 areAnnotationChecker]: L2312 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2312 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2324 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2324 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2335 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2335 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2343 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2343 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2351 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2351 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2363 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2363 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2374 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2374 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2382 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2382 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2390 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2390 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2402 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2402 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2413 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2413 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2421 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2421 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2429 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2429 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2441 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2441 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2452 has no Hoare annotation [2022-04-27 10:46:30,586 WARN L170 areAnnotationChecker]: L2452 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2460 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2460 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2468 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2468 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2480 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2480 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2491 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2491 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2499 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2499 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2507 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2507 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2519 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2519 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2530 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2530 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2538 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2538 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2546 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2546 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2558 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2558 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2569 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2569 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2577 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2577 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2585 has no Hoare annotation [2022-04-27 10:46:30,587 WARN L170 areAnnotationChecker]: L2585 has no Hoare annotation [2022-04-27 10:46:30,588 WARN L170 areAnnotationChecker]: L2602 has no Hoare annotation [2022-04-27 10:46:30,588 WARN L170 areAnnotationChecker]: L2602 has no Hoare annotation [2022-04-27 10:46:30,588 WARN L170 areAnnotationChecker]: L2602 has no Hoare annotation [2022-04-27 10:46:30,588 WARN L170 areAnnotationChecker]: L2604 has no Hoare annotation [2022-04-27 10:46:30,588 WARN L170 areAnnotationChecker]: L2604 has no Hoare annotation [2022-04-27 10:46:30,588 WARN L170 areAnnotationChecker]: L2614 has no Hoare annotation [2022-04-27 10:46:30,588 WARN L170 areAnnotationChecker]: L2614 has no Hoare annotation [2022-04-27 10:46:30,588 WARN L170 areAnnotationChecker]: L2616 has no Hoare annotation [2022-04-27 10:46:30,588 WARN L170 areAnnotationChecker]: L2616 has no Hoare annotation [2022-04-27 10:46:30,588 WARN L170 areAnnotationChecker]: L2623 has no Hoare annotation [2022-04-27 10:46:30,588 WARN L170 areAnnotationChecker]: L2623 has no Hoare annotation [2022-04-27 10:46:30,588 WARN L170 areAnnotationChecker]: L2631 has no Hoare annotation [2022-04-27 10:46:30,588 WARN L170 areAnnotationChecker]: L2631 has no Hoare annotation [2022-04-27 10:46:30,588 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 10:46:30,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:46:30 BoogieIcfgContainer [2022-04-27 10:46:30,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:46:30,598 INFO L158 Benchmark]: Toolchain (without parser) took 46848.89ms. Allocated memory was 211.8MB in the beginning and 459.3MB in the end (delta: 247.5MB). Free memory was 158.3MB in the beginning and 385.1MB in the end (delta: -226.8MB). Peak memory consumption was 257.9MB. Max. memory is 8.0GB. [2022-04-27 10:46:30,598 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 211.8MB. Free memory was 176.7MB in the beginning and 176.6MB in the end (delta: 89.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:46:30,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.52ms. Allocated memory was 211.8MB in the beginning and 318.8MB in the end (delta: 107.0MB). Free memory was 158.2MB in the beginning and 257.4MB in the end (delta: -99.2MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-27 10:46:30,598 INFO L158 Benchmark]: Boogie Preprocessor took 87.33ms. Allocated memory is still 318.8MB. Free memory was 257.4MB in the beginning and 251.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-04-27 10:46:30,598 INFO L158 Benchmark]: RCFGBuilder took 1062.55ms. Allocated memory is still 318.8MB. Free memory was 251.6MB in the beginning and 137.9MB in the end (delta: 113.8MB). Peak memory consumption was 113.2MB. Max. memory is 8.0GB. [2022-04-27 10:46:30,598 INFO L158 Benchmark]: TraceAbstraction took 45118.82ms. Allocated memory was 318.8MB in the beginning and 459.3MB in the end (delta: 140.5MB). Free memory was 137.3MB in the beginning and 385.1MB in the end (delta: -247.8MB). Peak memory consumption was 130.0MB. Max. memory is 8.0GB. [2022-04-27 10:46:30,599 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.09ms. Allocated memory is still 211.8MB. Free memory was 176.7MB in the beginning and 176.6MB in the end (delta: 89.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 576.52ms. Allocated memory was 211.8MB in the beginning and 318.8MB in the end (delta: 107.0MB). Free memory was 158.2MB in the beginning and 257.4MB in the end (delta: -99.2MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 87.33ms. Allocated memory is still 318.8MB. Free memory was 257.4MB in the beginning and 251.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1062.55ms. Allocated memory is still 318.8MB. Free memory was 251.6MB in the beginning and 137.9MB in the end (delta: 113.8MB). Peak memory consumption was 113.2MB. Max. memory is 8.0GB. * TraceAbstraction took 45118.82ms. Allocated memory was 318.8MB in the beginning and 459.3MB in the end (delta: 140.5MB). Free memory was 137.3MB in the beginning and 385.1MB in the end (delta: -247.8MB). Peak memory consumption was 130.0MB. 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: 35]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 88]: 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: 157]: 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: 207]: 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: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 267]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2604]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2616]: 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 5 procedures, 316 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 45.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 37.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11015 SdHoareTripleChecker+Valid, 13.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11015 mSDsluCounter, 5248 SdHoareTripleChecker+Invalid, 13.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1271 mSDsCounter, 2338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19258 IncrementalHoareTripleChecker+Invalid, 21596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2338 mSolverCounterUnsat, 3977 mSDtfsCounter, 19258 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2085 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=0, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 161 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 111 HoareAnnotationTreeSize, 10 FomulaSimplifications, 2144 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 10 FomulaSimplificationsInter, 15393 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 828 NumberOfCodeBlocks, 828 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 807 ConstructedInterpolants, 0 QuantifiedInterpolants, 3068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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: 64]: Loop Invariant Derived loop invariant: (main__t == 0 || 1 <= main__t) && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__t <= main__tagbuf_len - InvariantResult [Line: 2591]: Loop Invariant Derived loop invariant: 59 <= main__t && main__t < main__tagbuf_len - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 <= main__t || (((\old(__tmp_3904_0) == __tmp_3904_0 && \old(__tmp_2609_0) == __tmp_2609_0) && \old(__return_2598) == __return_2598) && \old(__tmp_3904_1) == __tmp_3904_1) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((!(main__tagbuf_len <= main__t) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-27 10:46:30,622 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...