/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:29:03,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:29:03,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:29:03,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:29:03,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:29:03,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:29:03,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:29:03,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:29:03,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:29:03,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:29:03,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:29:03,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:29:03,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:29:03,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:29:03,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:29:03,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:29:03,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:29:03,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:29:03,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:29:03,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:29:03,980 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:29:03,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:29:03,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:29:03,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:29:03,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:29:03,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:29:03,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:29:03,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:29:03,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:29:03,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:29:03,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:29:03,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:29:03,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:29:03,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:29:03,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:29:03,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:29:03,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:29:03,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:29:03,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:29:03,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:29:03,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:29:03,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:29:03,995 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:29:04,003 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:29:04,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:29:04,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:29:04,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:29:04,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:29:04,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:29:04,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:29:04,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:29:04,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:29:04,005 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:29:04,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:29:04,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:29:04,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:29:04,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:29:04,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:29:04,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:29:04,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:29:04,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:29:04,006 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:29:04,006 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:29:04,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:29:04,006 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:29:04,006 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-15 12:29:04,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:29:04,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:29:04,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:29:04,234 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:29:04,234 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:29:04,235 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-15 12:29:04,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17874e80d/20eb47fc440f4df689f49a78ff5b9129/FLAG0cb524ba4 [2022-04-15 12:29:04,648 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:29:04,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2022-04-15 12:29:04,676 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17874e80d/20eb47fc440f4df689f49a78ff5b9129/FLAG0cb524ba4 [2022-04-15 12:29:05,025 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17874e80d/20eb47fc440f4df689f49a78ff5b9129 [2022-04-15 12:29:05,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:29:05,028 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:29:05,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:29:05,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:29:05,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:29:05,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:29:05" (1/1) ... [2022-04-15 12:29:05,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1908a724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:29:05, skipping insertion in model container [2022-04-15 12:29:05,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:29:05" (1/1) ... [2022-04-15 12:29:05,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:29:05,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:29:05,247 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-15 12:29:05,250 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-15 12:29:05,252 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-15 12:29:05,253 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-15 12:29:05,254 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-15 12:29:05,255 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-15 12:29:05,257 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-15 12:29:05,258 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-15 12:29:05,260 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-15 12:29:05,261 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-15 12:29:05,262 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-15 12:29:05,263 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-15 12:29:05,265 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-15 12:29:05,266 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-15 12:29:05,416 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-15 12:29:05,419 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-15 12:29:05,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:29:05,437 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:29:05,446 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-15 12:29:05,447 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-15 12:29:05,448 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-15 12:29:05,449 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-15 12:29:05,450 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-15 12:29:05,451 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-15 12:29:05,452 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-15 12:29:05,452 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-15 12:29:05,453 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-15 12:29:05,454 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-15 12:29:05,454 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-15 12:29:05,455 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-15 12:29:05,456 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-15 12:29:05,456 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-15 12:29:05,546 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-15 12:29:05,549 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-15 12:29:05,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:29:05,566 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:29:05,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:29:05 WrapperNode [2022-04-15 12:29:05,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:29:05,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:29:05,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:29:05,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:29:05,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:29:05" (1/1) ... [2022-04-15 12:29:05,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:29:05" (1/1) ... [2022-04-15 12:29:05,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:29:05" (1/1) ... [2022-04-15 12:29:05,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:29:05" (1/1) ... [2022-04-15 12:29:05,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:29:05" (1/1) ... [2022-04-15 12:29:05,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:29:05" (1/1) ... [2022-04-15 12:29:05,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:29:05" (1/1) ... [2022-04-15 12:29:05,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:29:05,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:29:05,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:29:05,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:29:05,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:29:05" (1/1) ... [2022-04-15 12:29:05,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:29:05,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:29:05,701 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-15 12:29:05,703 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-15 12:29:05,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:29:05,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:29:05,736 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:29:05,736 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:29:05,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:29:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:29:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:29:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:29:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:29:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:29:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:29:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:29:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:29:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:29:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:29:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:29:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:29:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:29:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:29:05,944 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:29:05,945 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:29:06,808 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:29:06,820 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:29:06,820 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-15 12:29:06,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:29:06 BoogieIcfgContainer [2022-04-15 12:29:06,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:29:06,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:29:06,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:29:06,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:29:06,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:29:05" (1/3) ... [2022-04-15 12:29:06,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59be4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:29:06, skipping insertion in model container [2022-04-15 12:29:06,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:29:05" (2/3) ... [2022-04-15 12:29:06,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59be4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:29:06, skipping insertion in model container [2022-04-15 12:29:06,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:29:06" (3/3) ... [2022-04-15 12:29:06,828 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2022-04-15 12:29:06,832 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:29:06,832 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-04-15 12:29:06,876 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:29:06,882 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-15 12:29:06,882 INFO L341 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-04-15 12:29:06,921 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-15 12:29:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:29:06,926 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:06,927 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:06,927 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:06,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash -191009829, now seen corresponding path program 1 times [2022-04-15 12:29:06,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:06,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2005438531] [2022-04-15 12:29:06,950 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash -191009829, now seen corresponding path program 2 times [2022-04-15 12:29:06,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:06,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948715070] [2022-04-15 12:29:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:06,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:07,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:07,184 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-15 12:29:07,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume true; {312#true} is VALID [2022-04-15 12:29:07,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {312#true} {312#true} #1237#return; {312#true} is VALID [2022-04-15 12:29:07,186 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-15 12:29:07,186 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-15 12:29:07,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume true; {312#true} is VALID [2022-04-15 12:29:07,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {312#true} {312#true} #1237#return; {312#true} is VALID [2022-04-15 12:29:07,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {312#true} call #t~ret69 := main(); {312#true} is VALID [2022-04-15 12:29:07,187 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-15 12:29:07,188 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-15 12:29:07,188 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-15 12:29:07,191 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-15 12:29:07,192 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-15 12:29:07,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-04-15 12:29:07,192 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-15 12:29:07,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:07,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948715070] [2022-04-15 12:29:07,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948715070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:07,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:07,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:29:07,197 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:07,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2005438531] [2022-04-15 12:29:07,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2005438531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:07,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:07,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:29:07,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988592386] [2022-04-15 12:29:07,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:07,202 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-15 12:29:07,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:07,206 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-15 12:29:07,220 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-15 12:29:07,221 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:29:07,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:07,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:29:07,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:29:07,243 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-15 12:29:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:09,451 INFO L93 Difference]: Finished difference Result 327 states and 589 transitions. [2022-04-15 12:29:09,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:29:09,451 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-15 12:29:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:09,452 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-15 12:29:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 589 transitions. [2022-04-15 12:29:09,470 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-15 12:29:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 589 transitions. [2022-04-15 12:29:09,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 589 transitions. [2022-04-15 12:29:09,998 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-15 12:29:10,023 INFO L225 Difference]: With dead ends: 327 [2022-04-15 12:29:10,024 INFO L226 Difference]: Without dead ends: 307 [2022-04-15 12:29:10,026 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:29:10,028 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 862 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:29:10,029 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [862 Valid, 179 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:29:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-15 12:29:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 302. [2022-04-15 12:29:10,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:10,222 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-15 12:29:10,224 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-15 12:29:10,224 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-15 12:29:10,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:10,241 INFO L93 Difference]: Finished difference Result 307 states and 429 transitions. [2022-04-15 12:29:10,241 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 429 transitions. [2022-04-15 12:29:10,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:10,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:10,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-15 12:29:10,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-15 12:29:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:10,262 INFO L93 Difference]: Finished difference Result 307 states and 429 transitions. [2022-04-15 12:29:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 429 transitions. [2022-04-15 12:29:10,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:10,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:10,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:10,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:10,265 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-15 12:29:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2022-04-15 12:29:10,276 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 11 [2022-04-15 12:29:10,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:10,276 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2022-04-15 12:29:10,276 INFO L479 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-15 12:29:10,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 302 states and 425 transitions. [2022-04-15 12:29:10,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2022-04-15 12:29:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:29:10,630 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:10,630 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:10,630 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:29:10,631 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:10,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:10,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1626334337, now seen corresponding path program 1 times [2022-04-15 12:29:10,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:10,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [349649840] [2022-04-15 12:29:10,632 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:10,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1626334337, now seen corresponding path program 2 times [2022-04-15 12:29:10,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:10,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065468868] [2022-04-15 12:29:10,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:10,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:10,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:10,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {2208#(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; {2200#true} is VALID [2022-04-15 12:29:10,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {2200#true} assume true; {2200#true} is VALID [2022-04-15 12:29:10,726 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2200#true} {2200#true} #1237#return; {2200#true} is VALID [2022-04-15 12:29:10,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {2200#true} call ULTIMATE.init(); {2208#(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-15 12:29:10,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {2208#(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; {2200#true} is VALID [2022-04-15 12:29:10,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {2200#true} assume true; {2200#true} is VALID [2022-04-15 12:29:10,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2200#true} {2200#true} #1237#return; {2200#true} is VALID [2022-04-15 12:29:10,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {2200#true} call #t~ret69 := main(); {2200#true} is VALID [2022-04-15 12:29:10,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {2200#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; {2200#true} is VALID [2022-04-15 12:29:10,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {2200#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2205#(or (= main_~main__t~0 0) (<= main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2022-04-15 12:29:10,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {2205#(or (= main_~main__t~0 0) (<= main_~main__t~0 main_~main__tagbuf_len~0))} assume ~main__t~0 == ~main__tagbuf_len~0; {2206#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:10,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {2206#(<= 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; {2206#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:10,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {2206#(<= 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; {2207#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-15 12:29:10,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {2207#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {2201#false} is VALID [2022-04-15 12:29:10,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {2201#false} assume !false; {2201#false} is VALID [2022-04-15 12:29:10,731 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-15 12:29:10,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:10,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065468868] [2022-04-15 12:29:10,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065468868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:10,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:10,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:29:10,732 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:10,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [349649840] [2022-04-15 12:29:10,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [349649840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:10,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:10,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:29:10,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206695103] [2022-04-15 12:29:10,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:10,733 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-15 12:29:10,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:10,734 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-15 12:29:10,741 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-15 12:29:10,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:29:10,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:10,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:29:10,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:29:10,742 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-15 12:29:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:12,853 INFO L93 Difference]: Finished difference Result 312 states and 435 transitions. [2022-04-15 12:29:12,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:29:12,853 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-15 12:29:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:12,854 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-15 12:29:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 435 transitions. [2022-04-15 12:29:12,857 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-15 12:29:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 435 transitions. [2022-04-15 12:29:12,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 435 transitions. [2022-04-15 12:29:13,161 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-15 12:29:13,166 INFO L225 Difference]: With dead ends: 312 [2022-04-15 12:29:13,166 INFO L226 Difference]: Without dead ends: 304 [2022-04-15 12:29:13,166 INFO L912 BasicCegarLoop]: 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-15 12:29:13,167 INFO L913 BasicCegarLoop]: 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-15 12:29:13,167 INFO L914 BasicCegarLoop]: 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-15 12:29:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-04-15 12:29:13,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2022-04-15 12:29:13,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:13,297 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-15 12:29:13,297 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-15 12:29:13,298 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-15 12:29:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:13,304 INFO L93 Difference]: Finished difference Result 304 states and 367 transitions. [2022-04-15 12:29:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 367 transitions. [2022-04-15 12:29:13,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:13,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:13,305 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-15 12:29:13,306 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-15 12:29:13,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:13,312 INFO L93 Difference]: Finished difference Result 304 states and 367 transitions. [2022-04-15 12:29:13,312 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 367 transitions. [2022-04-15 12:29:13,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:13,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:13,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:13,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:13,314 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-15 12:29:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2022-04-15 12:29:13,326 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2022-04-15 12:29:13,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:13,326 INFO L478 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2022-04-15 12:29:13,326 INFO L479 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-15 12:29:13,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 297 states and 360 transitions. [2022-04-15 12:29:13,597 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-15 12:29:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2022-04-15 12:29:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:29:13,598 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:13,598 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:13,598 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:29:13,598 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:13,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:13,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1610084340, now seen corresponding path program 1 times [2022-04-15 12:29:13,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:13,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1607246945] [2022-04-15 12:29:13,599 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:13,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1610084340, now seen corresponding path program 2 times [2022-04-15 12:29:13,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:13,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111680023] [2022-04-15 12:29:13,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:13,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:13,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {4050#(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; {4043#true} is VALID [2022-04-15 12:29:13,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {4043#true} assume true; {4043#true} is VALID [2022-04-15 12:29:13,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4043#true} {4043#true} #1237#return; {4043#true} is VALID [2022-04-15 12:29:13,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {4043#true} call ULTIMATE.init(); {4050#(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-15 12:29:13,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {4050#(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; {4043#true} is VALID [2022-04-15 12:29:13,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {4043#true} assume true; {4043#true} is VALID [2022-04-15 12:29:13,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4043#true} {4043#true} #1237#return; {4043#true} is VALID [2022-04-15 12:29:13,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {4043#true} call #t~ret69 := main(); {4043#true} is VALID [2022-04-15 12:29:13,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {4043#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; {4043#true} is VALID [2022-04-15 12:29:13,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {4043#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4048#(<= 0 main_~main__t~0)} is VALID [2022-04-15 12:29:13,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {4048#(<= 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; {4048#(<= 0 main_~main__t~0)} is VALID [2022-04-15 12:29:13,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {4048#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {4048#(<= 0 main_~main__t~0)} is VALID [2022-04-15 12:29:13,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {4048#(<= 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; {4049#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-15 12:29:13,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {4049#(not (= main_~__VERIFIER_assert__cond~2 0))} assume 0 == ~__VERIFIER_assert__cond~2; {4044#false} is VALID [2022-04-15 12:29:13,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {4044#false} assume !false; {4044#false} is VALID [2022-04-15 12:29:13,671 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-15 12:29:13,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:13,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111680023] [2022-04-15 12:29:13,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111680023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:13,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:13,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:29:13,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:13,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1607246945] [2022-04-15 12:29:13,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1607246945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:13,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:13,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:29:13,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606350101] [2022-04-15 12:29:13,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:13,673 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-15 12:29:13,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:13,673 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-15 12:29:13,681 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-15 12:29:13,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:29:13,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:13,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:29:13,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:29:13,682 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-15 12:29:15,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:15,041 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2022-04-15 12:29:15,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:29:15,041 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-15 12:29:15,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:15,041 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-15 12:29:15,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 360 transitions. [2022-04-15 12:29:15,047 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-15 12:29:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 360 transitions. [2022-04-15 12:29:15,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 360 transitions. [2022-04-15 12:29:15,330 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-15 12:29:15,335 INFO L225 Difference]: With dead ends: 297 [2022-04-15 12:29:15,335 INFO L226 Difference]: Without dead ends: 295 [2022-04-15 12:29:15,335 INFO L912 BasicCegarLoop]: 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-15 12:29:15,344 INFO L913 BasicCegarLoop]: 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:29:15,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 118 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:29:15,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-04-15 12:29:15,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-04-15 12:29:15,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:15,479 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-15 12:29:15,479 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-15 12:29:15,480 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-15 12:29:15,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:15,497 INFO L93 Difference]: Finished difference Result 295 states and 358 transitions. [2022-04-15 12:29:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2022-04-15 12:29:15,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:15,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:15,499 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-15 12:29:15,499 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-15 12:29:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:15,505 INFO L93 Difference]: Finished difference Result 295 states and 358 transitions. [2022-04-15 12:29:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2022-04-15 12:29:15,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:15,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:15,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:15,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:15,508 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-15 12:29:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2022-04-15 12:29:15,514 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 12 [2022-04-15 12:29:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:15,515 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2022-04-15 12:29:15,515 INFO L479 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-15 12:29:15,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 295 states and 358 transitions. [2022-04-15 12:29:15,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:15,780 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2022-04-15 12:29:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:29:15,781 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:15,781 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:15,781 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:29:15,781 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:15,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:15,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1626996098, now seen corresponding path program 1 times [2022-04-15 12:29:15,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:15,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [513242026] [2022-04-15 12:29:15,782 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:15,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1626996098, now seen corresponding path program 2 times [2022-04-15 12:29:15,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:15,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532655055] [2022-04-15 12:29:15,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:15,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:15,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:15,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {5838#(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; {5831#true} is VALID [2022-04-15 12:29:15,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {5831#true} assume true; {5831#true} is VALID [2022-04-15 12:29:15,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5831#true} {5831#true} #1237#return; {5831#true} is VALID [2022-04-15 12:29:15,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {5831#true} call ULTIMATE.init(); {5838#(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-15 12:29:15,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {5838#(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; {5831#true} is VALID [2022-04-15 12:29:15,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {5831#true} assume true; {5831#true} is VALID [2022-04-15 12:29:15,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5831#true} {5831#true} #1237#return; {5831#true} is VALID [2022-04-15 12:29:15,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {5831#true} call #t~ret69 := main(); {5831#true} is VALID [2022-04-15 12:29:15,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {5831#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; {5831#true} is VALID [2022-04-15 12:29:15,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {5831#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5836#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-15 12:29:15,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {5836#(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; {5836#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-15 12:29:15,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {5836#(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; {5836#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-15 12:29:15,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {5836#(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; {5836#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-15 12:29:15,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {5836#(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; {5837#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-15 12:29:15,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {5837#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {5832#false} is VALID [2022-04-15 12:29:15,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {5832#false} assume !false; {5832#false} is VALID [2022-04-15 12:29:15,869 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-15 12:29:15,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:15,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532655055] [2022-04-15 12:29:15,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532655055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:15,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:15,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:29:15,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:15,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [513242026] [2022-04-15 12:29:15,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [513242026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:15,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:15,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:29:15,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073602664] [2022-04-15 12:29:15,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:15,870 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-15 12:29:15,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:15,871 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-15 12:29:15,878 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-15 12:29:15,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:29:15,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:15,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:29:15,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:29:15,879 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-15 12:29:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:17,225 INFO L93 Difference]: Finished difference Result 300 states and 363 transitions. [2022-04-15 12:29:17,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:29:17,225 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-15 12:29:17,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:17,226 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-15 12:29:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 363 transitions. [2022-04-15 12:29:17,231 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-15 12:29:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 363 transitions. [2022-04-15 12:29:17,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 363 transitions. [2022-04-15 12:29:17,508 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-15 12:29:17,512 INFO L225 Difference]: With dead ends: 300 [2022-04-15 12:29:17,513 INFO L226 Difference]: Without dead ends: 298 [2022-04-15 12:29:17,513 INFO L912 BasicCegarLoop]: 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-15 12:29:17,514 INFO L913 BasicCegarLoop]: 351 mSDtfsCounter, 279 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:29:17,514 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 406 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:29:17,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-04-15 12:29:17,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-04-15 12:29:17,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:17,645 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-15 12:29:17,645 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-15 12:29:17,646 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-15 12:29:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:17,652 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2022-04-15 12:29:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2022-04-15 12:29:17,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:17,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:17,653 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-15 12:29:17,653 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-15 12:29:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:17,658 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2022-04-15 12:29:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2022-04-15 12:29:17,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:17,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:17,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:17,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:17,660 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-15 12:29:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2022-04-15 12:29:17,665 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 13 [2022-04-15 12:29:17,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:17,665 INFO L478 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2022-04-15 12:29:17,665 INFO L479 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-15 12:29:17,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 298 states and 361 transitions. [2022-04-15 12:29:17,952 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-15 12:29:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2022-04-15 12:29:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:29:17,956 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:17,956 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:17,956 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:29:17,956 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:17,957 INFO L85 PathProgramCache]: Analyzing trace with hash 175251398, now seen corresponding path program 1 times [2022-04-15 12:29:17,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:17,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1634712807] [2022-04-15 12:29:17,957 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:17,957 INFO L85 PathProgramCache]: Analyzing trace with hash 175251398, now seen corresponding path program 2 times [2022-04-15 12:29:17,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:17,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360865133] [2022-04-15 12:29:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:18,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:18,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {7645#(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; {7637#true} is VALID [2022-04-15 12:29:18,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-15 12:29:18,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7637#true} {7637#true} #1237#return; {7637#true} is VALID [2022-04-15 12:29:18,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {7637#true} call ULTIMATE.init(); {7645#(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-15 12:29:18,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {7645#(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; {7637#true} is VALID [2022-04-15 12:29:18,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-15 12:29:18,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7637#true} {7637#true} #1237#return; {7637#true} is VALID [2022-04-15 12:29:18,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {7637#true} call #t~ret69 := main(); {7637#true} is VALID [2022-04-15 12:29:18,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {7637#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; {7637#true} is VALID [2022-04-15 12:29:18,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {7637#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7642#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:18,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {7642#(= 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; {7642#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:18,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {7642#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {7642#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:18,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {7642#(= 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; {7642#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:18,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {7642#(= 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; {7642#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:18,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {7642#(= 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; {7643#(<= 1 main_~main__t~0)} is VALID [2022-04-15 12:29:18,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {7643#(<= 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; {7644#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-15 12:29:18,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {7644#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {7638#false} is VALID [2022-04-15 12:29:18,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {7638#false} assume !false; {7638#false} is VALID [2022-04-15 12:29:18,024 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-15 12:29:18,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:18,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360865133] [2022-04-15 12:29:18,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360865133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:18,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:18,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:29:18,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:18,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1634712807] [2022-04-15 12:29:18,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1634712807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:18,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:18,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:29:18,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135724863] [2022-04-15 12:29:18,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:18,025 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-15 12:29:18,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:18,026 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-15 12:29:18,033 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-15 12:29:18,033 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:29:18,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:18,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:29:18,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:29:18,034 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-15 12:29:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:19,819 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2022-04-15 12:29:19,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:29:19,819 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-15 12:29:19,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:19,820 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-15 12:29:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 361 transitions. [2022-04-15 12:29:19,822 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-15 12:29:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 361 transitions. [2022-04-15 12:29:19,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 361 transitions. [2022-04-15 12:29:20,101 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-15 12:29:20,106 INFO L225 Difference]: With dead ends: 298 [2022-04-15 12:29:20,106 INFO L226 Difference]: Without dead ends: 296 [2022-04-15 12:29:20,106 INFO L912 BasicCegarLoop]: 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-15 12:29:20,107 INFO L913 BasicCegarLoop]: 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-15 12:29:20,107 INFO L914 BasicCegarLoop]: 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-15 12:29:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-04-15 12:29:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-04-15 12:29:20,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:20,340 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-15 12:29:20,340 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-15 12:29:20,341 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-15 12:29:20,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:20,345 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2022-04-15 12:29:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2022-04-15 12:29:20,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:20,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:20,347 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-15 12:29:20,347 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-15 12:29:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:20,352 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2022-04-15 12:29:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2022-04-15 12:29:20,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:20,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:20,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:20,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:20,353 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-15 12:29:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2022-04-15 12:29:20,359 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 15 [2022-04-15 12:29:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:20,359 INFO L478 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2022-04-15 12:29:20,359 INFO L479 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-15 12:29:20,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 359 transitions. [2022-04-15 12:29:20,638 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-15 12:29:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2022-04-15 12:29:20,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:29:20,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:20,639 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:20,639 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 12:29:20,639 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:20,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:20,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1137829144, now seen corresponding path program 1 times [2022-04-15 12:29:20,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:20,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1820342160] [2022-04-15 12:29:20,640 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:20,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1137829144, now seen corresponding path program 2 times [2022-04-15 12:29:20,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:20,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50007811] [2022-04-15 12:29:20,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:20,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:20,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:20,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {9441#(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; {9434#true} is VALID [2022-04-15 12:29:20,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {9434#true} assume true; {9434#true} is VALID [2022-04-15 12:29:20,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9434#true} {9434#true} #1237#return; {9434#true} is VALID [2022-04-15 12:29:20,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {9434#true} call ULTIMATE.init(); {9441#(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-15 12:29:20,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {9441#(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; {9434#true} is VALID [2022-04-15 12:29:20,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {9434#true} assume true; {9434#true} is VALID [2022-04-15 12:29:20,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9434#true} {9434#true} #1237#return; {9434#true} is VALID [2022-04-15 12:29:20,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {9434#true} call #t~ret69 := main(); {9434#true} is VALID [2022-04-15 12:29:20,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {9434#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; {9434#true} is VALID [2022-04-15 12:29:20,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {9434#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {9434#true} is VALID [2022-04-15 12:29:20,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {9434#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; {9434#true} is VALID [2022-04-15 12:29:20,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {9434#true} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {9434#true} is VALID [2022-04-15 12:29:20,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {9434#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; {9434#true} is VALID [2022-04-15 12:29:20,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {9434#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; {9434#true} is VALID [2022-04-15 12:29:20,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {9434#true} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9434#true} is VALID [2022-04-15 12:29:20,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {9434#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; {9439#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:20,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {9439#(<= 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; {9440#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-15 12:29:20,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {9440#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {9435#false} is VALID [2022-04-15 12:29:20,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {9435#false} assume !false; {9435#false} is VALID [2022-04-15 12:29:20,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-15 12:29:20,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:20,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50007811] [2022-04-15 12:29:20,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50007811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:20,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:20,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:29:20,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:20,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1820342160] [2022-04-15 12:29:20,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1820342160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:20,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:20,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:29:20,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848164771] [2022-04-15 12:29:20,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:20,703 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-15 12:29:20,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:20,703 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-15 12:29:20,711 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-15 12:29:20,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:29:20,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:20,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:29:20,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:29:20,712 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-15 12:29:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:22,064 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2022-04-15 12:29:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:29:22,065 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-15 12:29:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:22,065 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-15 12:29:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 359 transitions. [2022-04-15 12:29:22,067 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-15 12:29:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 359 transitions. [2022-04-15 12:29:22,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 359 transitions. [2022-04-15 12:29:22,328 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-15 12:29:22,333 INFO L225 Difference]: With dead ends: 296 [2022-04-15 12:29:22,334 INFO L226 Difference]: Without dead ends: 292 [2022-04-15 12:29:22,334 INFO L912 BasicCegarLoop]: 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-15 12:29:22,334 INFO L913 BasicCegarLoop]: 345 mSDtfsCounter, 250 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:29:22,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 425 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:29:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-15 12:29:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-04-15 12:29:22,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:22,582 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-15 12:29:22,582 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-15 12:29:22,583 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-15 12:29:22,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:22,587 INFO L93 Difference]: Finished difference Result 292 states and 355 transitions. [2022-04-15 12:29:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2022-04-15 12:29:22,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:22,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:22,589 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-15 12:29:22,589 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-15 12:29:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:22,594 INFO L93 Difference]: Finished difference Result 292 states and 355 transitions. [2022-04-15 12:29:22,594 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2022-04-15 12:29:22,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:22,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:22,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:22,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:22,595 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-15 12:29:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2022-04-15 12:29:22,601 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 16 [2022-04-15 12:29:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:22,601 INFO L478 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2022-04-15 12:29:22,601 INFO L479 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-15 12:29:22,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 292 states and 355 transitions. [2022-04-15 12:29:22,874 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-15 12:29:22,874 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2022-04-15 12:29:22,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:29:22,875 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:22,875 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:22,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:29:22,875 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash 926233143, now seen corresponding path program 1 times [2022-04-15 12:29:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:22,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [586372104] [2022-04-15 12:29:22,876 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:22,876 INFO L85 PathProgramCache]: Analyzing trace with hash 926233143, now seen corresponding path program 2 times [2022-04-15 12:29:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:22,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089256264] [2022-04-15 12:29:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:22,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:22,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:22,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {11217#(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; {11209#true} is VALID [2022-04-15 12:29:22,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {11209#true} assume true; {11209#true} is VALID [2022-04-15 12:29:22,938 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11209#true} {11209#true} #1237#return; {11209#true} is VALID [2022-04-15 12:29:22,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {11209#true} call ULTIMATE.init(); {11217#(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-15 12:29:22,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {11217#(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; {11209#true} is VALID [2022-04-15 12:29:22,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {11209#true} assume true; {11209#true} is VALID [2022-04-15 12:29:22,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11209#true} {11209#true} #1237#return; {11209#true} is VALID [2022-04-15 12:29:22,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {11209#true} call #t~ret69 := main(); {11209#true} is VALID [2022-04-15 12:29:22,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {11209#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; {11209#true} is VALID [2022-04-15 12:29:22,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {11209#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {11214#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:22,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {11214#(= 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; {11214#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:22,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {11214#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {11214#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:22,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {11214#(= 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; {11214#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:22,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {11214#(= 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; {11214#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:22,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {11214#(= 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; {11215#(<= 1 main_~main__t~0)} is VALID [2022-04-15 12:29:22,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {11215#(<= 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; {11215#(<= 1 main_~main__t~0)} is VALID [2022-04-15 12:29:22,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {11215#(<= 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; {11215#(<= 1 main_~main__t~0)} is VALID [2022-04-15 12:29:22,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {11215#(<= 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; {11216#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-15 12:29:22,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {11216#(not (= main_~__VERIFIER_assert__cond~6 0))} assume 0 == ~__VERIFIER_assert__cond~6; {11210#false} is VALID [2022-04-15 12:29:22,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {11210#false} assume !false; {11210#false} is VALID [2022-04-15 12:29:22,945 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-15 12:29:22,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:22,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089256264] [2022-04-15 12:29:22,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089256264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:22,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:22,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:29:22,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:22,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [586372104] [2022-04-15 12:29:22,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [586372104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:22,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:22,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:29:22,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092204023] [2022-04-15 12:29:22,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:22,946 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-15 12:29:22,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:22,947 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-15 12:29:22,957 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-15 12:29:22,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:29:22,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:22,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:29:22,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:29:22,958 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-15 12:29:24,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:24,824 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-04-15 12:29:24,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:29:24,824 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-15 12:29:24,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:24,826 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-15 12:29:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 374 transitions. [2022-04-15 12:29:24,829 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-15 12:29:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 374 transitions. [2022-04-15 12:29:24,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 374 transitions. [2022-04-15 12:29:25,127 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-15 12:29:25,133 INFO L225 Difference]: With dead ends: 309 [2022-04-15 12:29:25,133 INFO L226 Difference]: Without dead ends: 307 [2022-04-15 12:29:25,134 INFO L912 BasicCegarLoop]: 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-15 12:29:25,134 INFO L913 BasicCegarLoop]: 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-15 12:29:25,134 INFO L914 BasicCegarLoop]: 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-15 12:29:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-15 12:29:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 290. [2022-04-15 12:29:25,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:25,381 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-15 12:29:25,381 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-15 12:29:25,382 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-15 12:29:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:25,387 INFO L93 Difference]: Finished difference Result 307 states and 372 transitions. [2022-04-15 12:29:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 372 transitions. [2022-04-15 12:29:25,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:25,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:25,388 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-15 12:29:25,390 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-15 12:29:25,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:25,395 INFO L93 Difference]: Finished difference Result 307 states and 372 transitions. [2022-04-15 12:29:25,395 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 372 transitions. [2022-04-15 12:29:25,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:25,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:25,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:25,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:25,396 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-15 12:29:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 353 transitions. [2022-04-15 12:29:25,401 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 353 transitions. Word has length 17 [2022-04-15 12:29:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:25,402 INFO L478 AbstractCegarLoop]: Abstraction has 290 states and 353 transitions. [2022-04-15 12:29:25,402 INFO L479 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-15 12:29:25,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 290 states and 353 transitions. [2022-04-15 12:29:25,703 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-15 12:29:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 353 transitions. [2022-04-15 12:29:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:29:25,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:25,704 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:25,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 12:29:25,704 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash 927772343, now seen corresponding path program 1 times [2022-04-15 12:29:25,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:25,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1332261519] [2022-04-15 12:29:25,705 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:25,705 INFO L85 PathProgramCache]: Analyzing trace with hash 927772343, now seen corresponding path program 2 times [2022-04-15 12:29:25,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:25,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223174371] [2022-04-15 12:29:25,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:25,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:25,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:25,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {13046#(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; {13038#true} is VALID [2022-04-15 12:29:25,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {13038#true} assume true; {13038#true} is VALID [2022-04-15 12:29:25,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13038#true} {13038#true} #1237#return; {13038#true} is VALID [2022-04-15 12:29:25,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {13038#true} call ULTIMATE.init(); {13046#(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-15 12:29:25,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {13046#(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; {13038#true} is VALID [2022-04-15 12:29:25,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {13038#true} assume true; {13038#true} is VALID [2022-04-15 12:29:25,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13038#true} {13038#true} #1237#return; {13038#true} is VALID [2022-04-15 12:29:25,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {13038#true} call #t~ret69 := main(); {13038#true} is VALID [2022-04-15 12:29:25,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {13038#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; {13038#true} is VALID [2022-04-15 12:29:25,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {13038#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {13043#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:25,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {13043#(= 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; {13043#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:25,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {13043#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {13043#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:25,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {13043#(= 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; {13043#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:25,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {13043#(= 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; {13043#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:25,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {13043#(= 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; {13044#(<= 1 main_~main__t~0)} is VALID [2022-04-15 12:29:25,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {13044#(<= 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; {13044#(<= 1 main_~main__t~0)} is VALID [2022-04-15 12:29:25,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {13044#(<= 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; {13044#(<= 1 main_~main__t~0)} is VALID [2022-04-15 12:29:25,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {13044#(<= 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; {13045#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-15 12:29:25,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {13045#(not (= main_~__VERIFIER_assert__cond~12 0))} assume 0 == ~__VERIFIER_assert__cond~12; {13039#false} is VALID [2022-04-15 12:29:25,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {13039#false} assume !false; {13039#false} is VALID [2022-04-15 12:29:25,769 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-15 12:29:25,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:25,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223174371] [2022-04-15 12:29:25,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223174371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:25,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:25,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:29:25,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:25,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1332261519] [2022-04-15 12:29:25,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1332261519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:25,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:25,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:29:25,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899345662] [2022-04-15 12:29:25,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:25,770 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-15 12:29:25,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:25,770 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-15 12:29:25,786 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-15 12:29:25,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:29:25,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:25,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:29:25,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:29:25,787 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-15 12:29:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:27,488 INFO L93 Difference]: Finished difference Result 290 states and 353 transitions. [2022-04-15 12:29:27,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:29:27,489 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-15 12:29:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:27,489 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-15 12:29:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 353 transitions. [2022-04-15 12:29:27,491 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-15 12:29:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 353 transitions. [2022-04-15 12:29:27,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 353 transitions. [2022-04-15 12:29:27,764 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-15 12:29:27,768 INFO L225 Difference]: With dead ends: 290 [2022-04-15 12:29:27,769 INFO L226 Difference]: Without dead ends: 288 [2022-04-15 12:29:27,769 INFO L912 BasicCegarLoop]: 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-15 12:29:27,769 INFO L913 BasicCegarLoop]: 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-15 12:29:27,769 INFO L914 BasicCegarLoop]: 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-15 12:29:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-04-15 12:29:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-04-15 12:29:28,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:28,031 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-15 12:29:28,031 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-15 12:29:28,032 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-15 12:29:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:28,036 INFO L93 Difference]: Finished difference Result 288 states and 351 transitions. [2022-04-15 12:29:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-04-15 12:29:28,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:28,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:28,038 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-15 12:29:28,039 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-15 12:29:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:28,044 INFO L93 Difference]: Finished difference Result 288 states and 351 transitions. [2022-04-15 12:29:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-04-15 12:29:28,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:28,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:28,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:28,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:28,046 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-15 12:29:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2022-04-15 12:29:28,054 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 17 [2022-04-15 12:29:28,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:28,054 INFO L478 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2022-04-15 12:29:28,054 INFO L479 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-15 12:29:28,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 288 states and 351 transitions. [2022-04-15 12:29:28,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 351 edges. 351 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-04-15 12:29:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:29:28,373 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:28,373 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:28,373 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 12:29:28,373 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:28,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:28,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1470973679, now seen corresponding path program 1 times [2022-04-15 12:29:28,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:28,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1341456188] [2022-04-15 12:29:28,374 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:28,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1470973679, now seen corresponding path program 2 times [2022-04-15 12:29:28,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:28,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874309448] [2022-04-15 12:29:28,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:28,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:28,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:28,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {14796#(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; {14787#true} is VALID [2022-04-15 12:29:28,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-15 12:29:28,503 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14787#true} {14787#true} #1237#return; {14787#true} is VALID [2022-04-15 12:29:28,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {14787#true} call ULTIMATE.init(); {14796#(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-15 12:29:28,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {14796#(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; {14787#true} is VALID [2022-04-15 12:29:28,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-15 12:29:28,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14787#true} {14787#true} #1237#return; {14787#true} is VALID [2022-04-15 12:29:28,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {14787#true} call #t~ret69 := main(); {14787#true} is VALID [2022-04-15 12:29:28,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {14787#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; {14787#true} is VALID [2022-04-15 12:29:28,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {14787#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {14792#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-15 12:29:28,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {14792#(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; {14793#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:28,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {14793#(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; {14793#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:28,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {14793#(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; {14793#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:28,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {14793#(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; {14794#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:28,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {14794#(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; {14794#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:28,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {14794#(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; {14794#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:28,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {14794#(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; {14794#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:28,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {14794#(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; {14795#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-15 12:29:28,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {14795#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {14788#false} is VALID [2022-04-15 12:29:28,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {14788#false} assume !false; {14788#false} is VALID [2022-04-15 12:29:28,514 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-15 12:29:28,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:28,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874309448] [2022-04-15 12:29:28,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874309448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:28,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:28,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:28,514 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:28,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1341456188] [2022-04-15 12:29:28,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1341456188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:28,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:28,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:28,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223203920] [2022-04-15 12:29:28,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:28,515 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-15 12:29:28,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:28,515 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-15 12:29:28,526 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-15 12:29:28,526 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:29:28,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:28,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:29:28,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:29:28,527 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-15 12:29:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:30,778 INFO L93 Difference]: Finished difference Result 312 states and 377 transitions. [2022-04-15 12:29:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:29:30,779 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-15 12:29:30,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:30,779 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-15 12:29:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 377 transitions. [2022-04-15 12:29:30,781 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-15 12:29:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 377 transitions. [2022-04-15 12:29:30,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 377 transitions. [2022-04-15 12:29:31,098 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-15 12:29:31,102 INFO L225 Difference]: With dead ends: 312 [2022-04-15 12:29:31,103 INFO L226 Difference]: Without dead ends: 310 [2022-04-15 12:29:31,103 INFO L912 BasicCegarLoop]: 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-15 12:29:31,105 INFO L913 BasicCegarLoop]: 328 mSDtfsCounter, 314 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:29:31,106 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 433 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:29:31,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-04-15 12:29:31,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 288. [2022-04-15 12:29:31,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:31,423 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-15 12:29:31,424 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-15 12:29:31,424 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-15 12:29:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:31,429 INFO L93 Difference]: Finished difference Result 310 states and 375 transitions. [2022-04-15 12:29:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 375 transitions. [2022-04-15 12:29:31,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:31,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:31,430 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-15 12:29:31,430 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-15 12:29:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:31,436 INFO L93 Difference]: Finished difference Result 310 states and 375 transitions. [2022-04-15 12:29:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 375 transitions. [2022-04-15 12:29:31,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:31,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:31,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:31,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:31,438 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-15 12:29:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2022-04-15 12:29:31,451 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 17 [2022-04-15 12:29:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:31,451 INFO L478 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2022-04-15 12:29:31,451 INFO L479 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-15 12:29:31,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 288 states and 351 transitions. [2022-04-15 12:29:31,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 351 edges. 351 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-04-15 12:29:31,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:29:31,750 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:31,750 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:31,750 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 12:29:31,750 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:31,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:31,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1350175097, now seen corresponding path program 1 times [2022-04-15 12:29:31,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:31,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1638473997] [2022-04-15 12:29:31,751 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:31,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1350175097, now seen corresponding path program 2 times [2022-04-15 12:29:31,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:31,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49683631] [2022-04-15 12:29:31,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:31,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:31,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:31,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {16637#(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; {16629#true} is VALID [2022-04-15 12:29:31,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 12:29:31,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16629#true} {16629#true} #1237#return; {16629#true} is VALID [2022-04-15 12:29:31,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {16629#true} call ULTIMATE.init(); {16637#(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-15 12:29:31,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {16637#(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; {16629#true} is VALID [2022-04-15 12:29:31,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 12:29:31,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16629#true} {16629#true} #1237#return; {16629#true} is VALID [2022-04-15 12:29:31,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {16629#true} call #t~ret69 := main(); {16629#true} is VALID [2022-04-15 12:29:31,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {16629#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; {16629#true} is VALID [2022-04-15 12:29:31,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {16629#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {16634#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:31,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {16634#(= 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; {16634#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:31,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {16634#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {16634#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:31,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {16634#(= 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; {16634#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:31,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {16634#(= 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; {16634#(= main_~main__t~0 0)} is VALID [2022-04-15 12:29:31,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {16634#(= 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; {16635#(<= 1 main_~main__t~0)} is VALID [2022-04-15 12:29:31,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {16635#(<= 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; {16635#(<= 1 main_~main__t~0)} is VALID [2022-04-15 12:29:31,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {16635#(<= 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; {16635#(<= 1 main_~main__t~0)} is VALID [2022-04-15 12:29:31,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {16635#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_4~0); {16635#(<= 1 main_~main__t~0)} is VALID [2022-04-15 12:29:31,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {16635#(<= 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; {16636#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-15 12:29:31,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {16636#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {16630#false} is VALID [2022-04-15 12:29:31,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {16630#false} assume !false; {16630#false} is VALID [2022-04-15 12:29:31,828 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-15 12:29:31,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:31,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49683631] [2022-04-15 12:29:31,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49683631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:31,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:31,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:29:31,829 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:31,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1638473997] [2022-04-15 12:29:31,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1638473997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:31,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:31,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:29:31,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328304268] [2022-04-15 12:29:31,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:31,830 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-15 12:29:31,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:31,830 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-15 12:29:31,842 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-15 12:29:31,842 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:29:31,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:31,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:29:31,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:29:31,843 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-15 12:29:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:33,725 INFO L93 Difference]: Finished difference Result 311 states and 376 transitions. [2022-04-15 12:29:33,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:29:33,726 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-15 12:29:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:33,726 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-15 12:29:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 373 transitions. [2022-04-15 12:29:33,728 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-15 12:29:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 373 transitions. [2022-04-15 12:29:33,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 373 transitions. [2022-04-15 12:29:34,043 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-15 12:29:34,048 INFO L225 Difference]: With dead ends: 311 [2022-04-15 12:29:34,048 INFO L226 Difference]: Without dead ends: 309 [2022-04-15 12:29:34,048 INFO L912 BasicCegarLoop]: 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-15 12:29:34,049 INFO L913 BasicCegarLoop]: 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-15 12:29:34,049 INFO L914 BasicCegarLoop]: 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-15 12:29:34,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-15 12:29:34,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 286. [2022-04-15 12:29:34,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:34,337 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-15 12:29:34,337 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-15 12:29:34,337 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-15 12:29:34,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:34,342 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-04-15 12:29:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 374 transitions. [2022-04-15 12:29:34,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:34,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:34,343 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-15 12:29:34,344 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-15 12:29:34,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:34,348 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-04-15 12:29:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 374 transitions. [2022-04-15 12:29:34,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:34,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:34,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:34,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:34,350 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-15 12:29:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 349 transitions. [2022-04-15 12:29:34,354 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 349 transitions. Word has length 18 [2022-04-15 12:29:34,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:34,354 INFO L478 AbstractCegarLoop]: Abstraction has 286 states and 349 transitions. [2022-04-15 12:29:34,355 INFO L479 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-15 12:29:34,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 286 states and 349 transitions. [2022-04-15 12:29:34,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 349 transitions. [2022-04-15 12:29:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:29:34,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:34,640 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:34,640 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 12:29:34,641 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:34,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:34,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1351540517, now seen corresponding path program 1 times [2022-04-15 12:29:34,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:34,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1319348324] [2022-04-15 12:29:34,641 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:34,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1351540517, now seen corresponding path program 2 times [2022-04-15 12:29:34,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:34,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956317711] [2022-04-15 12:29:34,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:34,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:34,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:34,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {18467#(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; {18458#true} is VALID [2022-04-15 12:29:34,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {18458#true} assume true; {18458#true} is VALID [2022-04-15 12:29:34,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18458#true} {18458#true} #1237#return; {18458#true} is VALID [2022-04-15 12:29:34,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {18458#true} call ULTIMATE.init(); {18467#(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-15 12:29:34,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {18467#(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; {18458#true} is VALID [2022-04-15 12:29:34,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {18458#true} assume true; {18458#true} is VALID [2022-04-15 12:29:34,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18458#true} {18458#true} #1237#return; {18458#true} is VALID [2022-04-15 12:29:34,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {18458#true} call #t~ret69 := main(); {18458#true} is VALID [2022-04-15 12:29:34,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {18458#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; {18458#true} is VALID [2022-04-15 12:29:34,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {18458#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {18463#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-15 12:29:34,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {18463#(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; {18464#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:34,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {18464#(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; {18464#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:34,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {18464#(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; {18464#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:34,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {18464#(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; {18464#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:34,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {18464#(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; {18465#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:34,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {18465#(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; {18465#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:34,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {18465#(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; {18465#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:34,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {18465#(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; {18465#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:34,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {18465#(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; {18466#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-15 12:29:34,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {18466#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {18459#false} is VALID [2022-04-15 12:29:34,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {18459#false} assume !false; {18459#false} is VALID [2022-04-15 12:29:34,755 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-15 12:29:34,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:34,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956317711] [2022-04-15 12:29:34,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956317711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:34,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:34,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:34,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:34,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1319348324] [2022-04-15 12:29:34,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1319348324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:34,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:34,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:34,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311616899] [2022-04-15 12:29:34,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:34,756 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-15 12:29:34,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:34,757 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-15 12:29:34,767 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-15 12:29:34,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:29:34,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:34,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:29:34,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:29:34,768 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-15 12:29:37,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:37,045 INFO L93 Difference]: Finished difference Result 320 states and 387 transitions. [2022-04-15 12:29:37,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:29:37,045 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-15 12:29:37,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:37,045 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-15 12:29:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 387 transitions. [2022-04-15 12:29:37,048 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-15 12:29:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 387 transitions. [2022-04-15 12:29:37,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 387 transitions. [2022-04-15 12:29:37,323 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-15 12:29:37,327 INFO L225 Difference]: With dead ends: 320 [2022-04-15 12:29:37,328 INFO L226 Difference]: Without dead ends: 318 [2022-04-15 12:29:37,328 INFO L912 BasicCegarLoop]: 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-15 12:29:37,329 INFO L913 BasicCegarLoop]: 342 mSDtfsCounter, 286 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:29:37,329 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 473 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:29:37,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-04-15 12:29:37,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 294. [2022-04-15 12:29:37,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:37,616 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-15 12:29:37,616 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-15 12:29:37,616 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-15 12:29:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:37,620 INFO L93 Difference]: Finished difference Result 318 states and 385 transitions. [2022-04-15 12:29:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 385 transitions. [2022-04-15 12:29:37,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:37,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:37,621 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-15 12:29:37,622 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-15 12:29:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:37,626 INFO L93 Difference]: Finished difference Result 318 states and 385 transitions. [2022-04-15 12:29:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 385 transitions. [2022-04-15 12:29:37,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:37,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:37,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:37,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:37,627 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-15 12:29:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 359 transitions. [2022-04-15 12:29:37,632 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 359 transitions. Word has length 18 [2022-04-15 12:29:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:37,632 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 359 transitions. [2022-04-15 12:29:37,632 INFO L479 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-15 12:29:37,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 294 states and 359 transitions. [2022-04-15 12:29:37,939 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-15 12:29:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 359 transitions. [2022-04-15 12:29:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:29:37,939 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:37,939 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:37,940 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 12:29:37,940 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1303825267, now seen corresponding path program 1 times [2022-04-15 12:29:37,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:37,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1019018014] [2022-04-15 12:29:37,940 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:37,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1303825267, now seen corresponding path program 2 times [2022-04-15 12:29:37,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:37,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254268136] [2022-04-15 12:29:37,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:37,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:38,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:38,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {20351#(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; {20342#true} is VALID [2022-04-15 12:29:38,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {20342#true} assume true; {20342#true} is VALID [2022-04-15 12:29:38,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20342#true} {20342#true} #1237#return; {20342#true} is VALID [2022-04-15 12:29:38,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {20342#true} call ULTIMATE.init(); {20351#(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-15 12:29:38,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {20351#(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; {20342#true} is VALID [2022-04-15 12:29:38,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {20342#true} assume true; {20342#true} is VALID [2022-04-15 12:29:38,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20342#true} {20342#true} #1237#return; {20342#true} is VALID [2022-04-15 12:29:38,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {20342#true} call #t~ret69 := main(); {20342#true} is VALID [2022-04-15 12:29:38,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {20342#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; {20342#true} is VALID [2022-04-15 12:29:38,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {20342#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {20347#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-15 12:29:38,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {20347#(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; {20348#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:38,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {20348#(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; {20348#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:38,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {20348#(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; {20348#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:38,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {20348#(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; {20348#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:38,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {20348#(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; {20349#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:38,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {20349#(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; {20349#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:38,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {20349#(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; {20349#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:38,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {20349#(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; {20349#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:38,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {20349#(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; {20350#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-15 12:29:38,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {20350#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {20343#false} is VALID [2022-04-15 12:29:38,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {20343#false} assume !false; {20343#false} is VALID [2022-04-15 12:29:38,038 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-15 12:29:38,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:38,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254268136] [2022-04-15 12:29:38,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254268136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:38,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:38,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:38,038 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:38,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1019018014] [2022-04-15 12:29:38,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1019018014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:38,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:38,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:38,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307494891] [2022-04-15 12:29:38,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:38,039 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-15 12:29:38,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:38,039 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-15 12:29:38,058 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-15 12:29:38,059 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:29:38,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:38,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:29:38,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:29:38,059 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-15 12:29:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:40,278 INFO L93 Difference]: Finished difference Result 304 states and 369 transitions. [2022-04-15 12:29:40,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:29:40,279 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-15 12:29:40,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:40,279 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-15 12:29:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 369 transitions. [2022-04-15 12:29:40,281 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-15 12:29:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 369 transitions. [2022-04-15 12:29:40,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 369 transitions. [2022-04-15 12:29:40,548 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-15 12:29:40,552 INFO L225 Difference]: With dead ends: 304 [2022-04-15 12:29:40,552 INFO L226 Difference]: Without dead ends: 300 [2022-04-15 12:29:40,552 INFO L912 BasicCegarLoop]: 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-15 12:29:40,553 INFO L913 BasicCegarLoop]: 326 mSDtfsCounter, 262 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:29:40,553 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 442 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:29:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-04-15 12:29:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 295. [2022-04-15 12:29:40,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:40,862 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-15 12:29:40,863 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-15 12:29:40,863 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-15 12:29:40,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:40,867 INFO L93 Difference]: Finished difference Result 300 states and 365 transitions. [2022-04-15 12:29:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 365 transitions. [2022-04-15 12:29:40,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:40,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:40,868 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-15 12:29:40,868 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-15 12:29:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:40,872 INFO L93 Difference]: Finished difference Result 300 states and 365 transitions. [2022-04-15 12:29:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 365 transitions. [2022-04-15 12:29:40,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:40,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:40,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:40,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:40,873 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-15 12:29:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 360 transitions. [2022-04-15 12:29:40,877 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 360 transitions. Word has length 18 [2022-04-15 12:29:40,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:40,877 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 360 transitions. [2022-04-15 12:29:40,878 INFO L479 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-15 12:29:40,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 295 states and 360 transitions. [2022-04-15 12:29:41,183 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-15 12:29:41,183 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 360 transitions. [2022-04-15 12:29:41,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:29:41,184 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:41,184 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:41,184 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 12:29:41,184 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:41,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:41,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1094248106, now seen corresponding path program 1 times [2022-04-15 12:29:41,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:41,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1065140914] [2022-04-15 12:29:41,185 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:41,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1094248106, now seen corresponding path program 2 times [2022-04-15 12:29:41,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:41,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519417749] [2022-04-15 12:29:41,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:41,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:41,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:41,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {22169#(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; {22160#true} is VALID [2022-04-15 12:29:41,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {22160#true} assume true; {22160#true} is VALID [2022-04-15 12:29:41,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22160#true} {22160#true} #1237#return; {22160#true} is VALID [2022-04-15 12:29:41,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {22160#true} call ULTIMATE.init(); {22169#(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-15 12:29:41,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {22169#(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; {22160#true} is VALID [2022-04-15 12:29:41,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {22160#true} assume true; {22160#true} is VALID [2022-04-15 12:29:41,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22160#true} {22160#true} #1237#return; {22160#true} is VALID [2022-04-15 12:29:41,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {22160#true} call #t~ret69 := main(); {22160#true} is VALID [2022-04-15 12:29:41,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {22160#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; {22160#true} is VALID [2022-04-15 12:29:41,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {22160#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {22165#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-15 12:29:41,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {22165#(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; {22166#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:41,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {22166#(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; {22166#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:41,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {22166#(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; {22166#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:41,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {22166#(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; {22166#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:41,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {22166#(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; {22167#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:41,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {22167#(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; {22167#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:41,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {22167#(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; {22167#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:41,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {22167#(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); {22167#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:41,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {22167#(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; {22167#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-15 12:29:41,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {22167#(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; {22168#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-15 12:29:41,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {22168#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {22161#false} is VALID [2022-04-15 12:29:41,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {22161#false} assume !false; {22161#false} is VALID [2022-04-15 12:29:41,297 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-15 12:29:41,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:41,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519417749] [2022-04-15 12:29:41,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519417749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:41,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:41,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:41,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:41,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1065140914] [2022-04-15 12:29:41,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1065140914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:41,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:41,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:41,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109759260] [2022-04-15 12:29:41,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:41,298 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-15 12:29:41,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:41,298 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-15 12:29:41,312 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-15 12:29:41,313 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:29:41,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:41,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:29:41,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:29:41,313 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-15 12:29:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:43,206 INFO L93 Difference]: Finished difference Result 321 states and 388 transitions. [2022-04-15 12:29:43,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:29:43,206 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-15 12:29:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:43,206 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-15 12:29:43,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 388 transitions. [2022-04-15 12:29:43,209 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-15 12:29:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 388 transitions. [2022-04-15 12:29:43,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 388 transitions. [2022-04-15 12:29:43,493 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-15 12:29:43,497 INFO L225 Difference]: With dead ends: 321 [2022-04-15 12:29:43,497 INFO L226 Difference]: Without dead ends: 319 [2022-04-15 12:29:43,497 INFO L912 BasicCegarLoop]: 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-15 12:29:43,498 INFO L913 BasicCegarLoop]: 351 mSDtfsCounter, 281 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:29:43,498 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 470 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:29:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-15 12:29:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 298. [2022-04-15 12:29:43,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:43,824 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-15 12:29:43,824 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-15 12:29:43,825 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-15 12:29:43,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:43,830 INFO L93 Difference]: Finished difference Result 319 states and 386 transitions. [2022-04-15 12:29:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 386 transitions. [2022-04-15 12:29:43,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:43,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:43,831 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-15 12:29:43,832 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-15 12:29:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:43,836 INFO L93 Difference]: Finished difference Result 319 states and 386 transitions. [2022-04-15 12:29:43,837 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 386 transitions. [2022-04-15 12:29:43,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:43,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:43,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:43,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:43,838 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-15 12:29:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 363 transitions. [2022-04-15 12:29:43,842 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 363 transitions. Word has length 19 [2022-04-15 12:29:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:43,843 INFO L478 AbstractCegarLoop]: Abstraction has 298 states and 363 transitions. [2022-04-15 12:29:43,843 INFO L479 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-15 12:29:43,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 298 states and 363 transitions. [2022-04-15 12:29:44,146 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-15 12:29:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 363 transitions. [2022-04-15 12:29:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:29:44,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:44,147 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:44,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 12:29:44,147 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:44,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:44,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1750216322, now seen corresponding path program 1 times [2022-04-15 12:29:44,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:44,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1513337341] [2022-04-15 12:29:44,148 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:44,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1750216322, now seen corresponding path program 2 times [2022-04-15 12:29:44,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:44,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337190605] [2022-04-15 12:29:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:44,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:44,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:44,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {24063#(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; {24056#true} is VALID [2022-04-15 12:29:44,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {24056#true} assume true; {24056#true} is VALID [2022-04-15 12:29:44,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24056#true} {24056#true} #1237#return; {24056#true} is VALID [2022-04-15 12:29:44,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {24056#true} call ULTIMATE.init(); {24063#(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-15 12:29:44,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {24063#(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; {24056#true} is VALID [2022-04-15 12:29:44,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {24056#true} assume true; {24056#true} is VALID [2022-04-15 12:29:44,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24056#true} {24056#true} #1237#return; {24056#true} is VALID [2022-04-15 12:29:44,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {24056#true} call #t~ret69 := main(); {24056#true} is VALID [2022-04-15 12:29:44,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {24056#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; {24056#true} is VALID [2022-04-15 12:29:44,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {24056#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {24061#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:44,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {24061#(<= 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; {24061#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:44,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {24061#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {24061#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:44,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {24061#(<= 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; {24061#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:44,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {24061#(<= 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; {24061#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:44,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {24061#(<= 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; {24061#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:44,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {24061#(<= 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; {24061#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:44,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {24061#(<= 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; {24061#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:44,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {24061#(<= 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; {24061#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:44,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {24061#(<= 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; {24061#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:44,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {24061#(<= 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; {24061#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:44,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {24061#(<= 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; {24062#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-15 12:29:44,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {24062#(not (= main_~__VERIFIER_assert__cond~8 0))} assume 0 == ~__VERIFIER_assert__cond~8; {24057#false} is VALID [2022-04-15 12:29:44,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {24057#false} assume !false; {24057#false} is VALID [2022-04-15 12:29:44,194 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-15 12:29:44,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:44,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337190605] [2022-04-15 12:29:44,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337190605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:44,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:44,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:29:44,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:44,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1513337341] [2022-04-15 12:29:44,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1513337341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:44,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:44,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:29:44,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75062050] [2022-04-15 12:29:44,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:44,195 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-15 12:29:44,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:44,196 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-15 12:29:44,206 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-15 12:29:44,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:29:44,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:44,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:29:44,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:29:44,207 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-15 12:29:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:45,503 INFO L93 Difference]: Finished difference Result 298 states and 363 transitions. [2022-04-15 12:29:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:29:45,503 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-15 12:29:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:45,503 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-15 12:29:45,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 346 transitions. [2022-04-15 12:29:45,505 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-15 12:29:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 346 transitions. [2022-04-15 12:29:45,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 346 transitions. [2022-04-15 12:29:45,759 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-15 12:29:45,763 INFO L225 Difference]: With dead ends: 298 [2022-04-15 12:29:45,763 INFO L226 Difference]: Without dead ends: 296 [2022-04-15 12:29:45,763 INFO L912 BasicCegarLoop]: 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-15 12:29:45,764 INFO L913 BasicCegarLoop]: 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-15 12:29:45,764 INFO L914 BasicCegarLoop]: 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-15 12:29:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-04-15 12:29:46,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-04-15 12:29:46,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:46,161 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-15 12:29:46,162 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-15 12:29:46,162 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-15 12:29:46,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:46,165 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2022-04-15 12:29:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 361 transitions. [2022-04-15 12:29:46,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:46,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:46,166 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-15 12:29:46,167 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-15 12:29:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:46,170 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2022-04-15 12:29:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 361 transitions. [2022-04-15 12:29:46,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:46,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:46,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:46,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:46,171 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-15 12:29:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 361 transitions. [2022-04-15 12:29:46,175 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 361 transitions. Word has length 20 [2022-04-15 12:29:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:46,176 INFO L478 AbstractCegarLoop]: Abstraction has 296 states and 361 transitions. [2022-04-15 12:29:46,176 INFO L479 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-15 12:29:46,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 361 transitions. [2022-04-15 12:29:46,479 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-15 12:29:46,480 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 361 transitions. [2022-04-15 12:29:46,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:29:46,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:46,480 INFO L499 BasicCegarLoop]: 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-15 12:29:46,480 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 12:29:46,481 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:46,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:46,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1577872003, now seen corresponding path program 1 times [2022-04-15 12:29:46,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:46,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1148964517] [2022-04-15 12:29:46,481 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:46,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1577872003, now seen corresponding path program 2 times [2022-04-15 12:29:46,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:46,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718085571] [2022-04-15 12:29:46,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:46,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:46,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:46,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {25857#(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; {25850#true} is VALID [2022-04-15 12:29:46,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {25850#true} assume true; {25850#true} is VALID [2022-04-15 12:29:46,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25850#true} {25850#true} #1237#return; {25850#true} is VALID [2022-04-15 12:29:46,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {25850#true} call ULTIMATE.init(); {25857#(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-15 12:29:46,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {25857#(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; {25850#true} is VALID [2022-04-15 12:29:46,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {25850#true} assume true; {25850#true} is VALID [2022-04-15 12:29:46,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25850#true} {25850#true} #1237#return; {25850#true} is VALID [2022-04-15 12:29:46,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {25850#true} call #t~ret69 := main(); {25850#true} is VALID [2022-04-15 12:29:46,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {25850#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; {25850#true} is VALID [2022-04-15 12:29:46,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {25850#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {25850#true} is VALID [2022-04-15 12:29:46,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {25850#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; {25850#true} is VALID [2022-04-15 12:29:46,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {25850#true} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {25850#true} is VALID [2022-04-15 12:29:46,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {25850#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; {25850#true} is VALID [2022-04-15 12:29:46,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {25850#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; {25850#true} is VALID [2022-04-15 12:29:46,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {25850#true} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {25850#true} is VALID [2022-04-15 12:29:46,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {25850#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; {25850#true} is VALID [2022-04-15 12:29:46,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {25850#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; {25850#true} is VALID [2022-04-15 12:29:46,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {25850#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; {25850#true} is VALID [2022-04-15 12:29:46,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {25850#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; {25850#true} is VALID [2022-04-15 12:29:46,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {25850#true} assume !(0 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {25850#true} is VALID [2022-04-15 12:29:46,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {25850#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; {25855#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:46,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {25855#(<= 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; {25856#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-15 12:29:46,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {25856#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {25851#false} is VALID [2022-04-15 12:29:46,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {25851#false} assume !false; {25851#false} is VALID [2022-04-15 12:29:46,533 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-15 12:29:46,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:46,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718085571] [2022-04-15 12:29:46,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718085571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:46,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:46,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:29:46,534 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:46,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1148964517] [2022-04-15 12:29:46,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1148964517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:46,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:46,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:29:46,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694337541] [2022-04-15 12:29:46,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:46,535 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-15 12:29:46,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:46,535 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-15 12:29:46,546 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-15 12:29:46,546 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:29:46,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:46,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:29:46,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:29:46,547 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-15 12:29:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:47,987 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2022-04-15 12:29:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:29:47,987 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-15 12:29:47,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:47,987 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-15 12:29:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 347 transitions. [2022-04-15 12:29:47,989 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-15 12:29:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 347 transitions. [2022-04-15 12:29:47,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 347 transitions. [2022-04-15 12:29:48,228 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-15 12:29:48,232 INFO L225 Difference]: With dead ends: 296 [2022-04-15 12:29:48,232 INFO L226 Difference]: Without dead ends: 292 [2022-04-15 12:29:48,233 INFO L912 BasicCegarLoop]: 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-15 12:29:48,233 INFO L913 BasicCegarLoop]: 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:29:48,233 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 397 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:29:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-15 12:29:48,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-04-15 12:29:48,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:48,605 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-15 12:29:48,605 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-15 12:29:48,606 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-15 12:29:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:48,609 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2022-04-15 12:29:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2022-04-15 12:29:48,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:48,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:48,610 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-15 12:29:48,610 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-15 12:29:48,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:48,614 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2022-04-15 12:29:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2022-04-15 12:29:48,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:48,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:48,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:48,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:48,615 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-15 12:29:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 357 transitions. [2022-04-15 12:29:48,619 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 357 transitions. Word has length 21 [2022-04-15 12:29:48,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:48,619 INFO L478 AbstractCegarLoop]: Abstraction has 292 states and 357 transitions. [2022-04-15 12:29:48,619 INFO L479 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-15 12:29:48,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 292 states and 357 transitions. [2022-04-15 12:29:48,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2022-04-15 12:29:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:29:48,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:48,930 INFO L499 BasicCegarLoop]: 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-15 12:29:48,930 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 12:29:48,930 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:48,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:48,930 INFO L85 PathProgramCache]: Analyzing trace with hash -383054022, now seen corresponding path program 1 times [2022-04-15 12:29:48,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:48,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2014003540] [2022-04-15 12:29:48,931 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:48,931 INFO L85 PathProgramCache]: Analyzing trace with hash -383054022, now seen corresponding path program 2 times [2022-04-15 12:29:48,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:48,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919786208] [2022-04-15 12:29:48,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:48,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:48,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {27634#(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; {27625#true} is VALID [2022-04-15 12:29:48,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {27625#true} assume true; {27625#true} is VALID [2022-04-15 12:29:48,996 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27625#true} {27625#true} #1237#return; {27625#true} is VALID [2022-04-15 12:29:48,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {27625#true} call ULTIMATE.init(); {27634#(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-15 12:29:48,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {27634#(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; {27625#true} is VALID [2022-04-15 12:29:48,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {27625#true} assume true; {27625#true} is VALID [2022-04-15 12:29:48,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27625#true} {27625#true} #1237#return; {27625#true} is VALID [2022-04-15 12:29:48,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {27625#true} call #t~ret69 := main(); {27625#true} is VALID [2022-04-15 12:29:48,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {27625#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; {27625#true} is VALID [2022-04-15 12:29:48,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {27625#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {27625#true} is VALID [2022-04-15 12:29:48,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {27625#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; {27625#true} is VALID [2022-04-15 12:29:48,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {27625#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; {27625#true} is VALID [2022-04-15 12:29:48,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {27625#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; {27625#true} is VALID [2022-04-15 12:29:48,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {27625#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {27625#true} is VALID [2022-04-15 12:29:48,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {27625#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; {27630#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-15 12:29:48,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {27630#(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; {27630#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-15 12:29:48,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {27630#(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; {27631#(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-15 12:29:49,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {27631#(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; {27632#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:49,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {27632#(<= 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; {27632#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:49,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {27632#(<= 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; {27632#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:49,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {27632#(<= 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; {27632#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:49,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {27632#(<= 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; {27633#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-15 12:29:49,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {27633#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {27626#false} is VALID [2022-04-15 12:29:49,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {27626#false} assume !false; {27626#false} is VALID [2022-04-15 12:29:49,003 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-15 12:29:49,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:49,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919786208] [2022-04-15 12:29:49,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919786208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:49,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:49,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:49,003 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:49,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2014003540] [2022-04-15 12:29:49,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2014003540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:49,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:49,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:49,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616816737] [2022-04-15 12:29:49,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:49,004 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-15 12:29:49,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:49,004 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-15 12:29:49,016 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-15 12:29:49,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:29:49,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:49,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:29:49,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:29:49,017 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-15 12:29:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:51,050 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2022-04-15 12:29:51,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:29:51,050 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-15 12:29:51,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:51,050 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-15 12:29:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 340 transitions. [2022-04-15 12:29:51,052 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-15 12:29:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 340 transitions. [2022-04-15 12:29:51,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 340 transitions. [2022-04-15 12:29:51,324 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-15 12:29:51,328 INFO L225 Difference]: With dead ends: 292 [2022-04-15 12:29:51,328 INFO L226 Difference]: Without dead ends: 290 [2022-04-15 12:29:51,329 INFO L912 BasicCegarLoop]: 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-15 12:29:51,330 INFO L913 BasicCegarLoop]: 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-15 12:29:51,330 INFO L914 BasicCegarLoop]: 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-15 12:29:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-04-15 12:29:51,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2022-04-15 12:29:51,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:51,802 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-15 12:29:51,802 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-15 12:29:51,802 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-15 12:29:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:51,807 INFO L93 Difference]: Finished difference Result 290 states and 355 transitions. [2022-04-15 12:29:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 355 transitions. [2022-04-15 12:29:51,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:51,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:51,808 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-15 12:29:51,809 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-15 12:29:51,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:51,814 INFO L93 Difference]: Finished difference Result 290 states and 355 transitions. [2022-04-15 12:29:51,814 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 355 transitions. [2022-04-15 12:29:51,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:51,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:51,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:51,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:51,816 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-15 12:29:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2022-04-15 12:29:51,820 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 21 [2022-04-15 12:29:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:51,820 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2022-04-15 12:29:51,820 INFO L479 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-15 12:29:51,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 352 transitions. [2022-04-15 12:29:52,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2022-04-15 12:29:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:29:52,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:52,169 INFO L499 BasicCegarLoop]: 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-15 12:29:52,169 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 12:29:52,170 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:52,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:52,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1682632114, now seen corresponding path program 1 times [2022-04-15 12:29:52,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:52,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [33291953] [2022-04-15 12:29:52,170 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:52,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1682632114, now seen corresponding path program 2 times [2022-04-15 12:29:52,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:52,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668907893] [2022-04-15 12:29:52,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:52,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:52,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:52,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {29396#(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; {29387#true} is VALID [2022-04-15 12:29:52,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {29387#true} assume true; {29387#true} is VALID [2022-04-15 12:29:52,238 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29387#true} {29387#true} #1237#return; {29387#true} is VALID [2022-04-15 12:29:52,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {29387#true} call ULTIMATE.init(); {29396#(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-15 12:29:52,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {29396#(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; {29387#true} is VALID [2022-04-15 12:29:52,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {29387#true} assume true; {29387#true} is VALID [2022-04-15 12:29:52,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29387#true} {29387#true} #1237#return; {29387#true} is VALID [2022-04-15 12:29:52,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {29387#true} call #t~ret69 := main(); {29387#true} is VALID [2022-04-15 12:29:52,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {29387#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; {29387#true} is VALID [2022-04-15 12:29:52,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {29387#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {29387#true} is VALID [2022-04-15 12:29:52,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {29387#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; {29387#true} is VALID [2022-04-15 12:29:52,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {29387#true} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_2609_0~0 := ~main____CPAchecker_TMP_0~0; {29387#true} is VALID [2022-04-15 12:29:52,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {29387#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; {29387#true} is VALID [2022-04-15 12:29:52,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {29387#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; {29387#true} is VALID [2022-04-15 12:29:52,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {29387#true} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {29387#true} is VALID [2022-04-15 12:29:52,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {29387#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; {29392#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-15 12:29:52,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {29392#(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; {29392#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-15 12:29:52,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {29392#(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; {29392#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-15 12:29:52,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {29392#(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; {29393#(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-15 12:29:52,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {29393#(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; {29394#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:52,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {29394#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {29394#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:52,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {29394#(<= 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; {29394#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:52,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {29394#(<= 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; {29395#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-15 12:29:52,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {29395#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {29388#false} is VALID [2022-04-15 12:29:52,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {29388#false} assume !false; {29388#false} is VALID [2022-04-15 12:29:52,244 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-15 12:29:52,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:52,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668907893] [2022-04-15 12:29:52,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668907893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:52,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:52,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:52,244 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:52,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [33291953] [2022-04-15 12:29:52,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [33291953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:52,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:52,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:52,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34523676] [2022-04-15 12:29:52,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:52,245 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-15 12:29:52,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:52,245 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-15 12:29:52,258 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-15 12:29:52,258 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:29:52,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:52,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:29:52,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:29:52,259 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-15 12:29:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:54,284 INFO L93 Difference]: Finished difference Result 302 states and 369 transitions. [2022-04-15 12:29:54,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:29:54,284 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-15 12:29:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:54,285 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-15 12:29:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 355 transitions. [2022-04-15 12:29:54,286 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-15 12:29:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 355 transitions. [2022-04-15 12:29:54,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 355 transitions. [2022-04-15 12:29:54,567 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-15 12:29:54,570 INFO L225 Difference]: With dead ends: 302 [2022-04-15 12:29:54,570 INFO L226 Difference]: Without dead ends: 300 [2022-04-15 12:29:54,571 INFO L912 BasicCegarLoop]: 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-15 12:29:54,571 INFO L913 BasicCegarLoop]: 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-15 12:29:54,571 INFO L914 BasicCegarLoop]: 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-15 12:29:54,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-04-15 12:29:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 282. [2022-04-15 12:29:55,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:55,019 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-15 12:29:55,019 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-15 12:29:55,020 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-15 12:29:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:55,024 INFO L93 Difference]: Finished difference Result 300 states and 367 transitions. [2022-04-15 12:29:55,024 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 367 transitions. [2022-04-15 12:29:55,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:55,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:55,025 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-15 12:29:55,025 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-15 12:29:55,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:55,031 INFO L93 Difference]: Finished difference Result 300 states and 367 transitions. [2022-04-15 12:29:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 367 transitions. [2022-04-15 12:29:55,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:55,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:55,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:55,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:55,032 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-15 12:29:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 347 transitions. [2022-04-15 12:29:55,038 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 347 transitions. Word has length 22 [2022-04-15 12:29:55,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:55,038 INFO L478 AbstractCegarLoop]: Abstraction has 282 states and 347 transitions. [2022-04-15 12:29:55,038 INFO L479 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-15 12:29:55,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 282 states and 347 transitions. [2022-04-15 12:29:55,358 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-15 12:29:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 347 transitions. [2022-04-15 12:29:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:29:55,359 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:55,359 INFO L499 BasicCegarLoop]: 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-15 12:29:55,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 12:29:55,359 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:55,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1297761964, now seen corresponding path program 1 times [2022-04-15 12:29:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:55,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1995462253] [2022-04-15 12:29:55,360 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:55,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1297761964, now seen corresponding path program 2 times [2022-04-15 12:29:55,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:55,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556433592] [2022-04-15 12:29:55,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:55,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:55,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:55,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {31189#(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; {31180#true} is VALID [2022-04-15 12:29:55,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {31180#true} assume true; {31180#true} is VALID [2022-04-15 12:29:55,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31180#true} {31180#true} #1237#return; {31180#true} is VALID [2022-04-15 12:29:55,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {31180#true} call ULTIMATE.init(); {31189#(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-15 12:29:55,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {31189#(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; {31180#true} is VALID [2022-04-15 12:29:55,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {31180#true} assume true; {31180#true} is VALID [2022-04-15 12:29:55,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31180#true} {31180#true} #1237#return; {31180#true} is VALID [2022-04-15 12:29:55,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {31180#true} call #t~ret69 := main(); {31180#true} is VALID [2022-04-15 12:29:55,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {31180#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; {31180#true} is VALID [2022-04-15 12:29:55,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {31180#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {31180#true} is VALID [2022-04-15 12:29:55,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {31180#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; {31180#true} is VALID [2022-04-15 12:29:55,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {31180#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; {31180#true} is VALID [2022-04-15 12:29:55,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {31180#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; {31180#true} is VALID [2022-04-15 12:29:55,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {31180#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {31180#true} is VALID [2022-04-15 12:29:55,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {31180#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; {31185#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-15 12:29:55,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {31185#(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; {31185#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-15 12:29:55,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {31185#(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; {31185#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-15 12:29:55,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {31185#(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; {31186#(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-15 12:29:55,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {31186#(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; {31187#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:55,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {31187#(<= 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; {31187#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:55,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {31187#(<= 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; {31187#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:55,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {31187#(<= 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; {31187#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:55,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {31187#(<= 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; {31188#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-15 12:29:55,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {31188#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {31181#false} is VALID [2022-04-15 12:29:55,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {31181#false} assume !false; {31181#false} is VALID [2022-04-15 12:29:55,429 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-15 12:29:55,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:55,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556433592] [2022-04-15 12:29:55,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556433592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:55,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:55,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:55,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:55,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1995462253] [2022-04-15 12:29:55,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1995462253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:55,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:55,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:55,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088113550] [2022-04-15 12:29:55,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:55,430 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-15 12:29:55,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:55,430 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-15 12:29:55,441 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-15 12:29:55,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:29:55,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:55,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:29:55,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:29:55,442 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-15 12:29:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:57,453 INFO L93 Difference]: Finished difference Result 294 states and 361 transitions. [2022-04-15 12:29:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:29:57,453 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-15 12:29:57,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:57,454 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-15 12:29:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 350 transitions. [2022-04-15 12:29:57,455 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-15 12:29:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 350 transitions. [2022-04-15 12:29:57,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 350 transitions. [2022-04-15 12:29:57,717 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-15 12:29:57,720 INFO L225 Difference]: With dead ends: 294 [2022-04-15 12:29:57,721 INFO L226 Difference]: Without dead ends: 292 [2022-04-15 12:29:57,721 INFO L912 BasicCegarLoop]: 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-15 12:29:57,721 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 853 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:29:57,721 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [853 Valid, 115 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:29:57,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-15 12:29:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 277. [2022-04-15 12:29:58,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:58,169 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-15 12:29:58,169 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-15 12:29:58,169 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-15 12:29:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:58,172 INFO L93 Difference]: Finished difference Result 292 states and 359 transitions. [2022-04-15 12:29:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 359 transitions. [2022-04-15 12:29:58,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:58,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:58,173 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-15 12:29:58,173 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-15 12:29:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:58,176 INFO L93 Difference]: Finished difference Result 292 states and 359 transitions. [2022-04-15 12:29:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 359 transitions. [2022-04-15 12:29:58,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:58,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:58,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:58,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:58,177 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-15 12:29:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 341 transitions. [2022-04-15 12:29:58,181 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 341 transitions. Word has length 22 [2022-04-15 12:29:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:58,181 INFO L478 AbstractCegarLoop]: Abstraction has 277 states and 341 transitions. [2022-04-15 12:29:58,181 INFO L479 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-15 12:29:58,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 277 states and 341 transitions. [2022-04-15 12:29:58,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 341 edges. 341 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:58,504 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 341 transitions. [2022-04-15 12:29:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:29:58,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:58,504 INFO L499 BasicCegarLoop]: 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-15 12:29:58,504 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 12:29:58,504 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:29:58,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:58,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1345477214, now seen corresponding path program 1 times [2022-04-15 12:29:58,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:58,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1515491122] [2022-04-15 12:29:58,505 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:29:58,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1345477214, now seen corresponding path program 2 times [2022-04-15 12:29:58,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:58,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922276689] [2022-04-15 12:29:58,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:58,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:58,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:58,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {32939#(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; {32930#true} is VALID [2022-04-15 12:29:58,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {32930#true} assume true; {32930#true} is VALID [2022-04-15 12:29:58,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32930#true} {32930#true} #1237#return; {32930#true} is VALID [2022-04-15 12:29:58,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {32930#true} call ULTIMATE.init(); {32939#(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-15 12:29:58,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {32939#(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; {32930#true} is VALID [2022-04-15 12:29:58,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {32930#true} assume true; {32930#true} is VALID [2022-04-15 12:29:58,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32930#true} {32930#true} #1237#return; {32930#true} is VALID [2022-04-15 12:29:58,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {32930#true} call #t~ret69 := main(); {32930#true} is VALID [2022-04-15 12:29:58,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {32930#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; {32930#true} is VALID [2022-04-15 12:29:58,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {32930#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {32930#true} is VALID [2022-04-15 12:29:58,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {32930#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; {32930#true} is VALID [2022-04-15 12:29:58,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {32930#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; {32930#true} is VALID [2022-04-15 12:29:58,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {32930#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; {32930#true} is VALID [2022-04-15 12:29:58,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {32930#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {32930#true} is VALID [2022-04-15 12:29:58,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {32930#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; {32935#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-15 12:29:58,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {32935#(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; {32935#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-15 12:29:58,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {32935#(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; {32935#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-15 12:29:58,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {32935#(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; {32936#(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-15 12:29:58,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {32936#(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; {32937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:58,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {32937#(<= 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; {32937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:58,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {32937#(<= 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; {32937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:58,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {32937#(<= 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; {32937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:29:58,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {32937#(<= 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; {32938#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-15 12:29:58,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {32938#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {32931#false} is VALID [2022-04-15 12:29:58,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {32931#false} assume !false; {32931#false} is VALID [2022-04-15 12:29:58,601 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-15 12:29:58,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:58,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922276689] [2022-04-15 12:29:58,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922276689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:58,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:58,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:58,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:58,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1515491122] [2022-04-15 12:29:58,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1515491122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:58,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:58,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:29:58,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428924482] [2022-04-15 12:29:58,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:58,602 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-15 12:29:58,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:58,603 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-15 12:29:58,617 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-15 12:29:58,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:29:58,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:58,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:29:58,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:29:58,618 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-15 12:30:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:00,502 INFO L93 Difference]: Finished difference Result 277 states and 341 transitions. [2022-04-15 12:30:00,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:30:00,502 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-15 12:30:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:00,502 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-15 12:30:00,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 334 transitions. [2022-04-15 12:30:00,504 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-15 12:30:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 334 transitions. [2022-04-15 12:30:00,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 334 transitions. [2022-04-15 12:30:00,756 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-15 12:30:00,759 INFO L225 Difference]: With dead ends: 277 [2022-04-15 12:30:00,759 INFO L226 Difference]: Without dead ends: 254 [2022-04-15 12:30:00,759 INFO L912 BasicCegarLoop]: 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-15 12:30:00,760 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 638 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:00,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 110 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:30:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-15 12:30:01,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2022-04-15 12:30:01,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:01,154 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-15 12:30:01,155 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-15 12:30:01,155 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-15 12:30:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:01,157 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2022-04-15 12:30:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2022-04-15 12:30:01,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:01,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:01,158 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-15 12:30:01,158 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-15 12:30:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:01,163 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2022-04-15 12:30:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2022-04-15 12:30:01,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:01,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:01,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:01,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:01,164 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-15 12:30:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2022-04-15 12:30:01,166 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 22 [2022-04-15 12:30:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:01,167 INFO L478 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2022-04-15 12:30:01,167 INFO L479 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-15 12:30:01,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 254 states and 254 transitions. [2022-04-15 12:30:01,388 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-15 12:30:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2022-04-15 12:30:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-04-15 12:30:01,390 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:01,390 INFO L499 BasicCegarLoop]: 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-15 12:30:01,390 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 12:30:01,391 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:30:01,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:01,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1242952801, now seen corresponding path program 1 times [2022-04-15 12:30:01,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:01,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1488718072] [2022-04-15 12:30:01,391 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:30:01,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1242952801, now seen corresponding path program 2 times [2022-04-15 12:30:01,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:01,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227499661] [2022-04-15 12:30:01,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:01,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:02,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:02,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {34588#(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; {34522#true} is VALID [2022-04-15 12:30:02,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {34522#true} assume true; {34522#true} is VALID [2022-04-15 12:30:02,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34522#true} {34522#true} #1237#return; {34522#true} is VALID [2022-04-15 12:30:02,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {34522#true} call ULTIMATE.init(); {34588#(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-15 12:30:02,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {34588#(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; {34522#true} is VALID [2022-04-15 12:30:02,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {34522#true} assume true; {34522#true} is VALID [2022-04-15 12:30:02,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34522#true} {34522#true} #1237#return; {34522#true} is VALID [2022-04-15 12:30:02,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {34522#true} call #t~ret69 := main(); {34522#true} is VALID [2022-04-15 12:30:02,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {34522#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; {34522#true} is VALID [2022-04-15 12:30:02,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {34522#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {34527#(= main_~main__t~0 0)} is VALID [2022-04-15 12:30:02,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {34527#(= 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; {34527#(= main_~main__t~0 0)} is VALID [2022-04-15 12:30:02,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {34527#(= 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; {34527#(= main_~main__t~0 0)} is VALID [2022-04-15 12:30:02,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {34527#(= 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; {34527#(= main_~main__t~0 0)} is VALID [2022-04-15 12:30:02,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {34527#(= 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; {34528#(<= 1 main_~main__t~0)} is VALID [2022-04-15 12:30:02,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {34528#(<= 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; {34528#(<= 1 main_~main__t~0)} is VALID [2022-04-15 12:30:02,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {34528#(<= 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; {34528#(<= 1 main_~main__t~0)} is VALID [2022-04-15 12:30:02,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {34528#(<= 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; {34528#(<= 1 main_~main__t~0)} is VALID [2022-04-15 12:30:02,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {34528#(<= 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; {34529#(<= 2 main_~main__t~0)} is VALID [2022-04-15 12:30:02,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {34529#(<= 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; {34529#(<= 2 main_~main__t~0)} is VALID [2022-04-15 12:30:02,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {34529#(<= 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; {34529#(<= 2 main_~main__t~0)} is VALID [2022-04-15 12:30:02,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {34529#(<= 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; {34529#(<= 2 main_~main__t~0)} is VALID [2022-04-15 12:30:02,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {34529#(<= 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; {34530#(<= 3 main_~main__t~0)} is VALID [2022-04-15 12:30:02,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {34530#(<= 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; {34530#(<= 3 main_~main__t~0)} is VALID [2022-04-15 12:30:02,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {34530#(<= 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; {34530#(<= 3 main_~main__t~0)} is VALID [2022-04-15 12:30:02,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {34530#(<= 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; {34530#(<= 3 main_~main__t~0)} is VALID [2022-04-15 12:30:02,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {34530#(<= 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; {34531#(<= 4 main_~main__t~0)} is VALID [2022-04-15 12:30:02,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {34531#(<= 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; {34531#(<= 4 main_~main__t~0)} is VALID [2022-04-15 12:30:02,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {34531#(<= 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; {34531#(<= 4 main_~main__t~0)} is VALID [2022-04-15 12:30:02,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {34531#(<= 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; {34531#(<= 4 main_~main__t~0)} is VALID [2022-04-15 12:30:02,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {34531#(<= 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; {34532#(<= 5 main_~main__t~0)} is VALID [2022-04-15 12:30:02,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {34532#(<= 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; {34532#(<= 5 main_~main__t~0)} is VALID [2022-04-15 12:30:02,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {34532#(<= 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; {34532#(<= 5 main_~main__t~0)} is VALID [2022-04-15 12:30:02,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {34532#(<= 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; {34532#(<= 5 main_~main__t~0)} is VALID [2022-04-15 12:30:02,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {34532#(<= 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; {34533#(<= 6 main_~main__t~0)} is VALID [2022-04-15 12:30:02,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {34533#(<= 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; {34533#(<= 6 main_~main__t~0)} is VALID [2022-04-15 12:30:02,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {34533#(<= 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; {34533#(<= 6 main_~main__t~0)} is VALID [2022-04-15 12:30:02,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {34533#(<= 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; {34533#(<= 6 main_~main__t~0)} is VALID [2022-04-15 12:30:02,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {34533#(<= 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; {34534#(<= 7 main_~main__t~0)} is VALID [2022-04-15 12:30:02,938 INFO L290 TraceCheckUtils]: 35: Hoare triple {34534#(<= 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; {34534#(<= 7 main_~main__t~0)} is VALID [2022-04-15 12:30:02,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {34534#(<= 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; {34534#(<= 7 main_~main__t~0)} is VALID [2022-04-15 12:30:02,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {34534#(<= 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; {34534#(<= 7 main_~main__t~0)} is VALID [2022-04-15 12:30:02,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {34534#(<= 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; {34535#(<= 8 main_~main__t~0)} is VALID [2022-04-15 12:30:02,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {34535#(<= 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; {34535#(<= 8 main_~main__t~0)} is VALID [2022-04-15 12:30:02,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {34535#(<= 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; {34535#(<= 8 main_~main__t~0)} is VALID [2022-04-15 12:30:02,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {34535#(<= 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; {34535#(<= 8 main_~main__t~0)} is VALID [2022-04-15 12:30:02,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {34535#(<= 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; {34536#(<= 9 main_~main__t~0)} is VALID [2022-04-15 12:30:02,940 INFO L290 TraceCheckUtils]: 43: Hoare triple {34536#(<= 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; {34536#(<= 9 main_~main__t~0)} is VALID [2022-04-15 12:30:02,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {34536#(<= 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; {34536#(<= 9 main_~main__t~0)} is VALID [2022-04-15 12:30:02,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {34536#(<= 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; {34536#(<= 9 main_~main__t~0)} is VALID [2022-04-15 12:30:02,941 INFO L290 TraceCheckUtils]: 46: Hoare triple {34536#(<= 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; {34537#(<= 10 main_~main__t~0)} is VALID [2022-04-15 12:30:02,942 INFO L290 TraceCheckUtils]: 47: Hoare triple {34537#(<= 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; {34537#(<= 10 main_~main__t~0)} is VALID [2022-04-15 12:30:02,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {34537#(<= 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; {34537#(<= 10 main_~main__t~0)} is VALID [2022-04-15 12:30:02,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {34537#(<= 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; {34537#(<= 10 main_~main__t~0)} is VALID [2022-04-15 12:30:02,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {34537#(<= 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; {34538#(<= 11 main_~main__t~0)} is VALID [2022-04-15 12:30:02,943 INFO L290 TraceCheckUtils]: 51: Hoare triple {34538#(<= 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; {34538#(<= 11 main_~main__t~0)} is VALID [2022-04-15 12:30:02,943 INFO L290 TraceCheckUtils]: 52: Hoare triple {34538#(<= 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; {34538#(<= 11 main_~main__t~0)} is VALID [2022-04-15 12:30:02,943 INFO L290 TraceCheckUtils]: 53: Hoare triple {34538#(<= 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; {34538#(<= 11 main_~main__t~0)} is VALID [2022-04-15 12:30:02,944 INFO L290 TraceCheckUtils]: 54: Hoare triple {34538#(<= 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; {34539#(<= 12 main_~main__t~0)} is VALID [2022-04-15 12:30:02,944 INFO L290 TraceCheckUtils]: 55: Hoare triple {34539#(<= 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; {34539#(<= 12 main_~main__t~0)} is VALID [2022-04-15 12:30:02,944 INFO L290 TraceCheckUtils]: 56: Hoare triple {34539#(<= 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; {34539#(<= 12 main_~main__t~0)} is VALID [2022-04-15 12:30:02,945 INFO L290 TraceCheckUtils]: 57: Hoare triple {34539#(<= 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; {34539#(<= 12 main_~main__t~0)} is VALID [2022-04-15 12:30:02,945 INFO L290 TraceCheckUtils]: 58: Hoare triple {34539#(<= 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; {34540#(<= 13 main_~main__t~0)} is VALID [2022-04-15 12:30:02,951 INFO L290 TraceCheckUtils]: 59: Hoare triple {34540#(<= 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; {34540#(<= 13 main_~main__t~0)} is VALID [2022-04-15 12:30:02,951 INFO L290 TraceCheckUtils]: 60: Hoare triple {34540#(<= 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; {34540#(<= 13 main_~main__t~0)} is VALID [2022-04-15 12:30:02,952 INFO L290 TraceCheckUtils]: 61: Hoare triple {34540#(<= 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; {34540#(<= 13 main_~main__t~0)} is VALID [2022-04-15 12:30:02,952 INFO L290 TraceCheckUtils]: 62: Hoare triple {34540#(<= 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; {34541#(<= 14 main_~main__t~0)} is VALID [2022-04-15 12:30:02,952 INFO L290 TraceCheckUtils]: 63: Hoare triple {34541#(<= 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; {34541#(<= 14 main_~main__t~0)} is VALID [2022-04-15 12:30:02,953 INFO L290 TraceCheckUtils]: 64: Hoare triple {34541#(<= 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; {34541#(<= 14 main_~main__t~0)} is VALID [2022-04-15 12:30:02,953 INFO L290 TraceCheckUtils]: 65: Hoare triple {34541#(<= 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; {34541#(<= 14 main_~main__t~0)} is VALID [2022-04-15 12:30:02,953 INFO L290 TraceCheckUtils]: 66: Hoare triple {34541#(<= 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; {34542#(<= 15 main_~main__t~0)} is VALID [2022-04-15 12:30:02,954 INFO L290 TraceCheckUtils]: 67: Hoare triple {34542#(<= 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; {34542#(<= 15 main_~main__t~0)} is VALID [2022-04-15 12:30:02,954 INFO L290 TraceCheckUtils]: 68: Hoare triple {34542#(<= 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; {34542#(<= 15 main_~main__t~0)} is VALID [2022-04-15 12:30:02,954 INFO L290 TraceCheckUtils]: 69: Hoare triple {34542#(<= 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; {34542#(<= 15 main_~main__t~0)} is VALID [2022-04-15 12:30:02,954 INFO L290 TraceCheckUtils]: 70: Hoare triple {34542#(<= 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; {34543#(<= 16 main_~main__t~0)} is VALID [2022-04-15 12:30:02,955 INFO L290 TraceCheckUtils]: 71: Hoare triple {34543#(<= 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; {34543#(<= 16 main_~main__t~0)} is VALID [2022-04-15 12:30:02,955 INFO L290 TraceCheckUtils]: 72: Hoare triple {34543#(<= 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; {34543#(<= 16 main_~main__t~0)} is VALID [2022-04-15 12:30:02,956 INFO L290 TraceCheckUtils]: 73: Hoare triple {34543#(<= 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; {34543#(<= 16 main_~main__t~0)} is VALID [2022-04-15 12:30:02,956 INFO L290 TraceCheckUtils]: 74: Hoare triple {34543#(<= 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; {34544#(<= 17 main_~main__t~0)} is VALID [2022-04-15 12:30:02,956 INFO L290 TraceCheckUtils]: 75: Hoare triple {34544#(<= 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; {34544#(<= 17 main_~main__t~0)} is VALID [2022-04-15 12:30:02,957 INFO L290 TraceCheckUtils]: 76: Hoare triple {34544#(<= 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; {34544#(<= 17 main_~main__t~0)} is VALID [2022-04-15 12:30:02,957 INFO L290 TraceCheckUtils]: 77: Hoare triple {34544#(<= 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; {34544#(<= 17 main_~main__t~0)} is VALID [2022-04-15 12:30:02,957 INFO L290 TraceCheckUtils]: 78: Hoare triple {34544#(<= 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; {34545#(<= 18 main_~main__t~0)} is VALID [2022-04-15 12:30:02,959 INFO L290 TraceCheckUtils]: 79: Hoare triple {34545#(<= 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; {34545#(<= 18 main_~main__t~0)} is VALID [2022-04-15 12:30:02,959 INFO L290 TraceCheckUtils]: 80: Hoare triple {34545#(<= 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; {34545#(<= 18 main_~main__t~0)} is VALID [2022-04-15 12:30:02,959 INFO L290 TraceCheckUtils]: 81: Hoare triple {34545#(<= 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; {34545#(<= 18 main_~main__t~0)} is VALID [2022-04-15 12:30:02,960 INFO L290 TraceCheckUtils]: 82: Hoare triple {34545#(<= 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; {34546#(<= 19 main_~main__t~0)} is VALID [2022-04-15 12:30:02,960 INFO L290 TraceCheckUtils]: 83: Hoare triple {34546#(<= 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; {34546#(<= 19 main_~main__t~0)} is VALID [2022-04-15 12:30:02,960 INFO L290 TraceCheckUtils]: 84: Hoare triple {34546#(<= 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; {34546#(<= 19 main_~main__t~0)} is VALID [2022-04-15 12:30:02,960 INFO L290 TraceCheckUtils]: 85: Hoare triple {34546#(<= 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; {34546#(<= 19 main_~main__t~0)} is VALID [2022-04-15 12:30:02,961 INFO L290 TraceCheckUtils]: 86: Hoare triple {34546#(<= 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; {34547#(<= 20 main_~main__t~0)} is VALID [2022-04-15 12:30:02,961 INFO L290 TraceCheckUtils]: 87: Hoare triple {34547#(<= 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; {34547#(<= 20 main_~main__t~0)} is VALID [2022-04-15 12:30:02,961 INFO L290 TraceCheckUtils]: 88: Hoare triple {34547#(<= 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; {34547#(<= 20 main_~main__t~0)} is VALID [2022-04-15 12:30:02,962 INFO L290 TraceCheckUtils]: 89: Hoare triple {34547#(<= 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; {34547#(<= 20 main_~main__t~0)} is VALID [2022-04-15 12:30:02,962 INFO L290 TraceCheckUtils]: 90: Hoare triple {34547#(<= 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; {34548#(<= 21 main_~main__t~0)} is VALID [2022-04-15 12:30:02,962 INFO L290 TraceCheckUtils]: 91: Hoare triple {34548#(<= 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; {34548#(<= 21 main_~main__t~0)} is VALID [2022-04-15 12:30:02,963 INFO L290 TraceCheckUtils]: 92: Hoare triple {34548#(<= 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; {34548#(<= 21 main_~main__t~0)} is VALID [2022-04-15 12:30:02,963 INFO L290 TraceCheckUtils]: 93: Hoare triple {34548#(<= 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; {34548#(<= 21 main_~main__t~0)} is VALID [2022-04-15 12:30:02,963 INFO L290 TraceCheckUtils]: 94: Hoare triple {34548#(<= 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; {34549#(<= 22 main_~main__t~0)} is VALID [2022-04-15 12:30:02,964 INFO L290 TraceCheckUtils]: 95: Hoare triple {34549#(<= 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; {34549#(<= 22 main_~main__t~0)} is VALID [2022-04-15 12:30:02,964 INFO L290 TraceCheckUtils]: 96: Hoare triple {34549#(<= 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; {34549#(<= 22 main_~main__t~0)} is VALID [2022-04-15 12:30:02,964 INFO L290 TraceCheckUtils]: 97: Hoare triple {34549#(<= 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; {34549#(<= 22 main_~main__t~0)} is VALID [2022-04-15 12:30:02,965 INFO L290 TraceCheckUtils]: 98: Hoare triple {34549#(<= 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; {34550#(<= 23 main_~main__t~0)} is VALID [2022-04-15 12:30:02,965 INFO L290 TraceCheckUtils]: 99: Hoare triple {34550#(<= 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; {34550#(<= 23 main_~main__t~0)} is VALID [2022-04-15 12:30:02,965 INFO L290 TraceCheckUtils]: 100: Hoare triple {34550#(<= 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; {34550#(<= 23 main_~main__t~0)} is VALID [2022-04-15 12:30:02,966 INFO L290 TraceCheckUtils]: 101: Hoare triple {34550#(<= 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; {34550#(<= 23 main_~main__t~0)} is VALID [2022-04-15 12:30:02,966 INFO L290 TraceCheckUtils]: 102: Hoare triple {34550#(<= 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; {34551#(<= 24 main_~main__t~0)} is VALID [2022-04-15 12:30:02,966 INFO L290 TraceCheckUtils]: 103: Hoare triple {34551#(<= 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; {34551#(<= 24 main_~main__t~0)} is VALID [2022-04-15 12:30:02,967 INFO L290 TraceCheckUtils]: 104: Hoare triple {34551#(<= 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; {34551#(<= 24 main_~main__t~0)} is VALID [2022-04-15 12:30:02,967 INFO L290 TraceCheckUtils]: 105: Hoare triple {34551#(<= 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; {34551#(<= 24 main_~main__t~0)} is VALID [2022-04-15 12:30:02,968 INFO L290 TraceCheckUtils]: 106: Hoare triple {34551#(<= 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; {34552#(<= 25 main_~main__t~0)} is VALID [2022-04-15 12:30:02,968 INFO L290 TraceCheckUtils]: 107: Hoare triple {34552#(<= 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; {34552#(<= 25 main_~main__t~0)} is VALID [2022-04-15 12:30:02,968 INFO L290 TraceCheckUtils]: 108: Hoare triple {34552#(<= 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; {34552#(<= 25 main_~main__t~0)} is VALID [2022-04-15 12:30:02,969 INFO L290 TraceCheckUtils]: 109: Hoare triple {34552#(<= 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; {34552#(<= 25 main_~main__t~0)} is VALID [2022-04-15 12:30:02,969 INFO L290 TraceCheckUtils]: 110: Hoare triple {34552#(<= 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; {34553#(<= 26 main_~main__t~0)} is VALID [2022-04-15 12:30:02,969 INFO L290 TraceCheckUtils]: 111: Hoare triple {34553#(<= 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; {34553#(<= 26 main_~main__t~0)} is VALID [2022-04-15 12:30:02,970 INFO L290 TraceCheckUtils]: 112: Hoare triple {34553#(<= 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; {34553#(<= 26 main_~main__t~0)} is VALID [2022-04-15 12:30:02,970 INFO L290 TraceCheckUtils]: 113: Hoare triple {34553#(<= 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; {34553#(<= 26 main_~main__t~0)} is VALID [2022-04-15 12:30:02,970 INFO L290 TraceCheckUtils]: 114: Hoare triple {34553#(<= 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; {34554#(<= 27 main_~main__t~0)} is VALID [2022-04-15 12:30:02,971 INFO L290 TraceCheckUtils]: 115: Hoare triple {34554#(<= 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; {34554#(<= 27 main_~main__t~0)} is VALID [2022-04-15 12:30:02,971 INFO L290 TraceCheckUtils]: 116: Hoare triple {34554#(<= 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; {34554#(<= 27 main_~main__t~0)} is VALID [2022-04-15 12:30:02,971 INFO L290 TraceCheckUtils]: 117: Hoare triple {34554#(<= 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; {34554#(<= 27 main_~main__t~0)} is VALID [2022-04-15 12:30:02,972 INFO L290 TraceCheckUtils]: 118: Hoare triple {34554#(<= 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; {34555#(<= 28 main_~main__t~0)} is VALID [2022-04-15 12:30:02,972 INFO L290 TraceCheckUtils]: 119: Hoare triple {34555#(<= 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; {34555#(<= 28 main_~main__t~0)} is VALID [2022-04-15 12:30:02,972 INFO L290 TraceCheckUtils]: 120: Hoare triple {34555#(<= 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; {34555#(<= 28 main_~main__t~0)} is VALID [2022-04-15 12:30:02,973 INFO L290 TraceCheckUtils]: 121: Hoare triple {34555#(<= 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; {34555#(<= 28 main_~main__t~0)} is VALID [2022-04-15 12:30:02,973 INFO L290 TraceCheckUtils]: 122: Hoare triple {34555#(<= 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; {34556#(<= 29 main_~main__t~0)} is VALID [2022-04-15 12:30:02,973 INFO L290 TraceCheckUtils]: 123: Hoare triple {34556#(<= 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; {34556#(<= 29 main_~main__t~0)} is VALID [2022-04-15 12:30:02,973 INFO L290 TraceCheckUtils]: 124: Hoare triple {34556#(<= 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; {34556#(<= 29 main_~main__t~0)} is VALID [2022-04-15 12:30:02,974 INFO L290 TraceCheckUtils]: 125: Hoare triple {34556#(<= 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; {34556#(<= 29 main_~main__t~0)} is VALID [2022-04-15 12:30:02,974 INFO L290 TraceCheckUtils]: 126: Hoare triple {34556#(<= 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; {34557#(<= 30 main_~main__t~0)} is VALID [2022-04-15 12:30:02,974 INFO L290 TraceCheckUtils]: 127: Hoare triple {34557#(<= 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; {34557#(<= 30 main_~main__t~0)} is VALID [2022-04-15 12:30:02,975 INFO L290 TraceCheckUtils]: 128: Hoare triple {34557#(<= 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; {34557#(<= 30 main_~main__t~0)} is VALID [2022-04-15 12:30:02,975 INFO L290 TraceCheckUtils]: 129: Hoare triple {34557#(<= 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; {34557#(<= 30 main_~main__t~0)} is VALID [2022-04-15 12:30:02,975 INFO L290 TraceCheckUtils]: 130: Hoare triple {34557#(<= 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; {34558#(<= 31 main_~main__t~0)} is VALID [2022-04-15 12:30:02,976 INFO L290 TraceCheckUtils]: 131: Hoare triple {34558#(<= 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; {34558#(<= 31 main_~main__t~0)} is VALID [2022-04-15 12:30:02,976 INFO L290 TraceCheckUtils]: 132: Hoare triple {34558#(<= 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; {34558#(<= 31 main_~main__t~0)} is VALID [2022-04-15 12:30:02,977 INFO L290 TraceCheckUtils]: 133: Hoare triple {34558#(<= 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; {34558#(<= 31 main_~main__t~0)} is VALID [2022-04-15 12:30:02,977 INFO L290 TraceCheckUtils]: 134: Hoare triple {34558#(<= 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; {34559#(<= 32 main_~main__t~0)} is VALID [2022-04-15 12:30:02,977 INFO L290 TraceCheckUtils]: 135: Hoare triple {34559#(<= 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; {34559#(<= 32 main_~main__t~0)} is VALID [2022-04-15 12:30:02,977 INFO L290 TraceCheckUtils]: 136: Hoare triple {34559#(<= 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; {34559#(<= 32 main_~main__t~0)} is VALID [2022-04-15 12:30:02,978 INFO L290 TraceCheckUtils]: 137: Hoare triple {34559#(<= 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; {34559#(<= 32 main_~main__t~0)} is VALID [2022-04-15 12:30:02,978 INFO L290 TraceCheckUtils]: 138: Hoare triple {34559#(<= 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; {34560#(<= 33 main_~main__t~0)} is VALID [2022-04-15 12:30:02,978 INFO L290 TraceCheckUtils]: 139: Hoare triple {34560#(<= 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; {34560#(<= 33 main_~main__t~0)} is VALID [2022-04-15 12:30:02,979 INFO L290 TraceCheckUtils]: 140: Hoare triple {34560#(<= 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; {34560#(<= 33 main_~main__t~0)} is VALID [2022-04-15 12:30:02,979 INFO L290 TraceCheckUtils]: 141: Hoare triple {34560#(<= 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; {34560#(<= 33 main_~main__t~0)} is VALID [2022-04-15 12:30:02,979 INFO L290 TraceCheckUtils]: 142: Hoare triple {34560#(<= 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; {34561#(<= 34 main_~main__t~0)} is VALID [2022-04-15 12:30:02,980 INFO L290 TraceCheckUtils]: 143: Hoare triple {34561#(<= 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; {34561#(<= 34 main_~main__t~0)} is VALID [2022-04-15 12:30:02,980 INFO L290 TraceCheckUtils]: 144: Hoare triple {34561#(<= 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; {34561#(<= 34 main_~main__t~0)} is VALID [2022-04-15 12:30:02,980 INFO L290 TraceCheckUtils]: 145: Hoare triple {34561#(<= 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; {34561#(<= 34 main_~main__t~0)} is VALID [2022-04-15 12:30:02,981 INFO L290 TraceCheckUtils]: 146: Hoare triple {34561#(<= 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; {34562#(<= 35 main_~main__t~0)} is VALID [2022-04-15 12:30:02,981 INFO L290 TraceCheckUtils]: 147: Hoare triple {34562#(<= 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; {34562#(<= 35 main_~main__t~0)} is VALID [2022-04-15 12:30:02,981 INFO L290 TraceCheckUtils]: 148: Hoare triple {34562#(<= 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; {34562#(<= 35 main_~main__t~0)} is VALID [2022-04-15 12:30:02,982 INFO L290 TraceCheckUtils]: 149: Hoare triple {34562#(<= 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; {34562#(<= 35 main_~main__t~0)} is VALID [2022-04-15 12:30:02,982 INFO L290 TraceCheckUtils]: 150: Hoare triple {34562#(<= 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; {34563#(<= 36 main_~main__t~0)} is VALID [2022-04-15 12:30:02,982 INFO L290 TraceCheckUtils]: 151: Hoare triple {34563#(<= 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; {34563#(<= 36 main_~main__t~0)} is VALID [2022-04-15 12:30:02,983 INFO L290 TraceCheckUtils]: 152: Hoare triple {34563#(<= 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; {34563#(<= 36 main_~main__t~0)} is VALID [2022-04-15 12:30:02,983 INFO L290 TraceCheckUtils]: 153: Hoare triple {34563#(<= 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; {34563#(<= 36 main_~main__t~0)} is VALID [2022-04-15 12:30:02,983 INFO L290 TraceCheckUtils]: 154: Hoare triple {34563#(<= 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; {34564#(<= 37 main_~main__t~0)} is VALID [2022-04-15 12:30:02,984 INFO L290 TraceCheckUtils]: 155: Hoare triple {34564#(<= 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; {34564#(<= 37 main_~main__t~0)} is VALID [2022-04-15 12:30:02,984 INFO L290 TraceCheckUtils]: 156: Hoare triple {34564#(<= 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; {34564#(<= 37 main_~main__t~0)} is VALID [2022-04-15 12:30:02,984 INFO L290 TraceCheckUtils]: 157: Hoare triple {34564#(<= 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; {34564#(<= 37 main_~main__t~0)} is VALID [2022-04-15 12:30:02,985 INFO L290 TraceCheckUtils]: 158: Hoare triple {34564#(<= 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; {34565#(<= 38 main_~main__t~0)} is VALID [2022-04-15 12:30:02,985 INFO L290 TraceCheckUtils]: 159: Hoare triple {34565#(<= 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; {34565#(<= 38 main_~main__t~0)} is VALID [2022-04-15 12:30:02,985 INFO L290 TraceCheckUtils]: 160: Hoare triple {34565#(<= 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; {34565#(<= 38 main_~main__t~0)} is VALID [2022-04-15 12:30:02,985 INFO L290 TraceCheckUtils]: 161: Hoare triple {34565#(<= 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; {34565#(<= 38 main_~main__t~0)} is VALID [2022-04-15 12:30:02,986 INFO L290 TraceCheckUtils]: 162: Hoare triple {34565#(<= 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; {34566#(<= 39 main_~main__t~0)} is VALID [2022-04-15 12:30:02,986 INFO L290 TraceCheckUtils]: 163: Hoare triple {34566#(<= 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; {34566#(<= 39 main_~main__t~0)} is VALID [2022-04-15 12:30:02,986 INFO L290 TraceCheckUtils]: 164: Hoare triple {34566#(<= 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; {34566#(<= 39 main_~main__t~0)} is VALID [2022-04-15 12:30:02,987 INFO L290 TraceCheckUtils]: 165: Hoare triple {34566#(<= 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; {34566#(<= 39 main_~main__t~0)} is VALID [2022-04-15 12:30:02,991 INFO L290 TraceCheckUtils]: 166: Hoare triple {34566#(<= 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; {34567#(<= 40 main_~main__t~0)} is VALID [2022-04-15 12:30:02,991 INFO L290 TraceCheckUtils]: 167: Hoare triple {34567#(<= 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; {34567#(<= 40 main_~main__t~0)} is VALID [2022-04-15 12:30:02,991 INFO L290 TraceCheckUtils]: 168: Hoare triple {34567#(<= 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; {34567#(<= 40 main_~main__t~0)} is VALID [2022-04-15 12:30:02,992 INFO L290 TraceCheckUtils]: 169: Hoare triple {34567#(<= 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; {34567#(<= 40 main_~main__t~0)} is VALID [2022-04-15 12:30:02,992 INFO L290 TraceCheckUtils]: 170: Hoare triple {34567#(<= 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; {34568#(<= 41 main_~main__t~0)} is VALID [2022-04-15 12:30:02,992 INFO L290 TraceCheckUtils]: 171: Hoare triple {34568#(<= 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; {34568#(<= 41 main_~main__t~0)} is VALID [2022-04-15 12:30:02,993 INFO L290 TraceCheckUtils]: 172: Hoare triple {34568#(<= 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; {34568#(<= 41 main_~main__t~0)} is VALID [2022-04-15 12:30:02,993 INFO L290 TraceCheckUtils]: 173: Hoare triple {34568#(<= 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; {34568#(<= 41 main_~main__t~0)} is VALID [2022-04-15 12:30:02,993 INFO L290 TraceCheckUtils]: 174: Hoare triple {34568#(<= 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; {34569#(<= 42 main_~main__t~0)} is VALID [2022-04-15 12:30:02,994 INFO L290 TraceCheckUtils]: 175: Hoare triple {34569#(<= 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; {34569#(<= 42 main_~main__t~0)} is VALID [2022-04-15 12:30:02,994 INFO L290 TraceCheckUtils]: 176: Hoare triple {34569#(<= 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; {34569#(<= 42 main_~main__t~0)} is VALID [2022-04-15 12:30:02,994 INFO L290 TraceCheckUtils]: 177: Hoare triple {34569#(<= 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; {34569#(<= 42 main_~main__t~0)} is VALID [2022-04-15 12:30:02,994 INFO L290 TraceCheckUtils]: 178: Hoare triple {34569#(<= 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; {34570#(<= 43 main_~main__t~0)} is VALID [2022-04-15 12:30:02,995 INFO L290 TraceCheckUtils]: 179: Hoare triple {34570#(<= 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; {34570#(<= 43 main_~main__t~0)} is VALID [2022-04-15 12:30:02,995 INFO L290 TraceCheckUtils]: 180: Hoare triple {34570#(<= 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; {34570#(<= 43 main_~main__t~0)} is VALID [2022-04-15 12:30:02,995 INFO L290 TraceCheckUtils]: 181: Hoare triple {34570#(<= 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; {34570#(<= 43 main_~main__t~0)} is VALID [2022-04-15 12:30:02,996 INFO L290 TraceCheckUtils]: 182: Hoare triple {34570#(<= 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; {34571#(<= 44 main_~main__t~0)} is VALID [2022-04-15 12:30:02,996 INFO L290 TraceCheckUtils]: 183: Hoare triple {34571#(<= 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; {34571#(<= 44 main_~main__t~0)} is VALID [2022-04-15 12:30:02,996 INFO L290 TraceCheckUtils]: 184: Hoare triple {34571#(<= 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; {34571#(<= 44 main_~main__t~0)} is VALID [2022-04-15 12:30:02,997 INFO L290 TraceCheckUtils]: 185: Hoare triple {34571#(<= 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; {34571#(<= 44 main_~main__t~0)} is VALID [2022-04-15 12:30:02,997 INFO L290 TraceCheckUtils]: 186: Hoare triple {34571#(<= 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; {34572#(<= 45 main_~main__t~0)} is VALID [2022-04-15 12:30:02,997 INFO L290 TraceCheckUtils]: 187: Hoare triple {34572#(<= 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; {34572#(<= 45 main_~main__t~0)} is VALID [2022-04-15 12:30:02,997 INFO L290 TraceCheckUtils]: 188: Hoare triple {34572#(<= 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; {34572#(<= 45 main_~main__t~0)} is VALID [2022-04-15 12:30:02,998 INFO L290 TraceCheckUtils]: 189: Hoare triple {34572#(<= 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; {34572#(<= 45 main_~main__t~0)} is VALID [2022-04-15 12:30:02,998 INFO L290 TraceCheckUtils]: 190: Hoare triple {34572#(<= 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; {34573#(<= 46 main_~main__t~0)} is VALID [2022-04-15 12:30:02,998 INFO L290 TraceCheckUtils]: 191: Hoare triple {34573#(<= 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; {34573#(<= 46 main_~main__t~0)} is VALID [2022-04-15 12:30:02,999 INFO L290 TraceCheckUtils]: 192: Hoare triple {34573#(<= 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; {34573#(<= 46 main_~main__t~0)} is VALID [2022-04-15 12:30:02,999 INFO L290 TraceCheckUtils]: 193: Hoare triple {34573#(<= 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; {34573#(<= 46 main_~main__t~0)} is VALID [2022-04-15 12:30:02,999 INFO L290 TraceCheckUtils]: 194: Hoare triple {34573#(<= 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; {34574#(<= 47 main_~main__t~0)} is VALID [2022-04-15 12:30:03,000 INFO L290 TraceCheckUtils]: 195: Hoare triple {34574#(<= 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; {34574#(<= 47 main_~main__t~0)} is VALID [2022-04-15 12:30:03,000 INFO L290 TraceCheckUtils]: 196: Hoare triple {34574#(<= 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; {34574#(<= 47 main_~main__t~0)} is VALID [2022-04-15 12:30:03,001 INFO L290 TraceCheckUtils]: 197: Hoare triple {34574#(<= 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; {34574#(<= 47 main_~main__t~0)} is VALID [2022-04-15 12:30:03,001 INFO L290 TraceCheckUtils]: 198: Hoare triple {34574#(<= 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; {34575#(<= 48 main_~main__t~0)} is VALID [2022-04-15 12:30:03,001 INFO L290 TraceCheckUtils]: 199: Hoare triple {34575#(<= 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; {34575#(<= 48 main_~main__t~0)} is VALID [2022-04-15 12:30:03,002 INFO L290 TraceCheckUtils]: 200: Hoare triple {34575#(<= 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; {34575#(<= 48 main_~main__t~0)} is VALID [2022-04-15 12:30:03,002 INFO L290 TraceCheckUtils]: 201: Hoare triple {34575#(<= 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; {34575#(<= 48 main_~main__t~0)} is VALID [2022-04-15 12:30:03,003 INFO L290 TraceCheckUtils]: 202: Hoare triple {34575#(<= 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; {34576#(<= 49 main_~main__t~0)} is VALID [2022-04-15 12:30:03,003 INFO L290 TraceCheckUtils]: 203: Hoare triple {34576#(<= 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; {34576#(<= 49 main_~main__t~0)} is VALID [2022-04-15 12:30:03,003 INFO L290 TraceCheckUtils]: 204: Hoare triple {34576#(<= 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; {34576#(<= 49 main_~main__t~0)} is VALID [2022-04-15 12:30:03,004 INFO L290 TraceCheckUtils]: 205: Hoare triple {34576#(<= 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; {34576#(<= 49 main_~main__t~0)} is VALID [2022-04-15 12:30:03,004 INFO L290 TraceCheckUtils]: 206: Hoare triple {34576#(<= 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; {34577#(<= 50 main_~main__t~0)} is VALID [2022-04-15 12:30:03,004 INFO L290 TraceCheckUtils]: 207: Hoare triple {34577#(<= 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; {34577#(<= 50 main_~main__t~0)} is VALID [2022-04-15 12:30:03,005 INFO L290 TraceCheckUtils]: 208: Hoare triple {34577#(<= 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; {34577#(<= 50 main_~main__t~0)} is VALID [2022-04-15 12:30:03,011 INFO L290 TraceCheckUtils]: 209: Hoare triple {34577#(<= 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; {34577#(<= 50 main_~main__t~0)} is VALID [2022-04-15 12:30:03,011 INFO L290 TraceCheckUtils]: 210: Hoare triple {34577#(<= 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; {34578#(<= 51 main_~main__t~0)} is VALID [2022-04-15 12:30:03,012 INFO L290 TraceCheckUtils]: 211: Hoare triple {34578#(<= 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; {34578#(<= 51 main_~main__t~0)} is VALID [2022-04-15 12:30:03,012 INFO L290 TraceCheckUtils]: 212: Hoare triple {34578#(<= 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; {34578#(<= 51 main_~main__t~0)} is VALID [2022-04-15 12:30:03,012 INFO L290 TraceCheckUtils]: 213: Hoare triple {34578#(<= 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; {34578#(<= 51 main_~main__t~0)} is VALID [2022-04-15 12:30:03,013 INFO L290 TraceCheckUtils]: 214: Hoare triple {34578#(<= 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; {34579#(<= 52 main_~main__t~0)} is VALID [2022-04-15 12:30:03,013 INFO L290 TraceCheckUtils]: 215: Hoare triple {34579#(<= 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; {34579#(<= 52 main_~main__t~0)} is VALID [2022-04-15 12:30:03,013 INFO L290 TraceCheckUtils]: 216: Hoare triple {34579#(<= 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; {34579#(<= 52 main_~main__t~0)} is VALID [2022-04-15 12:30:03,014 INFO L290 TraceCheckUtils]: 217: Hoare triple {34579#(<= 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; {34579#(<= 52 main_~main__t~0)} is VALID [2022-04-15 12:30:03,014 INFO L290 TraceCheckUtils]: 218: Hoare triple {34579#(<= 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; {34580#(<= 53 main_~main__t~0)} is VALID [2022-04-15 12:30:03,014 INFO L290 TraceCheckUtils]: 219: Hoare triple {34580#(<= 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; {34580#(<= 53 main_~main__t~0)} is VALID [2022-04-15 12:30:03,015 INFO L290 TraceCheckUtils]: 220: Hoare triple {34580#(<= 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; {34580#(<= 53 main_~main__t~0)} is VALID [2022-04-15 12:30:03,015 INFO L290 TraceCheckUtils]: 221: Hoare triple {34580#(<= 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; {34580#(<= 53 main_~main__t~0)} is VALID [2022-04-15 12:30:03,015 INFO L290 TraceCheckUtils]: 222: Hoare triple {34580#(<= 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; {34581#(<= 54 main_~main__t~0)} is VALID [2022-04-15 12:30:03,016 INFO L290 TraceCheckUtils]: 223: Hoare triple {34581#(<= 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; {34581#(<= 54 main_~main__t~0)} is VALID [2022-04-15 12:30:03,016 INFO L290 TraceCheckUtils]: 224: Hoare triple {34581#(<= 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; {34581#(<= 54 main_~main__t~0)} is VALID [2022-04-15 12:30:03,016 INFO L290 TraceCheckUtils]: 225: Hoare triple {34581#(<= 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; {34581#(<= 54 main_~main__t~0)} is VALID [2022-04-15 12:30:03,016 INFO L290 TraceCheckUtils]: 226: Hoare triple {34581#(<= 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; {34582#(<= 55 main_~main__t~0)} is VALID [2022-04-15 12:30:03,017 INFO L290 TraceCheckUtils]: 227: Hoare triple {34582#(<= 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; {34582#(<= 55 main_~main__t~0)} is VALID [2022-04-15 12:30:03,017 INFO L290 TraceCheckUtils]: 228: Hoare triple {34582#(<= 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; {34582#(<= 55 main_~main__t~0)} is VALID [2022-04-15 12:30:03,017 INFO L290 TraceCheckUtils]: 229: Hoare triple {34582#(<= 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; {34582#(<= 55 main_~main__t~0)} is VALID [2022-04-15 12:30:03,018 INFO L290 TraceCheckUtils]: 230: Hoare triple {34582#(<= 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; {34583#(<= 56 main_~main__t~0)} is VALID [2022-04-15 12:30:03,018 INFO L290 TraceCheckUtils]: 231: Hoare triple {34583#(<= 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; {34583#(<= 56 main_~main__t~0)} is VALID [2022-04-15 12:30:03,018 INFO L290 TraceCheckUtils]: 232: Hoare triple {34583#(<= 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; {34583#(<= 56 main_~main__t~0)} is VALID [2022-04-15 12:30:03,019 INFO L290 TraceCheckUtils]: 233: Hoare triple {34583#(<= 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; {34583#(<= 56 main_~main__t~0)} is VALID [2022-04-15 12:30:03,019 INFO L290 TraceCheckUtils]: 234: Hoare triple {34583#(<= 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; {34584#(<= 57 main_~main__t~0)} is VALID [2022-04-15 12:30:03,019 INFO L290 TraceCheckUtils]: 235: Hoare triple {34584#(<= 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; {34584#(<= 57 main_~main__t~0)} is VALID [2022-04-15 12:30:03,019 INFO L290 TraceCheckUtils]: 236: Hoare triple {34584#(<= 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; {34584#(<= 57 main_~main__t~0)} is VALID [2022-04-15 12:30:03,020 INFO L290 TraceCheckUtils]: 237: Hoare triple {34584#(<= 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; {34584#(<= 57 main_~main__t~0)} is VALID [2022-04-15 12:30:03,020 INFO L290 TraceCheckUtils]: 238: Hoare triple {34584#(<= 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; {34585#(<= 58 main_~main__t~0)} is VALID [2022-04-15 12:30:03,020 INFO L290 TraceCheckUtils]: 239: Hoare triple {34585#(<= 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; {34585#(<= 58 main_~main__t~0)} is VALID [2022-04-15 12:30:03,021 INFO L290 TraceCheckUtils]: 240: Hoare triple {34585#(<= 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; {34585#(<= 58 main_~main__t~0)} is VALID [2022-04-15 12:30:03,021 INFO L290 TraceCheckUtils]: 241: Hoare triple {34585#(<= 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; {34585#(<= 58 main_~main__t~0)} is VALID [2022-04-15 12:30:03,021 INFO L290 TraceCheckUtils]: 242: Hoare triple {34585#(<= 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; {34586#(<= 59 main_~main__t~0)} is VALID [2022-04-15 12:30:03,022 INFO L290 TraceCheckUtils]: 243: Hoare triple {34586#(<= 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; {34586#(<= 59 main_~main__t~0)} is VALID [2022-04-15 12:30:03,022 INFO L290 TraceCheckUtils]: 244: Hoare triple {34586#(<= 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; {34586#(<= 59 main_~main__t~0)} is VALID [2022-04-15 12:30:03,022 INFO L290 TraceCheckUtils]: 245: Hoare triple {34586#(<= 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; {34587#(not (= main_~__VERIFIER_assert__cond~132 0))} is VALID [2022-04-15 12:30:03,023 INFO L290 TraceCheckUtils]: 246: Hoare triple {34587#(not (= main_~__VERIFIER_assert__cond~132 0))} assume 0 == ~__VERIFIER_assert__cond~132; {34523#false} is VALID [2022-04-15 12:30:03,023 INFO L290 TraceCheckUtils]: 247: Hoare triple {34523#false} assume !false; {34523#false} is VALID [2022-04-15 12:30:03,026 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-15 12:30:03,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:03,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227499661] [2022-04-15 12:30:03,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227499661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:03,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:03,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-15 12:30:03,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:03,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1488718072] [2022-04-15 12:30:03,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1488718072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:03,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:03,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-15 12:30:03,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049212463] [2022-04-15 12:30:03,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:03,028 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-15 12:30:03,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:03,028 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-15 12:30:03,171 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-15 12:30:03,171 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-15 12:30:03,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:03,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-15 12:30:03,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1836, Invalid=2196, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 12:30:03,174 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-15 12:30:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:07,592 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2022-04-15 12:30:07,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-15 12:30:07,592 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-15 12:30:07,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:07,594 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-15 12:30:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 255 transitions. [2022-04-15 12:30:07,597 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-15 12:30:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 255 transitions. [2022-04-15 12:30:07,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 255 transitions. [2022-04-15 12:30:07,796 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-15 12:30:07,798 INFO L225 Difference]: With dead ends: 255 [2022-04-15 12:30:07,798 INFO L226 Difference]: Without dead ends: 253 [2022-04-15 12:30:07,801 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=5560, Invalid=9940, Unknown=0, NotChecked=0, Total=15500 [2022-04-15 12:30:07,802 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 779 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:07,802 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [779 Valid, 56 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 12:30:07,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-15 12:30:08,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2022-04-15 12:30:08,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:08,269 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-15 12:30:08,269 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-15 12:30:08,269 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-15 12:30:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:08,272 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2022-04-15 12:30:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2022-04-15 12:30:08,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:08,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:08,273 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-15 12:30:08,273 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-15 12:30:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:08,275 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2022-04-15 12:30:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2022-04-15 12:30:08,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:08,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:08,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:08,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:08,276 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-15 12:30:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2022-04-15 12:30:08,279 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2022-04-15 12:30:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:08,279 INFO L478 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2022-04-15 12:30:08,279 INFO L479 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-15 12:30:08,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 252 transitions. [2022-04-15 12:30:08,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:08,509 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2022-04-15 12:30:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-04-15 12:30:08,511 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:08,511 INFO L499 BasicCegarLoop]: 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-15 12:30:08,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 12:30:08,511 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-15 12:30:08,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash 123173085, now seen corresponding path program 1 times [2022-04-15 12:30:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:08,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [753621349] [2022-04-15 12:30:08,512 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:30:08,512 INFO L85 PathProgramCache]: Analyzing trace with hash 123173085, now seen corresponding path program 2 times [2022-04-15 12:30:08,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:08,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319400056] [2022-04-15 12:30:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:09,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:09,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {36243#(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; {36233#true} is VALID [2022-04-15 12:30:09,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {36233#true} assume true; {36233#true} is VALID [2022-04-15 12:30:09,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36233#true} {36233#true} #1237#return; {36233#true} is VALID [2022-04-15 12:30:09,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {36233#true} call ULTIMATE.init(); {36243#(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-15 12:30:09,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {36243#(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; {36233#true} is VALID [2022-04-15 12:30:09,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {36233#true} assume true; {36233#true} is VALID [2022-04-15 12:30:09,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36233#true} {36233#true} #1237#return; {36233#true} is VALID [2022-04-15 12:30:09,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {36233#true} call #t~ret69 := main(); {36233#true} is VALID [2022-04-15 12:30:09,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {36233#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; {36233#true} is VALID [2022-04-15 12:30:09,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {36233#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {36233#true} is VALID [2022-04-15 12:30:09,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {36233#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; {36233#true} is VALID [2022-04-15 12:30:09,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {36233#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; {36233#true} is VALID [2022-04-15 12:30:09,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {36233#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; {36233#true} is VALID [2022-04-15 12:30:09,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {36233#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {36233#true} is VALID [2022-04-15 12:30:09,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {36233#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; {36238#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-15 12:30:09,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {36238#(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; {36238#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-15 12:30:09,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {36238#(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; {36239#(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-15 12:30:09,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {36239#(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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,591 INFO L290 TraceCheckUtils]: 37: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,594 INFO L290 TraceCheckUtils]: 46: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,595 INFO L290 TraceCheckUtils]: 47: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,595 INFO L290 TraceCheckUtils]: 49: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,596 INFO L290 TraceCheckUtils]: 51: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,596 INFO L290 TraceCheckUtils]: 52: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,597 INFO L290 TraceCheckUtils]: 53: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,597 INFO L290 TraceCheckUtils]: 54: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,598 INFO L290 TraceCheckUtils]: 55: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,598 INFO L290 TraceCheckUtils]: 56: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,599 INFO L290 TraceCheckUtils]: 59: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,599 INFO L290 TraceCheckUtils]: 60: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,599 INFO L290 TraceCheckUtils]: 61: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,600 INFO L290 TraceCheckUtils]: 63: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,601 INFO L290 TraceCheckUtils]: 65: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,601 INFO L290 TraceCheckUtils]: 66: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,602 INFO L290 TraceCheckUtils]: 67: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,602 INFO L290 TraceCheckUtils]: 68: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,603 INFO L290 TraceCheckUtils]: 69: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,603 INFO L290 TraceCheckUtils]: 70: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,603 INFO L290 TraceCheckUtils]: 71: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,604 INFO L290 TraceCheckUtils]: 72: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,604 INFO L290 TraceCheckUtils]: 73: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,605 INFO L290 TraceCheckUtils]: 74: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,605 INFO L290 TraceCheckUtils]: 75: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,605 INFO L290 TraceCheckUtils]: 76: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,606 INFO L290 TraceCheckUtils]: 77: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,606 INFO L290 TraceCheckUtils]: 78: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,607 INFO L290 TraceCheckUtils]: 79: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,607 INFO L290 TraceCheckUtils]: 80: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,607 INFO L290 TraceCheckUtils]: 81: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,608 INFO L290 TraceCheckUtils]: 82: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,608 INFO L290 TraceCheckUtils]: 83: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,608 INFO L290 TraceCheckUtils]: 84: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,609 INFO L290 TraceCheckUtils]: 85: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,609 INFO L290 TraceCheckUtils]: 86: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,610 INFO L290 TraceCheckUtils]: 87: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,610 INFO L290 TraceCheckUtils]: 88: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,610 INFO L290 TraceCheckUtils]: 89: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,611 INFO L290 TraceCheckUtils]: 90: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,611 INFO L290 TraceCheckUtils]: 91: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,612 INFO L290 TraceCheckUtils]: 92: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,612 INFO L290 TraceCheckUtils]: 93: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,612 INFO L290 TraceCheckUtils]: 94: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,613 INFO L290 TraceCheckUtils]: 95: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,613 INFO L290 TraceCheckUtils]: 96: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,613 INFO L290 TraceCheckUtils]: 97: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,614 INFO L290 TraceCheckUtils]: 98: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,614 INFO L290 TraceCheckUtils]: 99: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,615 INFO L290 TraceCheckUtils]: 100: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,615 INFO L290 TraceCheckUtils]: 101: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,616 INFO L290 TraceCheckUtils]: 102: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,616 INFO L290 TraceCheckUtils]: 103: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,616 INFO L290 TraceCheckUtils]: 104: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,617 INFO L290 TraceCheckUtils]: 105: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,617 INFO L290 TraceCheckUtils]: 106: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,618 INFO L290 TraceCheckUtils]: 107: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,618 INFO L290 TraceCheckUtils]: 108: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,618 INFO L290 TraceCheckUtils]: 109: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,619 INFO L290 TraceCheckUtils]: 110: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,619 INFO L290 TraceCheckUtils]: 111: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,619 INFO L290 TraceCheckUtils]: 112: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,619 INFO L290 TraceCheckUtils]: 113: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,620 INFO L290 TraceCheckUtils]: 114: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,620 INFO L290 TraceCheckUtils]: 115: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,621 INFO L290 TraceCheckUtils]: 116: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,621 INFO L290 TraceCheckUtils]: 117: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,621 INFO L290 TraceCheckUtils]: 118: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,622 INFO L290 TraceCheckUtils]: 119: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,622 INFO L290 TraceCheckUtils]: 120: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,622 INFO L290 TraceCheckUtils]: 121: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,623 INFO L290 TraceCheckUtils]: 122: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,623 INFO L290 TraceCheckUtils]: 123: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,623 INFO L290 TraceCheckUtils]: 124: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,624 INFO L290 TraceCheckUtils]: 125: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,624 INFO L290 TraceCheckUtils]: 126: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,624 INFO L290 TraceCheckUtils]: 127: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,625 INFO L290 TraceCheckUtils]: 128: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,625 INFO L290 TraceCheckUtils]: 129: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,625 INFO L290 TraceCheckUtils]: 130: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,626 INFO L290 TraceCheckUtils]: 131: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,626 INFO L290 TraceCheckUtils]: 132: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,626 INFO L290 TraceCheckUtils]: 133: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,627 INFO L290 TraceCheckUtils]: 134: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,627 INFO L290 TraceCheckUtils]: 135: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,627 INFO L290 TraceCheckUtils]: 136: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,628 INFO L290 TraceCheckUtils]: 137: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,628 INFO L290 TraceCheckUtils]: 138: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,629 INFO L290 TraceCheckUtils]: 139: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,629 INFO L290 TraceCheckUtils]: 140: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,629 INFO L290 TraceCheckUtils]: 141: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,630 INFO L290 TraceCheckUtils]: 142: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,630 INFO L290 TraceCheckUtils]: 143: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,630 INFO L290 TraceCheckUtils]: 144: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,631 INFO L290 TraceCheckUtils]: 145: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,631 INFO L290 TraceCheckUtils]: 146: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,631 INFO L290 TraceCheckUtils]: 147: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,632 INFO L290 TraceCheckUtils]: 148: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,632 INFO L290 TraceCheckUtils]: 149: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,633 INFO L290 TraceCheckUtils]: 150: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,633 INFO L290 TraceCheckUtils]: 151: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,633 INFO L290 TraceCheckUtils]: 152: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,633 INFO L290 TraceCheckUtils]: 153: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,634 INFO L290 TraceCheckUtils]: 154: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,634 INFO L290 TraceCheckUtils]: 155: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,635 INFO L290 TraceCheckUtils]: 156: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,635 INFO L290 TraceCheckUtils]: 157: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,635 INFO L290 TraceCheckUtils]: 158: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,636 INFO L290 TraceCheckUtils]: 159: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,636 INFO L290 TraceCheckUtils]: 160: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,636 INFO L290 TraceCheckUtils]: 161: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,637 INFO L290 TraceCheckUtils]: 162: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,637 INFO L290 TraceCheckUtils]: 163: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,638 INFO L290 TraceCheckUtils]: 164: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,638 INFO L290 TraceCheckUtils]: 165: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,638 INFO L290 TraceCheckUtils]: 166: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,639 INFO L290 TraceCheckUtils]: 167: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,639 INFO L290 TraceCheckUtils]: 168: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,639 INFO L290 TraceCheckUtils]: 169: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,640 INFO L290 TraceCheckUtils]: 170: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,640 INFO L290 TraceCheckUtils]: 171: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,640 INFO L290 TraceCheckUtils]: 172: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,641 INFO L290 TraceCheckUtils]: 173: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,641 INFO L290 TraceCheckUtils]: 174: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,642 INFO L290 TraceCheckUtils]: 175: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,642 INFO L290 TraceCheckUtils]: 176: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,642 INFO L290 TraceCheckUtils]: 177: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,642 INFO L290 TraceCheckUtils]: 178: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,643 INFO L290 TraceCheckUtils]: 179: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,643 INFO L290 TraceCheckUtils]: 180: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,643 INFO L290 TraceCheckUtils]: 181: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,644 INFO L290 TraceCheckUtils]: 182: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,644 INFO L290 TraceCheckUtils]: 183: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,645 INFO L290 TraceCheckUtils]: 184: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,645 INFO L290 TraceCheckUtils]: 185: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,645 INFO L290 TraceCheckUtils]: 186: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,646 INFO L290 TraceCheckUtils]: 187: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,646 INFO L290 TraceCheckUtils]: 188: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,646 INFO L290 TraceCheckUtils]: 189: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,647 INFO L290 TraceCheckUtils]: 190: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,647 INFO L290 TraceCheckUtils]: 191: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,647 INFO L290 TraceCheckUtils]: 192: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,648 INFO L290 TraceCheckUtils]: 193: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,648 INFO L290 TraceCheckUtils]: 194: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,649 INFO L290 TraceCheckUtils]: 195: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,649 INFO L290 TraceCheckUtils]: 196: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,649 INFO L290 TraceCheckUtils]: 197: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,650 INFO L290 TraceCheckUtils]: 198: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,650 INFO L290 TraceCheckUtils]: 199: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,650 INFO L290 TraceCheckUtils]: 200: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,650 INFO L290 TraceCheckUtils]: 201: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,651 INFO L290 TraceCheckUtils]: 202: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,651 INFO L290 TraceCheckUtils]: 203: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,652 INFO L290 TraceCheckUtils]: 204: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,652 INFO L290 TraceCheckUtils]: 205: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,652 INFO L290 TraceCheckUtils]: 206: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,653 INFO L290 TraceCheckUtils]: 207: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,653 INFO L290 TraceCheckUtils]: 208: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,653 INFO L290 TraceCheckUtils]: 209: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,653 INFO L290 TraceCheckUtils]: 210: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,654 INFO L290 TraceCheckUtils]: 211: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,654 INFO L290 TraceCheckUtils]: 212: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,654 INFO L290 TraceCheckUtils]: 213: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,655 INFO L290 TraceCheckUtils]: 214: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,655 INFO L290 TraceCheckUtils]: 215: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,655 INFO L290 TraceCheckUtils]: 216: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,656 INFO L290 TraceCheckUtils]: 217: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,656 INFO L290 TraceCheckUtils]: 218: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,656 INFO L290 TraceCheckUtils]: 219: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,657 INFO L290 TraceCheckUtils]: 220: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,657 INFO L290 TraceCheckUtils]: 221: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,657 INFO L290 TraceCheckUtils]: 222: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,658 INFO L290 TraceCheckUtils]: 223: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,658 INFO L290 TraceCheckUtils]: 224: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,658 INFO L290 TraceCheckUtils]: 225: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,659 INFO L290 TraceCheckUtils]: 226: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,659 INFO L290 TraceCheckUtils]: 227: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,659 INFO L290 TraceCheckUtils]: 228: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,660 INFO L290 TraceCheckUtils]: 229: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,660 INFO L290 TraceCheckUtils]: 230: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,660 INFO L290 TraceCheckUtils]: 231: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,661 INFO L290 TraceCheckUtils]: 232: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,661 INFO L290 TraceCheckUtils]: 233: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,661 INFO L290 TraceCheckUtils]: 234: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,662 INFO L290 TraceCheckUtils]: 235: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,662 INFO L290 TraceCheckUtils]: 236: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,662 INFO L290 TraceCheckUtils]: 237: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,663 INFO L290 TraceCheckUtils]: 238: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,663 INFO L290 TraceCheckUtils]: 239: Hoare triple {36240#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,663 INFO L290 TraceCheckUtils]: 240: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,664 INFO L290 TraceCheckUtils]: 241: Hoare triple {36241#(< 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; {36241#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-15 12:30:09,664 INFO L290 TraceCheckUtils]: 242: Hoare triple {36241#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,664 INFO L290 TraceCheckUtils]: 243: Hoare triple {36240#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,665 INFO L290 TraceCheckUtils]: 244: Hoare triple {36240#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,665 INFO L290 TraceCheckUtils]: 245: Hoare triple {36240#(< 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; {36240#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-15 12:30:09,665 INFO L290 TraceCheckUtils]: 246: Hoare triple {36240#(< 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; {36242#(not (= main_~__VERIFIER_assert__cond~133 0))} is VALID [2022-04-15 12:30:09,666 INFO L290 TraceCheckUtils]: 247: Hoare triple {36242#(not (= main_~__VERIFIER_assert__cond~133 0))} assume 0 == ~__VERIFIER_assert__cond~133; {36234#false} is VALID [2022-04-15 12:30:09,666 INFO L290 TraceCheckUtils]: 248: Hoare triple {36234#false} assume !false; {36234#false} is VALID [2022-04-15 12:30:09,666 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-15 12:30:09,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:09,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319400056] [2022-04-15 12:30:09,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319400056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:09,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:09,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:30:09,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:09,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [753621349] [2022-04-15 12:30:09,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [753621349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:09,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:09,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:30:09,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400809299] [2022-04-15 12:30:09,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:09,668 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-15 12:30:09,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:09,668 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-15 12:30:09,822 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-15 12:30:09,822 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:30:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:09,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:30:09,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:30:09,823 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-15 12:30:11,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:11,587 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2022-04-15 12:30:11,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:30:11,587 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-15 12:30:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:11,588 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-15 12:30:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 254 transitions. [2022-04-15 12:30:11,589 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-15 12:30:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 254 transitions. [2022-04-15 12:30:11,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 254 transitions. [2022-04-15 12:30:11,792 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-15 12:30:11,792 INFO L225 Difference]: With dead ends: 254 [2022-04-15 12:30:11,792 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 12:30:11,793 INFO L912 BasicCegarLoop]: 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-15 12:30:11,793 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 590 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:11,793 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 31 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:30:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 12:30:11,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 12:30:11,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:11,794 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-15 12:30:11,794 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-15 12:30:11,794 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-15 12:30:11,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:11,794 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:30:11,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:30:11,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:11,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:11,795 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-15 12:30:11,795 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-15 12:30:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:11,795 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:30:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:30:11,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:11,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:11,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:11,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:11,795 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-15 12:30:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 12:30:11,795 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2022-04-15 12:30:11,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:11,795 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 12:30:11,796 INFO L479 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-15 12:30:11,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 12:30:11,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:11,796 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:30:11,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:11,798 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-04-15 12:30:11,799 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-04-15 12:30:11,799 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-04-15 12:30:11,799 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-04-15 12:30:11,799 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-04-15 12:30:11,799 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-04-15 12:30:11,799 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-04-15 12:30:11,800 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-04-15 12:30:11,800 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-04-15 12:30:11,800 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-04-15 12:30:11,800 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-04-15 12:30:11,811 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-04-15 12:30:11,811 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-04-15 12:30:11,811 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-04-15 12:30:11,812 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-04-15 12:30:11,812 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-04-15 12:30:11,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 12:30:11,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 12:30:21,810 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-15 12:30:21,811 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-15 12:30:21,811 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-15 12:30:21,811 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-15 12:30:21,811 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-15 12:30:21,811 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-15 12:30:21,811 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-15 12:30:21,811 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 16 3008) the Hoare annotation is: true [2022-04-15 12:30:21,811 INFO L878 garLoopResultBuilder]: At program point L1555(lines 1555 2805) the Hoare annotation is: (and (<= 32 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,811 INFO L878 garLoopResultBuilder]: At program point L2546(lines 2546 2653) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 58 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,811 INFO L878 garLoopResultBuilder]: At program point L2480(lines 2480 2663) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 56 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,811 INFO L878 garLoopResultBuilder]: At program point L432(lines 432 2978) 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) (<= 4 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,811 INFO L878 garLoopResultBuilder]: At program point L697(lines 697 2937) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 10 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,811 INFO L878 garLoopResultBuilder]: At program point L1688(lines 1688 2785) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 36 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,812 INFO L878 garLoopResultBuilder]: At program point L1622(lines 1622 2795) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 34 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,812 INFO L878 garLoopResultBuilder]: At program point L103(lines 103 125) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (<= 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-15 12:30:21,812 INFO L878 garLoopResultBuilder]: At program point L1953(lines 1953 2744) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 43 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,812 INFO L878 garLoopResultBuilder]: At program point L830(lines 830 2917) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 14 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,812 INFO L878 garLoopResultBuilder]: At program point L764(lines 764 2927) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 12 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,812 INFO L878 garLoopResultBuilder]: At program point L2614(lines 2614 2643) the Hoare annotation is: (and (<= 59 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~133 0)) (not (= main_~__VERIFIER_assert__cond~132 0))) [2022-04-15 12:30:21,812 INFO L878 garLoopResultBuilder]: At program point L2218(lines 2218 2703) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 49 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,812 INFO L878 garLoopResultBuilder]: At program point L1095(lines 1095 2876) 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) (<= 21 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,812 INFO L878 garLoopResultBuilder]: At program point L1360(lines 1360 2835) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 27 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,812 INFO L878 garLoopResultBuilder]: At program point L2351(lines 2351 2683) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 53 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,812 INFO L878 garLoopResultBuilder]: At program point L2285(lines 2285 2693) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 51 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,812 INFO L878 garLoopResultBuilder]: At program point L171(lines 171 193) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 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-15 12:30:21,813 INFO L878 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 173) the Hoare annotation is: false [2022-04-15 12:30:21,813 INFO L878 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: false [2022-04-15 12:30:21,813 INFO L878 garLoopResultBuilder]: At program point L2616(line 2616) the Hoare annotation is: false [2022-04-15 12:30:21,813 INFO L878 garLoopResultBuilder]: At program point L502(lines 502 2967) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 5 main_~main__t~0)) [2022-04-15 12:30:21,813 INFO L878 garLoopResultBuilder]: At program point L1493(lines 1493 2815) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 31 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,813 INFO L878 garLoopResultBuilder]: At program point L1427(lines 1427 2825) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 29 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,813 INFO L878 garLoopResultBuilder]: At program point L1758(lines 1758 2774) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 38 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,813 INFO L878 garLoopResultBuilder]: At program point L635(lines 635 2947) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,813 INFO L878 garLoopResultBuilder]: At program point L569(lines 569 2957) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,813 INFO L878 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: false [2022-04-15 12:30:21,813 INFO L878 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 207) the Hoare annotation is: false [2022-04-15 12:30:21,813 INFO L878 garLoopResultBuilder]: At program point L2023(lines 2023 2733) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 44 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,813 INFO L878 garLoopResultBuilder]: At program point L900(lines 900 2906) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 16 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,813 INFO L878 garLoopResultBuilder]: At program point L1165(lines 1165 2865) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 22 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,814 INFO L878 garLoopResultBuilder]: At program point L2156(lines 2156 2713) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 48 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,814 INFO L878 garLoopResultBuilder]: At program point L2090(lines 2090 2723) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 46 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,814 INFO L878 garLoopResultBuilder]: At program point L2421(lines 2421 2672) the Hoare annotation is: (and (<= 55 main_~main__t~0) (= |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) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,814 INFO L878 garLoopResultBuilder]: At program point L307(lines 307 2997) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,814 INFO L878 garLoopResultBuilder]: At program point L1298(lines 1298 2845) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 26 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,814 INFO L878 garLoopResultBuilder]: At program point L1232(lines 1232 2855) the Hoare annotation is: (and (<= 24 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,814 INFO L878 garLoopResultBuilder]: At program point L1563(lines 1563 2804) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 33 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,814 INFO L878 garLoopResultBuilder]: At program point L440(lines 440 2977) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 4 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,814 INFO L878 garLoopResultBuilder]: At program point L374(lines 374 2987) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 2 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,814 INFO L878 garLoopResultBuilder]: At program point L1828(lines 1828 2763) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 39 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,814 INFO L878 garLoopResultBuilder]: At program point L705(lines 705 2936) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 11 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,814 INFO L878 garLoopResultBuilder]: At program point L45(lines 45 55) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (<= 0 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-15 12:30:21,814 INFO L878 garLoopResultBuilder]: At program point L970(lines 970 2895) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 17 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,814 INFO L878 garLoopResultBuilder]: At program point L1961(lines 1961 2743) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 43 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,815 INFO L878 garLoopResultBuilder]: At program point L1895(lines 1895 2753) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 41 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,815 INFO L878 garLoopResultBuilder]: At program point L2226(lines 2226 2702) the Hoare annotation is: (and (<= 50 main_~main__t~0) (= |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) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,815 INFO L878 garLoopResultBuilder]: At program point L1103(lines 1103 2875) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 21 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,815 INFO L878 garLoopResultBuilder]: At program point L1037(lines 1037 2885) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 19 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,815 INFO L878 garLoopResultBuilder]: At program point L2623(lines 2623 2642) the Hoare annotation is: (and (<= 59 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~133 0)) (not (= main_~__VERIFIER_assert__cond~132 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-15 12:30:21,815 INFO L878 garLoopResultBuilder]: At program point L2491(lines 2491 2661) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 56 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,815 INFO L878 garLoopResultBuilder]: At program point L1368(lines 1368 2834) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 28 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,815 INFO L878 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: false [2022-04-15 12:30:21,815 INFO L878 garLoopResultBuilder]: At program point L1633(lines 1633 2793) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 34 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,815 INFO L878 garLoopResultBuilder]: At program point L2558(lines 2558 2651) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 58 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,815 INFO L878 garLoopResultBuilder]: At program point L510(lines 510 2966) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 6 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,815 INFO L878 garLoopResultBuilder]: At program point L246(lines 246 281) 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-15 12:30:21,815 INFO L878 garLoopResultBuilder]: At program point L775(lines 775 2925) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 12 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,815 INFO L878 garLoopResultBuilder]: At program point L1766(lines 1766 2773) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 38 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,816 INFO L878 garLoopResultBuilder]: At program point L1700(lines 1700 2783) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 36 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,816 INFO L878 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-15 12:30:21,816 INFO L878 garLoopResultBuilder]: At program point L115(lines 115 123) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= 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-15 12:30:21,816 INFO L878 garLoopResultBuilder]: At program point L2031(lines 2031 2732) 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) (<= 45 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,816 INFO L878 garLoopResultBuilder]: At program point L908(lines 908 2905) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 16 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,816 INFO L878 garLoopResultBuilder]: At program point L842(lines 842 2915) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 14 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,816 INFO L878 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 47) the Hoare annotation is: false [2022-04-15 12:30:21,816 INFO L878 garLoopResultBuilder]: At program point L2296(lines 2296 2691) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 51 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,816 INFO L878 garLoopResultBuilder]: At program point L1173(lines 1173 2864) the Hoare annotation is: (and (<= 23 main_~main__t~0) (= |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) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,816 INFO L878 garLoopResultBuilder]: At program point L1438(lines 1438 2823) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 29 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,816 INFO L878 garLoopResultBuilder]: At program point L2429(lines 2429 2671) the Hoare annotation is: (and (<= 55 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,816 INFO L878 garLoopResultBuilder]: At program point L315(lines 315 2996) the Hoare annotation is: (and (<= main_~main__t~0 1) (= |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) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,816 INFO L878 garLoopResultBuilder]: At program point L2363(lines 2363 2681) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 53 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,816 INFO L878 garLoopResultBuilder]: At program point L183(lines 183 191) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 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-15 12:30:21,816 INFO L878 garLoopResultBuilder]: At program point L117(line 117) the Hoare annotation is: false [2022-04-15 12:30:21,817 INFO L878 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 255) the Hoare annotation is: false [2022-04-15 12:30:21,817 INFO L878 garLoopResultBuilder]: At program point L580(lines 580 2955) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,817 INFO L878 garLoopResultBuilder]: At program point L1571(lines 1571 2803) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 33 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,817 INFO L878 garLoopResultBuilder]: At program point L1505(lines 1505 2813) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 31 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,817 INFO L878 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) the Hoare annotation is: false [2022-04-15 12:30:21,817 INFO L878 garLoopResultBuilder]: At program point L1836(lines 1836 2762) 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) (<= 40 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,817 INFO L878 garLoopResultBuilder]: At program point L713(lines 713 2935) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 11 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,817 INFO L878 garLoopResultBuilder]: At program point L647(lines 647 2945) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,817 INFO L878 garLoopResultBuilder]: At program point L185(line 185) the Hoare annotation is: false [2022-04-15 12:30:21,817 INFO L878 garLoopResultBuilder]: At program point L2101(lines 2101 2721) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 46 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,817 INFO L878 garLoopResultBuilder]: At program point L978(lines 978 2894) 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) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 18 main_~main__t~0)) [2022-04-15 12:30:21,817 INFO L878 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 2604) the Hoare annotation is: false [2022-04-15 12:30:21,817 INFO L878 garLoopResultBuilder]: At program point L1243(lines 1243 2853) the Hoare annotation is: (and (<= 24 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,817 INFO L878 garLoopResultBuilder]: At program point L2234(lines 2234 2701) the Hoare annotation is: (and (<= 50 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,818 INFO L878 garLoopResultBuilder]: At program point L2168(lines 2168 2711) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 48 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,818 INFO L878 garLoopResultBuilder]: At program point L2631(lines 2631 2641) the Hoare annotation is: (and (<= 59 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~133 0)) (not (= main_~__VERIFIER_assert__cond~132 0))) [2022-04-15 12:30:21,818 INFO L878 garLoopResultBuilder]: At program point L2499(lines 2499 2660) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 57 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,818 INFO L878 garLoopResultBuilder]: At program point L385(lines 385 2985) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 2 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,818 INFO L878 garLoopResultBuilder]: At program point L1376(lines 1376 2833) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 28 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,818 INFO L878 garLoopResultBuilder]: At program point L1310(lines 1310 2843) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 26 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,818 INFO L878 garLoopResultBuilder]: At program point L253(lines 253 275) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~12 0))) (.cse1 (<= 1 main_~main__t~0)) (.cse2 (not (= main_~__VERIFIER_assert__cond~3 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) .cse0 (not (= main_~main__tagbuf_len~0 0)) .cse1 .cse2 .cse3) (and .cse0 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1 .cse2 .cse3))) [2022-04-15 12:30:21,818 INFO L878 garLoopResultBuilder]: At program point L1641(lines 1641 2792) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 35 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,818 INFO L878 garLoopResultBuilder]: At program point L518(lines 518 2965) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 6 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,818 INFO L878 garLoopResultBuilder]: At program point L452(lines 452 2975) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 4 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,818 INFO L878 garLoopResultBuilder]: At program point L1906(lines 1906 2751) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 41 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,818 INFO L878 garLoopResultBuilder]: At program point L783(lines 783 2924) 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) (<= 13 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,818 INFO L878 garLoopResultBuilder]: At program point L255(line 255) the Hoare annotation is: false [2022-04-15 12:30:21,818 INFO L878 garLoopResultBuilder]: At program point L1048(lines 1048 2883) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 19 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,818 INFO L878 garLoopResultBuilder]: At program point L2039(lines 2039 2731) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 45 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,819 INFO L878 garLoopResultBuilder]: At program point L1973(lines 1973 2741) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 43 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,819 INFO L878 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-15 12:30:21,819 INFO L878 garLoopResultBuilder]: At program point L2304(lines 2304 2690) 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) (<= 52 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,819 INFO L878 garLoopResultBuilder]: At program point L1181(lines 1181 2863) the Hoare annotation is: (and (<= 23 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,819 INFO L878 garLoopResultBuilder]: At program point L1115(lines 1115 2873) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 21 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,819 INFO L878 garLoopResultBuilder]: At program point L2569(lines 2569 2649) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 58 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,819 INFO L878 garLoopResultBuilder]: At program point L1446(lines 1446 2822) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 30 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,819 INFO L878 garLoopResultBuilder]: At program point L323(lines 323 2995) the Hoare annotation is: (and (<= main_~main__t~0 1) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 1 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,819 INFO L878 garLoopResultBuilder]: At program point L1711(lines 1711 2781) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 36 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,819 INFO L878 garLoopResultBuilder]: At program point L588(lines 588 2954) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 8 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,819 INFO L878 garLoopResultBuilder]: At program point L853(lines 853 2913) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 14 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,819 INFO L878 garLoopResultBuilder]: At program point L1844(lines 1844 2761) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 40 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,819 INFO L878 garLoopResultBuilder]: At program point L1778(lines 1778 2771) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 38 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,819 INFO L878 garLoopResultBuilder]: At program point L2109(lines 2109 2720) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 47 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,819 INFO L878 garLoopResultBuilder]: At program point L986(lines 986 2893) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 18 main_~main__t~0)) [2022-04-15 12:30:21,819 INFO L878 garLoopResultBuilder]: At program point L920(lines 920 2903) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 16 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,820 INFO L878 garLoopResultBuilder]: At program point L2374(lines 2374 2679) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 53 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,820 INFO L878 garLoopResultBuilder]: At program point L1251(lines 1251 2852) the Hoare annotation is: (and (<= 25 main_~main__t~0) (= |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) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,820 INFO L878 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 117) the Hoare annotation is: false [2022-04-15 12:30:21,820 INFO L878 garLoopResultBuilder]: At program point L1516(lines 1516 2811) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 31 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,820 INFO L878 garLoopResultBuilder]: At program point L2507(lines 2507 2659) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 57 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,820 INFO L878 garLoopResultBuilder]: At program point L393(lines 393 2984) 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) (<= 3 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,820 INFO L878 garLoopResultBuilder]: At program point L2441(lines 2441 2669) the Hoare annotation is: (and (<= 55 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,820 INFO L878 garLoopResultBuilder]: At program point L658(lines 658 2943) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,820 INFO L878 garLoopResultBuilder]: At program point L1649(lines 1649 2791) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 35 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,820 INFO L878 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-15 12:30:21,820 INFO L878 garLoopResultBuilder]: At program point L1583(lines 1583 2801) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 33 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,820 INFO L878 garLoopResultBuilder]: At program point L64(lines 64 3001) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,820 INFO L878 garLoopResultBuilder]: At program point L1914(lines 1914 2750) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 42 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,820 INFO L878 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 157) the Hoare annotation is: false [2022-04-15 12:30:21,821 INFO L878 garLoopResultBuilder]: At program point L791(lines 791 2923) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 13 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,821 INFO L878 garLoopResultBuilder]: At program point L725(lines 725 2933) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 11 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,821 INFO L878 garLoopResultBuilder]: At program point L2179(lines 2179 2709) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 48 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,821 INFO L878 garLoopResultBuilder]: At program point L1056(lines 1056 2882) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 20 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,821 INFO L878 garLoopResultBuilder]: At program point L1321(lines 1321 2841) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 26 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,821 INFO L878 garLoopResultBuilder]: At program point L2312(lines 2312 2689) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 52 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,821 INFO L878 garLoopResultBuilder]: At program point L2246(lines 2246 2699) the Hoare annotation is: (and (<= 50 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,821 INFO L878 garLoopResultBuilder]: At program point L132(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-15 12:30:21,821 INFO L878 garLoopResultBuilder]: At program point L2577(lines 2577 2648) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 59 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,821 INFO L878 garLoopResultBuilder]: At program point L463(lines 463 2973) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 4 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,821 INFO L878 garLoopResultBuilder]: At program point L1454(lines 1454 2821) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 30 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,821 INFO L878 garLoopResultBuilder]: At program point L1388(lines 1388 2831) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 28 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,821 INFO L878 garLoopResultBuilder]: At program point L265(lines 265 273) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~12 0))) (.cse2 (<= 1 main_~main__t~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~3 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse2 .cse3 .cse4) (and (<= main_~main__t~0 1) .cse0 (< 0 (+ main_~main__tagbuf_len~0 1)) .cse1 (not (= main_~main__tagbuf_len~0 0)) .cse2 .cse3 .cse4))) [2022-04-15 12:30:21,821 INFO L878 garLoopResultBuilder]: At program point L1719(lines 1719 2780) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 37 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,821 INFO L878 garLoopResultBuilder]: At program point L596(lines 596 2953) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 8 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,822 INFO L878 garLoopResultBuilder]: At program point L530(lines 530 2963) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 6 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,822 INFO L878 garLoopResultBuilder]: At program point L1984(lines 1984 2739) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 43 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,822 INFO L878 garLoopResultBuilder]: At program point L861(lines 861 2912) 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) (<= 15 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,822 INFO L878 garLoopResultBuilder]: At program point L267(line 267) the Hoare annotation is: false [2022-04-15 12:30:21,822 INFO L878 garLoopResultBuilder]: At program point L1126(lines 1126 2871) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 21 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,822 INFO L878 garLoopResultBuilder]: At program point L2117(lines 2117 2719) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 47 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,822 INFO L878 garLoopResultBuilder]: At program point L2051(lines 2051 2729) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 45 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,822 INFO L878 garLoopResultBuilder]: At program point L2382(lines 2382 2678) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 54 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,822 INFO L878 garLoopResultBuilder]: At program point L1259(lines 1259 2851) the Hoare annotation is: (and (<= 25 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,822 INFO L878 garLoopResultBuilder]: At program point L1193(lines 1193 2861) the Hoare annotation is: (and (<= 23 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,822 INFO L878 garLoopResultBuilder]: At program point L136(lines 136 240) 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-15 12:30:21,822 INFO L878 garLoopResultBuilder]: At program point L1524(lines 1524 2810) the Hoare annotation is: (and (<= 32 main_~main__t~0) (= |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) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,822 INFO L878 garLoopResultBuilder]: At program point L401(lines 401 2983) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 3 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,822 INFO L878 garLoopResultBuilder]: At program point L335(lines 335 2993) the Hoare annotation is: (and (<= main_~main__t~0 1) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 1 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,822 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 16 3008) the Hoare annotation is: true [2022-04-15 12:30:21,823 INFO L878 garLoopResultBuilder]: At program point L1789(lines 1789 2769) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 38 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,823 INFO L878 garLoopResultBuilder]: At program point L666(lines 666 2942) 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) (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 10 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,823 INFO L878 garLoopResultBuilder]: At program point L931(lines 931 2901) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 16 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,823 INFO L878 garLoopResultBuilder]: At program point L1922(lines 1922 2749) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 42 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,823 INFO L878 garLoopResultBuilder]: At program point L1856(lines 1856 2759) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 40 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,823 INFO L878 garLoopResultBuilder]: At program point L205(lines 205 229) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~10 0)) (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-15 12:30:21,823 INFO L878 garLoopResultBuilder]: At program point L2187(lines 2187 2708) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 49 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,823 INFO L878 garLoopResultBuilder]: At program point L1064(lines 1064 2881) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 20 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,823 INFO L878 garLoopResultBuilder]: At program point L998(lines 998 2891) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 18 main_~main__t~0)) [2022-04-15 12:30:21,823 INFO L878 garLoopResultBuilder]: At program point L2452(lines 2452 2667) the Hoare annotation is: (and (<= 55 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,823 INFO L878 garLoopResultBuilder]: At program point L1329(lines 1329 2840) 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) (<= 27 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,824 INFO L878 garLoopResultBuilder]: At program point L74(lines 74 286) the Hoare annotation is: (let ((.cse0 (< main_~main__t~0 main_~main__tagbuf_len~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 (= main_~main__t~0 0) .cse1) (and .cse0 (<= 1 main_~main__t~0) .cse1))) [2022-04-15 12:30:21,824 INFO L878 garLoopResultBuilder]: At program point L1594(lines 1594 2799) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 33 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,824 INFO L878 garLoopResultBuilder]: At program point L2585(lines 2585 2647) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 59 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,824 INFO L878 garLoopResultBuilder]: At program point L471(lines 471 2972) 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) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 5 main_~main__t~0)) [2022-04-15 12:30:21,824 INFO L878 garLoopResultBuilder]: At program point L2519(lines 2519 2657) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 57 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,824 INFO L878 garLoopResultBuilder]: At program point L207(line 207) the Hoare annotation is: false [2022-04-15 12:30:21,824 INFO L878 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 185) the Hoare annotation is: false [2022-04-15 12:30:21,824 INFO L878 garLoopResultBuilder]: At program point L736(lines 736 2931) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 11 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,824 INFO L878 garLoopResultBuilder]: At program point L1727(lines 1727 2779) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 37 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,824 INFO L878 garLoopResultBuilder]: At program point L1661(lines 1661 2789) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 35 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,824 INFO L878 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: false [2022-04-15 12:30:21,824 INFO L878 garLoopResultBuilder]: At program point L1992(lines 1992 2738) 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) (<= 44 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,824 INFO L878 garLoopResultBuilder]: At program point L869(lines 869 2911) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 15 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,824 INFO L878 garLoopResultBuilder]: At program point L803(lines 803 2921) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 13 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,824 INFO L878 garLoopResultBuilder]: At program point L2257(lines 2257 2697) the Hoare annotation is: (and (<= 50 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,825 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 234) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-15 12:30:21,825 INFO L878 garLoopResultBuilder]: At program point L1134(lines 1134 2870) 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) (<= 22 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,825 INFO L878 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 219) the Hoare annotation is: false [2022-04-15 12:30:21,825 INFO L878 garLoopResultBuilder]: At program point L1399(lines 1399 2829) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 28 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,825 INFO L878 garLoopResultBuilder]: At program point L2390(lines 2390 2677) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 54 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,825 INFO L878 garLoopResultBuilder]: At program point L2324(lines 2324 2687) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 52 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,825 INFO L878 garLoopResultBuilder]: At program point L541(lines 541 2961) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 6 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,825 INFO L878 garLoopResultBuilder]: At program point L1532(lines 1532 2809) the Hoare annotation is: (and (<= 32 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,825 INFO L878 garLoopResultBuilder]: At program point L1466(lines 1466 2819) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 30 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,825 INFO L878 garLoopResultBuilder]: At program point L145(line 145) the Hoare annotation is: false [2022-04-15 12:30:21,825 INFO L878 garLoopResultBuilder]: At program point L1797(lines 1797 2768) 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) (<= 39 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,825 INFO L878 garLoopResultBuilder]: At program point L674(lines 674 2941) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 10 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,826 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) the Hoare annotation is: false [2022-04-15 12:30:21,826 INFO L878 garLoopResultBuilder]: At program point L608(lines 608 2951) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 8 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,826 INFO L878 garLoopResultBuilder]: At program point L2062(lines 2062 2727) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 45 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,826 INFO L878 garLoopResultBuilder]: At program point L939(lines 939 2900) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 17 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,826 INFO L878 garLoopResultBuilder]: At program point L1204(lines 1204 2859) the Hoare annotation is: (and (<= 23 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,826 INFO L878 garLoopResultBuilder]: At program point L2195(lines 2195 2707) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 49 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,826 INFO L878 garLoopResultBuilder]: At program point L2129(lines 2129 2717) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 47 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,826 INFO L878 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) the Hoare annotation is: false [2022-04-15 12:30:21,827 INFO L878 garLoopResultBuilder]: At program point L2460(lines 2460 2666) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 56 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,827 INFO L878 garLoopResultBuilder]: At program point L346(lines 346 2991) the Hoare annotation is: (and (<= main_~main__t~0 1) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 1 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,827 INFO L878 garLoopResultBuilder]: At program point L1337(lines 1337 2839) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 27 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,827 INFO L878 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-15 12:30:21,827 INFO L878 garLoopResultBuilder]: At program point L1271(lines 1271 2849) the Hoare annotation is: (and (<= 25 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,827 INFO L878 garLoopResultBuilder]: At program point L1602(lines 1602 2798) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 34 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,827 INFO L878 garLoopResultBuilder]: At program point L479(lines 479 2971) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 5 main_~main__t~0)) [2022-04-15 12:30:21,827 INFO L878 garLoopResultBuilder]: At program point L413(lines 413 2981) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 3 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,827 INFO L878 garLoopResultBuilder]: At program point L1867(lines 1867 2757) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 40 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,827 INFO L878 garLoopResultBuilder]: At program point L744(lines 744 2930) 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) (<= 12 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,828 INFO L878 garLoopResultBuilder]: At program point L1009(lines 1009 2889) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 18 main_~main__t~0)) [2022-04-15 12:30:21,828 INFO L878 garLoopResultBuilder]: At program point L2000(lines 2000 2737) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 44 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,828 INFO L878 garLoopResultBuilder]: At program point L1934(lines 1934 2747) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 42 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,828 INFO L878 garLoopResultBuilder]: At program point L217(lines 217 227) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~10 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (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-15 12:30:21,828 INFO L878 garLoopResultBuilder]: At program point L2265(lines 2265 2696) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 51 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,828 INFO L878 garLoopResultBuilder]: At program point L1142(lines 1142 2869) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 22 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,828 INFO L878 garLoopResultBuilder]: At program point L1076(lines 1076 2879) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 20 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,828 INFO L878 garLoopResultBuilder]: At program point L2530(lines 2530 2655) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 57 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,828 INFO L878 garLoopResultBuilder]: At program point L1407(lines 1407 2828) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 29 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,828 INFO L878 garLoopResultBuilder]: At program point L86(lines 86 284) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~3 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0) .cse0 .cse1) (and (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)) .cse0 .cse1 (<= main_~main__t~0 main_~main__tagbuf_len~0)))) [2022-04-15 12:30:21,828 INFO L878 garLoopResultBuilder]: At program point L1672(lines 1672 2787) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 35 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,828 INFO L878 garLoopResultBuilder]: At program point L549(lines 549 2960) 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) (<= 7 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,828 INFO L878 garLoopResultBuilder]: At program point L219(line 219) the Hoare annotation is: false [2022-04-15 12:30:21,828 INFO L878 garLoopResultBuilder]: At program point L21(lines 21 3007) 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-15 12:30:21,828 INFO L878 garLoopResultBuilder]: At program point L814(lines 814 2919) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 13 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,829 INFO L878 garLoopResultBuilder]: At program point L1805(lines 1805 2767) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 39 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,829 INFO L878 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 267) the Hoare annotation is: false [2022-04-15 12:30:21,829 INFO L878 garLoopResultBuilder]: At program point L1739(lines 1739 2777) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 37 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,829 INFO L878 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: false [2022-04-15 12:30:21,829 INFO L878 garLoopResultBuilder]: At program point L2070(lines 2070 2726) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 46 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,829 INFO L878 garLoopResultBuilder]: At program point L947(lines 947 2899) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 17 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,829 INFO L878 garLoopResultBuilder]: At program point L881(lines 881 2909) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 15 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,829 INFO L878 garLoopResultBuilder]: At program point L2335(lines 2335 2685) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 52 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,829 INFO L878 garLoopResultBuilder]: At program point L1212(lines 1212 2858) the Hoare annotation is: (and (<= 24 main_~main__t~0) (= |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) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,829 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 232) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~7 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-15 12:30:21,829 INFO L878 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 2616) the Hoare annotation is: false [2022-04-15 12:30:21,830 INFO L878 garLoopResultBuilder]: At program point L1477(lines 1477 2817) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 30 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,831 INFO L878 garLoopResultBuilder]: At program point L2468(lines 2468 2665) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 56 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,831 INFO L878 garLoopResultBuilder]: At program point L2402(lines 2402 2675) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 54 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,831 INFO L878 garLoopResultBuilder]: At program point L354(lines 354 2990) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 2 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,831 INFO L878 garLoopResultBuilder]: At program point L619(lines 619 2949) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 8 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,831 INFO L878 garLoopResultBuilder]: At program point L1610(lines 1610 2797) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 34 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,831 INFO L878 garLoopResultBuilder]: At program point L1544(lines 1544 2807) the Hoare annotation is: (and (<= 32 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,831 INFO L878 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: false [2022-04-15 12:30:21,831 INFO L878 garLoopResultBuilder]: At program point L25(lines 25 3002) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= main_~main__t~0 0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,831 INFO L878 garLoopResultBuilder]: At program point L1875(lines 1875 2756) 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) (<= 41 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,832 INFO L878 garLoopResultBuilder]: At program point L752(lines 752 2929) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 12 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,832 INFO L878 garLoopResultBuilder]: At program point L686(lines 686 2939) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 10 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,832 INFO L878 garLoopResultBuilder]: At program point L2602(lines 2602 2645) the Hoare annotation is: (and (<= 59 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~132 0))) [2022-04-15 12:30:21,832 INFO L878 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2022-04-15 12:30:21,832 INFO L878 garLoopResultBuilder]: At program point L2140(lines 2140 2715) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 47 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,832 INFO L878 garLoopResultBuilder]: At program point L1017(lines 1017 2888) 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) (<= 19 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,832 INFO L878 garLoopResultBuilder]: At program point L1282(lines 1282 2847) the Hoare annotation is: (and (<= 25 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,832 INFO L878 garLoopResultBuilder]: At program point L2273(lines 2273 2695) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 51 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,832 INFO L878 garLoopResultBuilder]: At program point L2207(lines 2207 2705) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 49 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,832 INFO L878 garLoopResultBuilder]: At program point L2604(line 2604) the Hoare annotation is: false [2022-04-15 12:30:21,832 INFO L878 garLoopResultBuilder]: At program point L2538(lines 2538 2654) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 58 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,832 INFO L878 garLoopResultBuilder]: At program point L424(lines 424 2979) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 3 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,832 INFO L878 garLoopResultBuilder]: At program point L1415(lines 1415 2827) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 29 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,832 INFO L878 garLoopResultBuilder]: At program point L1349(lines 1349 2837) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 27 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,832 INFO L878 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-15 12:30:21,833 INFO L878 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 145) the Hoare annotation is: false [2022-04-15 12:30:21,833 INFO L878 garLoopResultBuilder]: At program point L1680(lines 1680 2786) 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) (<= 36 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,833 INFO L878 garLoopResultBuilder]: At program point L557(lines 557 2959) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,833 INFO L878 garLoopResultBuilder]: At program point L491(lines 491 2969) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 5 main_~main__t~0)) [2022-04-15 12:30:21,833 INFO L878 garLoopResultBuilder]: At program point L1945(lines 1945 2745) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 42 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,833 INFO L878 garLoopResultBuilder]: At program point L822(lines 822 2918) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 14 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,833 INFO L878 garLoopResultBuilder]: At program point L1087(lines 1087 2877) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 20 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,833 INFO L878 garLoopResultBuilder]: At program point L2078(lines 2078 2725) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 46 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,833 INFO L878 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-15 12:30:21,833 INFO L878 garLoopResultBuilder]: At program point L2012(lines 2012 2735) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 44 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,833 INFO L878 garLoopResultBuilder]: At program point L2343(lines 2343 2684) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 53 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,833 INFO L878 garLoopResultBuilder]: At program point L1220(lines 1220 2857) the Hoare annotation is: (and (<= 24 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,833 INFO L878 garLoopResultBuilder]: At program point L1154(lines 1154 2867) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 22 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,833 INFO L878 garLoopResultBuilder]: At program point L1485(lines 1485 2816) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 31 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,833 INFO L878 garLoopResultBuilder]: At program point L362(lines 362 2989) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 2 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,833 INFO L878 garLoopResultBuilder]: At program point L296(lines 296 2999) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,834 INFO L878 garLoopResultBuilder]: At program point L164(lines 164 231) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 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-15 12:30:21,834 INFO L878 garLoopResultBuilder]: At program point L1750(lines 1750 2775) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 37 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,834 INFO L878 garLoopResultBuilder]: At program point L627(lines 627 2948) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 9 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,834 INFO L878 garLoopResultBuilder]: At program point L33(lines 33 57) the Hoare annotation is: (and (<= 0 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-15 12:30:21,834 INFO L878 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-15 12:30:21,834 INFO L878 garLoopResultBuilder]: At program point L892(lines 892 2907) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 15 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,834 INFO L878 garLoopResultBuilder]: At program point L1883(lines 1883 2755) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 41 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,834 INFO L878 garLoopResultBuilder]: At program point L1817(lines 1817 2765) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 39 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,834 INFO L878 garLoopResultBuilder]: At program point L2148(lines 2148 2714) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 48 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,834 INFO L878 garLoopResultBuilder]: At program point L1025(lines 1025 2887) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 19 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,834 INFO L878 garLoopResultBuilder]: At program point L959(lines 959 2897) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 17 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,834 INFO L878 garLoopResultBuilder]: At program point L2413(lines 2413 2673) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 54 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,834 INFO L878 garLoopResultBuilder]: At program point L1290(lines 1290 2846) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 26 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-15 12:30:21,834 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: false [2022-04-15 12:30:21,834 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:30:21,834 INFO L878 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-15 12:30:21,835 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:30:21,835 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:30:21,835 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 12:30:21,835 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 12:30:21,835 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:30:21,838 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 12:30:21,839 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:30:21,841 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:30:21,842 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 12:30:21,843 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 12:30:21,843 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 12:30:21,843 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 12:30:21,844 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-15 12:30:22,166 INFO L163 areAnnotationChecker]: CFG has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 12:30:22,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:30:22 BoogieIcfgContainer [2022-04-15 12:30:22,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:30:22,186 INFO L158 Benchmark]: Toolchain (without parser) took 77158.11ms. Allocated memory was 196.1MB in the beginning and 342.9MB in the end (delta: 146.8MB). Free memory was 144.8MB in the beginning and 185.8MB in the end (delta: -41.0MB). Peak memory consumption was 188.0MB. Max. memory is 8.0GB. [2022-04-15 12:30:22,186 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 196.1MB. Free memory was 162.6MB in the beginning and 162.5MB in the end (delta: 78.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:30:22,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.05ms. Allocated memory was 196.1MB in the beginning and 237.0MB in the end (delta: 40.9MB). Free memory was 144.5MB in the beginning and 177.1MB in the end (delta: -32.5MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. [2022-04-15 12:30:22,187 INFO L158 Benchmark]: Boogie Preprocessor took 96.98ms. Allocated memory is still 237.0MB. Free memory was 177.1MB in the beginning and 171.8MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-04-15 12:30:22,187 INFO L158 Benchmark]: RCFGBuilder took 1157.03ms. Allocated memory is still 237.0MB. Free memory was 171.8MB in the beginning and 138.5MB in the end (delta: 33.3MB). Peak memory consumption was 41.5MB. Max. memory is 8.0GB. [2022-04-15 12:30:22,187 INFO L158 Benchmark]: TraceAbstraction took 75362.33ms. Allocated memory was 237.0MB in the beginning and 342.9MB in the end (delta: 105.9MB). Free memory was 138.0MB in the beginning and 185.8MB in the end (delta: -47.8MB). Peak memory consumption was 139.4MB. Max. memory is 8.0GB. [2022-04-15 12:30:22,188 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 196.1MB. Free memory was 162.6MB in the beginning and 162.5MB in the end (delta: 78.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 537.05ms. Allocated memory was 196.1MB in the beginning and 237.0MB in the end (delta: 40.9MB). Free memory was 144.5MB in the beginning and 177.1MB in the end (delta: -32.5MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 96.98ms. Allocated memory is still 237.0MB. Free memory was 177.1MB in the beginning and 171.8MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1157.03ms. Allocated memory is still 237.0MB. Free memory was 171.8MB in the beginning and 138.5MB in the end (delta: 33.3MB). Peak memory consumption was 41.5MB. Max. memory is 8.0GB. * TraceAbstraction took 75362.33ms. Allocated memory was 237.0MB in the beginning and 342.9MB in the end (delta: 105.9MB). Free memory was 138.0MB in the beginning and 185.8MB in the end (delta: -47.8MB). Peak memory consumption was 139.4MB. 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: 75.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 47.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10652 SdHoareTripleChecker+Valid, 14.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10652 mSDsluCounter, 5350 SdHoareTripleChecker+Invalid, 14.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1373 mSDsCounter, 2226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20351 IncrementalHoareTripleChecker+Invalid, 22577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2226 mSolverCounterUnsat, 3977 mSDtfsCounter, 20351 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: 6.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 161 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 309 LocationsWithAnnotation, 309 PreInvPairs, 335 NumberOfFragments, 5202 HoareAnnotationTreeSize, 309 FomulaSimplifications, 9124 FormulaSimplificationTreeSizeReduction, 5.2s HoareSimplificationTime, 309 FomulaSimplificationsInter, 51740 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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) - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 12:30:22,227 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...