/usr/bin/java -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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 20:57:01,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 20:57:01,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 20:57:01,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 20:57:01,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 20:57:01,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 20:57:01,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 20:57:01,573 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 20:57:01,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 20:57:01,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 20:57:01,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 20:57:01,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 20:57:01,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 20:57:01,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 20:57:01,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 20:57:01,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 20:57:01,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 20:57:01,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 20:57:01,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 20:57:01,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 20:57:01,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 20:57:01,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 20:57:01,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 20:57:01,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 20:57:01,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 20:57:01,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 20:57:01,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 20:57:01,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 20:57:01,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 20:57:01,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 20:57:01,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 20:57:01,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 20:57:01,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 20:57:01,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 20:57:01,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 20:57:01,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 20:57:01,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 20:57:01,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 20:57:01,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 20:57:01,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 20:57:01,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 20:57:01,603 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 20:57:01,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 20:57:01,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 20:57:01,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 20:57:01,617 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 20:57:01,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 20:57:01,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 20:57:01,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 20:57:01,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 20:57:01,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 20:57:01,617 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 20:57:01,618 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 20:57:01,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 20:57:01,618 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 20:57:01,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 20:57:01,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 20:57:01,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 20:57:01,618 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 20:57:01,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 20:57:01,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:57:01,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 20:57:01,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 20:57:01,619 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 20:57:01,619 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 20:57:01,619 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-01-31 20:57:01,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 20:57:01,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 20:57:01,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 20:57:01,854 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 20:57:01,854 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 20:57:01,855 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-01-31 20:57:01,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/820690a06/84c71656045542a08ef631172642a78b/FLAG488c3fd07 [2022-01-31 20:57:02,310 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 20:57:02,311 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2022-01-31 20:57:02,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/820690a06/84c71656045542a08ef631172642a78b/FLAG488c3fd07 [2022-01-31 20:57:02,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/820690a06/84c71656045542a08ef631172642a78b [2022-01-31 20:57:02,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 20:57:02,329 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 20:57:02,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 20:57:02,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 20:57:02,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 20:57:02,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:57:02" (1/1) ... [2022-01-31 20:57:02,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab727b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:02, skipping insertion in model container [2022-01-31 20:57:02,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:57:02" (1/1) ... [2022-01-31 20:57:02,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 20:57:02,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 20:57:02,592 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-01-31 20:57:02,598 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-01-31 20:57:02,600 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-01-31 20:57:02,600 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-01-31 20:57:02,602 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-01-31 20:57:02,602 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-01-31 20:57:02,604 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-01-31 20:57:02,605 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-01-31 20:57:02,606 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-01-31 20:57:02,609 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-01-31 20:57:02,610 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-01-31 20:57:02,610 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-01-31 20:57:02,612 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-01-31 20:57:02,613 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-01-31 20:57:02,784 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-01-31 20:57:02,788 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-01-31 20:57:02,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:57:02,816 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 20:57:02,835 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-01-31 20:57:02,836 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-01-31 20:57:02,837 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-01-31 20:57:02,837 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-01-31 20:57:02,838 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-01-31 20:57:02,839 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-01-31 20:57:02,840 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-01-31 20:57:02,840 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-01-31 20:57:02,841 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-01-31 20:57:02,842 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-01-31 20:57:02,842 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-01-31 20:57:02,843 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-01-31 20:57:02,844 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-01-31 20:57:02,845 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-01-31 20:57:02,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47686,47699] [2022-01-31 20:57:02,962 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-01-31 20:57:02,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:57:02,983 INFO L208 MainTranslator]: Completed translation [2022-01-31 20:57:02,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:02 WrapperNode [2022-01-31 20:57:02,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 20:57:02,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 20:57:02,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 20:57:02,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 20:57:02,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:02" (1/1) ... [2022-01-31 20:57:02,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:02" (1/1) ... [2022-01-31 20:57:03,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:02" (1/1) ... [2022-01-31 20:57:03,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:02" (1/1) ... [2022-01-31 20:57:03,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:02" (1/1) ... [2022-01-31 20:57:03,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:02" (1/1) ... [2022-01-31 20:57:03,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:02" (1/1) ... [2022-01-31 20:57:03,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 20:57:03,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 20:57:03,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 20:57:03,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 20:57:03,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:02" (1/1) ... [2022-01-31 20:57:03,094 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:57:03,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 20:57:03,128 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-01-31 20:57:03,154 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-01-31 20:57:03,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 20:57:03,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 20:57:03,165 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 20:57:03,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 20:57:03,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 20:57:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 20:57:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 20:57:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 20:57:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 20:57:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 20:57:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 20:57:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 20:57:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 20:57:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 20:57:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 20:57:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 20:57:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 20:57:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 20:57:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 20:57:03,342 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 20:57:03,353 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 20:57:03,998 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 20:57:04,011 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 20:57:04,011 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-31 20:57:04,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:57:04 BoogieIcfgContainer [2022-01-31 20:57:04,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 20:57:04,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 20:57:04,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 20:57:04,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 20:57:04,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:57:02" (1/3) ... [2022-01-31 20:57:04,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab6f5f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:57:04, skipping insertion in model container [2022-01-31 20:57:04,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:02" (2/3) ... [2022-01-31 20:57:04,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab6f5f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:57:04, skipping insertion in model container [2022-01-31 20:57:04,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:57:04" (3/3) ... [2022-01-31 20:57:04,021 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2022-01-31 20:57:04,024 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 20:57:04,024 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-01-31 20:57:04,057 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 20:57:04,064 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, 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, mLoopAccelerationTechnique=JORDAN [2022-01-31 20:57:04,065 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-01-31 20:57:04,090 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-01-31 20:57:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-31 20:57:04,104 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:04,105 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:04,105 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:04,109 INFO L85 PathProgramCache]: Analyzing trace with hash -191009829, now seen corresponding path program 1 times [2022-01-31 20:57:04,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:04,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [967460359] [2022-01-31 20:57:04,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:04,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:04,157 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:04,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:04,323 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:04,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [967460359] [2022-01-31 20:57:04,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [967460359] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:04,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:04,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 20:57:04,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001577877] [2022-01-31 20:57:04,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:04,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 20:57:04,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:04,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 20:57:04,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 20:57:04,355 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-01-31 20:57:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:05,193 INFO L93 Difference]: Finished difference Result 327 states and 589 transitions. [2022-01-31 20:57:05,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 20:57:05,195 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-01-31 20:57:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:05,202 INFO L225 Difference]: With dead ends: 327 [2022-01-31 20:57:05,203 INFO L226 Difference]: Without dead ends: 307 [2022-01-31 20:57:05,205 INFO L932 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-01-31 20:57:05,207 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 862 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:05,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [862 Valid, 179 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 20:57:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-01-31 20:57:05,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 302. [2022-01-31 20:57:05,259 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-01-31 20:57:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2022-01-31 20:57:05,262 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 11 [2022-01-31 20:57:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:05,262 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2022-01-31 20:57:05,262 INFO L471 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-01-31 20:57:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2022-01-31 20:57:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-31 20:57:05,263 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:05,263 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:05,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 20:57:05,263 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:05,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:05,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1626334337, now seen corresponding path program 1 times [2022-01-31 20:57:05,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:05,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1553832302] [2022-01-31 20:57:05,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:05,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:05,266 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:05,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:05,331 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:05,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1553832302] [2022-01-31 20:57:05,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1553832302] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:05,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:05,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:57:05,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977849101] [2022-01-31 20:57:05,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:05,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:57:05,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:05,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:57:05,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 20:57:05,333 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-01-31 20:57:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:06,066 INFO L93 Difference]: Finished difference Result 312 states and 435 transitions. [2022-01-31 20:57:06,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 20:57:06,066 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-01-31 20:57:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:06,068 INFO L225 Difference]: With dead ends: 312 [2022-01-31 20:57:06,069 INFO L226 Difference]: Without dead ends: 304 [2022-01-31 20:57:06,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-31 20:57:06,070 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 325 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:06,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 531 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 20:57:06,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-01-31 20:57:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2022-01-31 20:57:06,094 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-01-31 20:57:06,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2022-01-31 20:57:06,112 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2022-01-31 20:57:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:06,112 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2022-01-31 20:57:06,112 INFO L471 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-01-31 20:57:06,112 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2022-01-31 20:57:06,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-31 20:57:06,112 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:06,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:06,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 20:57:06,113 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:06,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:06,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1610084340, now seen corresponding path program 1 times [2022-01-31 20:57:06,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:06,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [964703308] [2022-01-31 20:57:06,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:06,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:06,118 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:06,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:06,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:06,187 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:06,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [964703308] [2022-01-31 20:57:06,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [964703308] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:06,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:06,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 20:57:06,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007083841] [2022-01-31 20:57:06,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:06,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 20:57:06,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:06,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 20:57:06,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 20:57:06,188 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-01-31 20:57:06,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:06,618 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2022-01-31 20:57:06,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 20:57:06,619 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-01-31 20:57:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:06,628 INFO L225 Difference]: With dead ends: 297 [2022-01-31 20:57:06,629 INFO L226 Difference]: Without dead ends: 295 [2022-01-31 20:57:06,630 INFO L932 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-01-31 20:57:06,632 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 505 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:06,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 118 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 20:57:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-01-31 20:57:06,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-01-31 20:57:06,677 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-01-31 20:57:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2022-01-31 20:57:06,678 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 12 [2022-01-31 20:57:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:06,678 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2022-01-31 20:57:06,678 INFO L471 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-01-31 20:57:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2022-01-31 20:57:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-31 20:57:06,679 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:06,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:06,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 20:57:06,679 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:06,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:06,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1626996098, now seen corresponding path program 1 times [2022-01-31 20:57:06,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:06,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1299416910] [2022-01-31 20:57:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:06,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:06,682 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:06,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:06,722 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:06,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1299416910] [2022-01-31 20:57:06,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1299416910] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:06,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:06,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 20:57:06,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428076568] [2022-01-31 20:57:06,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:06,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 20:57:06,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:06,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 20:57:06,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 20:57:06,723 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-01-31 20:57:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:07,183 INFO L93 Difference]: Finished difference Result 300 states and 363 transitions. [2022-01-31 20:57:07,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 20:57:07,183 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-01-31 20:57:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:07,184 INFO L225 Difference]: With dead ends: 300 [2022-01-31 20:57:07,184 INFO L226 Difference]: Without dead ends: 298 [2022-01-31 20:57:07,185 INFO L932 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-01-31 20:57:07,185 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 279 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:07,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 406 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 20:57:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-01-31 20:57:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-01-31 20:57:07,199 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-01-31 20:57:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2022-01-31 20:57:07,200 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 13 [2022-01-31 20:57:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:07,200 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2022-01-31 20:57:07,200 INFO L471 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-01-31 20:57:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2022-01-31 20:57:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 20:57:07,201 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:07,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:07,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 20:57:07,201 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:07,202 INFO L85 PathProgramCache]: Analyzing trace with hash 175251398, now seen corresponding path program 1 times [2022-01-31 20:57:07,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:07,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1741491320] [2022-01-31 20:57:07,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:07,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:07,204 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:07,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:07,263 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:07,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1741491320] [2022-01-31 20:57:07,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1741491320] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:07,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:07,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:57:07,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180282851] [2022-01-31 20:57:07,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:07,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:57:07,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:07,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:57:07,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 20:57:07,265 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-01-31 20:57:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:07,826 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2022-01-31 20:57:07,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:57:07,826 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-01-31 20:57:07,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:07,827 INFO L225 Difference]: With dead ends: 298 [2022-01-31 20:57:07,827 INFO L226 Difference]: Without dead ends: 296 [2022-01-31 20:57:07,828 INFO L932 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-01-31 20:57:07,829 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 467 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:07,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 173 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 20:57:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-31 20:57:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-31 20:57:07,850 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-01-31 20:57:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2022-01-31 20:57:07,851 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 15 [2022-01-31 20:57:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:07,852 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2022-01-31 20:57:07,852 INFO L471 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-01-31 20:57:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2022-01-31 20:57:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 20:57:07,853 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:07,853 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:07,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 20:57:07,854 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:07,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:07,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1137829144, now seen corresponding path program 1 times [2022-01-31 20:57:07,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:07,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1939081199] [2022-01-31 20:57:07,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:07,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:07,857 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:07,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:07,920 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:07,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1939081199] [2022-01-31 20:57:07,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1939081199] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:07,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:07,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 20:57:07,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240980095] [2022-01-31 20:57:07,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:07,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 20:57:07,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:07,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 20:57:07,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 20:57:07,925 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-01-31 20:57:08,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:08,378 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2022-01-31 20:57:08,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 20:57:08,379 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-01-31 20:57:08,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:08,380 INFO L225 Difference]: With dead ends: 296 [2022-01-31 20:57:08,380 INFO L226 Difference]: Without dead ends: 292 [2022-01-31 20:57:08,380 INFO L932 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-01-31 20:57:08,382 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 250 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:08,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 425 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 20:57:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-01-31 20:57:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-01-31 20:57:08,401 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-01-31 20:57:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2022-01-31 20:57:08,402 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 16 [2022-01-31 20:57:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:08,403 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2022-01-31 20:57:08,403 INFO L471 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-01-31 20:57:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2022-01-31 20:57:08,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 20:57:08,403 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:08,403 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:08,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 20:57:08,404 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:08,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash 926233143, now seen corresponding path program 1 times [2022-01-31 20:57:08,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:08,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1326867812] [2022-01-31 20:57:08,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:08,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:08,412 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:08,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:08,473 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:08,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1326867812] [2022-01-31 20:57:08,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1326867812] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:08,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:08,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:57:08,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799434385] [2022-01-31 20:57:08,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:08,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:57:08,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:57:08,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 20:57:08,475 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-01-31 20:57:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:09,027 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-01-31 20:57:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:57:09,028 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-01-31 20:57:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:09,029 INFO L225 Difference]: With dead ends: 309 [2022-01-31 20:57:09,029 INFO L226 Difference]: Without dead ends: 307 [2022-01-31 20:57:09,029 INFO L932 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-01-31 20:57:09,030 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 483 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:09,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [483 Valid, 181 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 20:57:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-01-31 20:57:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 290. [2022-01-31 20:57:09,045 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-01-31 20:57:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 353 transitions. [2022-01-31 20:57:09,046 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 353 transitions. Word has length 17 [2022-01-31 20:57:09,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:09,046 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 353 transitions. [2022-01-31 20:57:09,048 INFO L471 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-01-31 20:57:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 353 transitions. [2022-01-31 20:57:09,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 20:57:09,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:09,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:09,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 20:57:09,056 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:09,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:09,056 INFO L85 PathProgramCache]: Analyzing trace with hash 927772343, now seen corresponding path program 1 times [2022-01-31 20:57:09,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:09,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1396988504] [2022-01-31 20:57:09,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:09,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:09,059 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:09,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:09,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:09,127 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:09,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1396988504] [2022-01-31 20:57:09,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1396988504] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:09,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:09,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:57:09,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152148687] [2022-01-31 20:57:09,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:09,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:57:09,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:09,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:57:09,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 20:57:09,128 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-01-31 20:57:09,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:09,737 INFO L93 Difference]: Finished difference Result 290 states and 353 transitions. [2022-01-31 20:57:09,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:57:09,737 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-01-31 20:57:09,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:09,738 INFO L225 Difference]: With dead ends: 290 [2022-01-31 20:57:09,739 INFO L226 Difference]: Without dead ends: 288 [2022-01-31 20:57:09,739 INFO L932 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-01-31 20:57:09,739 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 457 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.6s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:09,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 155 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 20:57:09,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-01-31 20:57:09,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-01-31 20:57:09,751 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-01-31 20:57:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2022-01-31 20:57:09,752 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 17 [2022-01-31 20:57:09,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:09,752 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2022-01-31 20:57:09,752 INFO L471 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-01-31 20:57:09,752 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-01-31 20:57:09,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 20:57:09,752 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:09,753 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:09,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 20:57:09,753 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:09,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1470973679, now seen corresponding path program 1 times [2022-01-31 20:57:09,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:09,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1511340034] [2022-01-31 20:57:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:09,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:09,755 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:09,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:09,836 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:09,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1511340034] [2022-01-31 20:57:09,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1511340034] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:09,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:09,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:57:09,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44066209] [2022-01-31 20:57:09,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:09,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:57:09,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:09,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:57:09,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:57:09,837 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-01-31 20:57:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:10,364 INFO L93 Difference]: Finished difference Result 312 states and 377 transitions. [2022-01-31 20:57:10,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 20:57:10,364 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-01-31 20:57:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:10,365 INFO L225 Difference]: With dead ends: 312 [2022-01-31 20:57:10,365 INFO L226 Difference]: Without dead ends: 310 [2022-01-31 20:57:10,366 INFO L932 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-01-31 20:57:10,366 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 317 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:10,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 404 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 20:57:10,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-01-31 20:57:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 288. [2022-01-31 20:57:10,394 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-01-31 20:57:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2022-01-31 20:57:10,395 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 17 [2022-01-31 20:57:10,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:10,395 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2022-01-31 20:57:10,395 INFO L471 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-01-31 20:57:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-01-31 20:57:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 20:57:10,397 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:10,397 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:10,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 20:57:10,398 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:10,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:10,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1350175097, now seen corresponding path program 1 times [2022-01-31 20:57:10,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:10,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1907593092] [2022-01-31 20:57:10,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:10,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:10,400 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:10,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:10,441 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:10,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1907593092] [2022-01-31 20:57:10,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1907593092] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:10,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:10,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:57:10,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714328641] [2022-01-31 20:57:10,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:10,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:57:10,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:10,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:57:10,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 20:57:10,442 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-01-31 20:57:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:10,984 INFO L93 Difference]: Finished difference Result 311 states and 376 transitions. [2022-01-31 20:57:10,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:57:10,985 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-01-31 20:57:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:10,986 INFO L225 Difference]: With dead ends: 311 [2022-01-31 20:57:10,986 INFO L226 Difference]: Without dead ends: 309 [2022-01-31 20:57:10,986 INFO L932 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-01-31 20:57:10,987 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 474 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:10,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [474 Valid, 173 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 20:57:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-01-31 20:57:11,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 286. [2022-01-31 20:57:11,015 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-01-31 20:57:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 349 transitions. [2022-01-31 20:57:11,016 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 349 transitions. Word has length 18 [2022-01-31 20:57:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:11,016 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 349 transitions. [2022-01-31 20:57:11,016 INFO L471 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-01-31 20:57:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 349 transitions. [2022-01-31 20:57:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 20:57:11,017 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:11,017 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:11,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 20:57:11,017 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:11,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:11,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1351540517, now seen corresponding path program 1 times [2022-01-31 20:57:11,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:11,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1680705541] [2022-01-31 20:57:11,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:11,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:11,019 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:11,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:11,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:11,091 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:11,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1680705541] [2022-01-31 20:57:11,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1680705541] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:11,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:11,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:57:11,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819130100] [2022-01-31 20:57:11,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:11,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:57:11,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:11,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:57:11,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:57:11,092 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-01-31 20:57:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:11,651 INFO L93 Difference]: Finished difference Result 320 states and 387 transitions. [2022-01-31 20:57:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 20:57:11,652 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-01-31 20:57:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:11,653 INFO L225 Difference]: With dead ends: 320 [2022-01-31 20:57:11,653 INFO L226 Difference]: Without dead ends: 318 [2022-01-31 20:57:11,654 INFO L932 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-01-31 20:57:11,654 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 288 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:11,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 438 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 20:57:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-01-31 20:57:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 294. [2022-01-31 20:57:11,669 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-01-31 20:57:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 359 transitions. [2022-01-31 20:57:11,670 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 359 transitions. Word has length 18 [2022-01-31 20:57:11,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:11,670 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 359 transitions. [2022-01-31 20:57:11,670 INFO L471 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-01-31 20:57:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 359 transitions. [2022-01-31 20:57:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 20:57:11,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:11,684 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:11,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 20:57:11,685 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:11,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1303825267, now seen corresponding path program 1 times [2022-01-31 20:57:11,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:11,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [972186623] [2022-01-31 20:57:11,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:11,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:11,688 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:11,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:11,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:11,774 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:11,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [972186623] [2022-01-31 20:57:11,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [972186623] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:11,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:11,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:57:11,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434297718] [2022-01-31 20:57:11,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:11,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:57:11,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:11,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:57:11,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:57:11,775 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-01-31 20:57:12,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:12,327 INFO L93 Difference]: Finished difference Result 304 states and 369 transitions. [2022-01-31 20:57:12,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:57:12,327 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-01-31 20:57:12,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:12,328 INFO L225 Difference]: With dead ends: 304 [2022-01-31 20:57:12,329 INFO L226 Difference]: Without dead ends: 300 [2022-01-31 20:57:12,329 INFO L932 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-01-31 20:57:12,329 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 266 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:12,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 415 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 20:57:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-01-31 20:57:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 295. [2022-01-31 20:57:12,343 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-01-31 20:57:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 360 transitions. [2022-01-31 20:57:12,344 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 360 transitions. Word has length 18 [2022-01-31 20:57:12,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:12,344 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 360 transitions. [2022-01-31 20:57:12,344 INFO L471 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-01-31 20:57:12,344 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 360 transitions. [2022-01-31 20:57:12,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 20:57:12,344 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:12,344 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:12,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 20:57:12,345 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:12,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:12,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1094248106, now seen corresponding path program 1 times [2022-01-31 20:57:12,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:12,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2011060115] [2022-01-31 20:57:12,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:12,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:12,346 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:12,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:12,421 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:12,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2011060115] [2022-01-31 20:57:12,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2011060115] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:12,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:12,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:57:12,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44148998] [2022-01-31 20:57:12,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:12,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:57:12,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:12,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:57:12,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:57:12,433 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-01-31 20:57:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:13,005 INFO L93 Difference]: Finished difference Result 321 states and 388 transitions. [2022-01-31 20:57:13,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 20:57:13,005 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-01-31 20:57:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:13,007 INFO L225 Difference]: With dead ends: 321 [2022-01-31 20:57:13,007 INFO L226 Difference]: Without dead ends: 319 [2022-01-31 20:57:13,007 INFO L932 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-01-31 20:57:13,007 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 281 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:13,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 466 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 20:57:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-01-31 20:57:13,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 298. [2022-01-31 20:57:13,021 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-01-31 20:57:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 363 transitions. [2022-01-31 20:57:13,022 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 363 transitions. Word has length 19 [2022-01-31 20:57:13,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:13,022 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 363 transitions. [2022-01-31 20:57:13,022 INFO L471 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-01-31 20:57:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 363 transitions. [2022-01-31 20:57:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 20:57:13,023 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:13,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:13,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 20:57:13,023 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:13,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:13,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1750216322, now seen corresponding path program 1 times [2022-01-31 20:57:13,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:13,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1791082979] [2022-01-31 20:57:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:13,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:13,025 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:13,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:13,052 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:13,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1791082979] [2022-01-31 20:57:13,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1791082979] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:13,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:13,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 20:57:13,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913642576] [2022-01-31 20:57:13,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:13,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 20:57:13,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:13,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 20:57:13,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 20:57:13,053 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-01-31 20:57:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:13,418 INFO L93 Difference]: Finished difference Result 298 states and 363 transitions. [2022-01-31 20:57:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 20:57:13,418 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-01-31 20:57:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:13,419 INFO L225 Difference]: With dead ends: 298 [2022-01-31 20:57:13,419 INFO L226 Difference]: Without dead ends: 296 [2022-01-31 20:57:13,420 INFO L932 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-01-31 20:57:13,420 INFO L933 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-01-31 20:57:13,420 INFO L934 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-01-31 20:57:13,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-31 20:57:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-31 20:57:13,436 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-01-31 20:57:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 361 transitions. [2022-01-31 20:57:13,437 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 361 transitions. Word has length 20 [2022-01-31 20:57:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:13,437 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 361 transitions. [2022-01-31 20:57:13,437 INFO L471 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-01-31 20:57:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 361 transitions. [2022-01-31 20:57:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 20:57:13,438 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:13,438 INFO L514 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-01-31 20:57:13,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 20:57:13,438 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:13,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:13,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1577872003, now seen corresponding path program 1 times [2022-01-31 20:57:13,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:13,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1963140182] [2022-01-31 20:57:13,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:13,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:13,440 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:13,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:13,470 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:13,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1963140182] [2022-01-31 20:57:13,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1963140182] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:13,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:13,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 20:57:13,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875783467] [2022-01-31 20:57:13,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:13,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 20:57:13,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:13,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 20:57:13,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 20:57:13,471 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-01-31 20:57:13,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:13,938 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2022-01-31 20:57:13,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 20:57:13,939 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-01-31 20:57:13,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:13,942 INFO L225 Difference]: With dead ends: 296 [2022-01-31 20:57:13,942 INFO L226 Difference]: Without dead ends: 292 [2022-01-31 20:57:13,944 INFO L932 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-01-31 20:57:13,945 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 245 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:13,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 397 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 20:57:13,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-01-31 20:57:13,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-01-31 20:57:13,973 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-01-31 20:57:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 357 transitions. [2022-01-31 20:57:13,974 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 357 transitions. Word has length 21 [2022-01-31 20:57:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:13,974 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 357 transitions. [2022-01-31 20:57:13,974 INFO L471 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-01-31 20:57:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2022-01-31 20:57:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 20:57:13,975 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:13,975 INFO L514 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-01-31 20:57:13,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 20:57:13,975 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash -383054022, now seen corresponding path program 1 times [2022-01-31 20:57:13,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:13,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2129825247] [2022-01-31 20:57:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:13,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:13,977 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:14,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:14,028 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:14,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2129825247] [2022-01-31 20:57:14,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2129825247] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:14,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:14,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:57:14,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878927056] [2022-01-31 20:57:14,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:14,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:57:14,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:14,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:57:14,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:57:14,029 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-01-31 20:57:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:14,448 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2022-01-31 20:57:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:57:14,448 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-01-31 20:57:14,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:14,449 INFO L225 Difference]: With dead ends: 292 [2022-01-31 20:57:14,449 INFO L226 Difference]: Without dead ends: 290 [2022-01-31 20:57:14,449 INFO L932 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-01-31 20:57:14,449 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 871 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:14,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [871 Valid, 107 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 20:57:14,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-01-31 20:57:14,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2022-01-31 20:57:14,466 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-01-31 20:57:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2022-01-31 20:57:14,467 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 21 [2022-01-31 20:57:14,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:14,468 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2022-01-31 20:57:14,468 INFO L471 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-01-31 20:57:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2022-01-31 20:57:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 20:57:14,468 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:14,469 INFO L514 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-01-31 20:57:14,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 20:57:14,470 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:14,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1682632114, now seen corresponding path program 1 times [2022-01-31 20:57:14,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:14,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1698199222] [2022-01-31 20:57:14,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:14,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:14,472 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:14,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:14,526 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:14,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1698199222] [2022-01-31 20:57:14,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1698199222] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:14,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:14,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:57:14,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963939541] [2022-01-31 20:57:14,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:14,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:57:14,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:14,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:57:14,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:57:14,528 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-01-31 20:57:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:15,065 INFO L93 Difference]: Finished difference Result 302 states and 369 transitions. [2022-01-31 20:57:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:57:15,065 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-01-31 20:57:15,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:15,067 INFO L225 Difference]: With dead ends: 302 [2022-01-31 20:57:15,067 INFO L226 Difference]: Without dead ends: 300 [2022-01-31 20:57:15,068 INFO L932 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-01-31 20:57:15,070 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 862 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:15,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [862 Valid, 121 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 20:57:15,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-01-31 20:57:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 282. [2022-01-31 20:57:15,102 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-01-31 20:57:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 347 transitions. [2022-01-31 20:57:15,103 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 347 transitions. Word has length 22 [2022-01-31 20:57:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:15,103 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 347 transitions. [2022-01-31 20:57:15,104 INFO L471 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-01-31 20:57:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 347 transitions. [2022-01-31 20:57:15,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 20:57:15,104 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:15,104 INFO L514 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-01-31 20:57:15,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 20:57:15,104 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:15,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:15,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1297761964, now seen corresponding path program 1 times [2022-01-31 20:57:15,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:15,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1845679997] [2022-01-31 20:57:15,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:15,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:15,106 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:15,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:15,164 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:15,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1845679997] [2022-01-31 20:57:15,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1845679997] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:15,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:15,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:57:15,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139264617] [2022-01-31 20:57:15,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:15,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:57:15,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:15,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:57:15,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:57:15,165 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-01-31 20:57:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:15,745 INFO L93 Difference]: Finished difference Result 294 states and 361 transitions. [2022-01-31 20:57:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:57:15,746 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-01-31 20:57:15,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:15,747 INFO L225 Difference]: With dead ends: 294 [2022-01-31 20:57:15,747 INFO L226 Difference]: Without dead ends: 292 [2022-01-31 20:57:15,748 INFO L932 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-01-31 20:57:15,748 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 655 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:15,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [655 Valid, 120 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 20:57:15,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-01-31 20:57:15,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 277. [2022-01-31 20:57:15,765 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-01-31 20:57:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 341 transitions. [2022-01-31 20:57:15,766 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 341 transitions. Word has length 22 [2022-01-31 20:57:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:15,766 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 341 transitions. [2022-01-31 20:57:15,766 INFO L471 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-01-31 20:57:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 341 transitions. [2022-01-31 20:57:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 20:57:15,766 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:15,767 INFO L514 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-01-31 20:57:15,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 20:57:15,767 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:15,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:15,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1345477214, now seen corresponding path program 1 times [2022-01-31 20:57:15,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:15,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1641212427] [2022-01-31 20:57:15,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:15,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:15,769 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:15,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:15,830 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:15,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1641212427] [2022-01-31 20:57:15,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1641212427] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:15,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:15,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:57:15,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561142502] [2022-01-31 20:57:15,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:15,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:57:15,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:15,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:57:15,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:57:15,831 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-01-31 20:57:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:16,388 INFO L93 Difference]: Finished difference Result 277 states and 341 transitions. [2022-01-31 20:57:16,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:57:16,388 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-01-31 20:57:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:16,389 INFO L225 Difference]: With dead ends: 277 [2022-01-31 20:57:16,389 INFO L226 Difference]: Without dead ends: 254 [2022-01-31 20:57:16,389 INFO L932 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-01-31 20:57:16,390 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 834 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:16,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [834 Valid, 105 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 20:57:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-01-31 20:57:16,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2022-01-31 20:57:16,404 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-01-31 20:57:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2022-01-31 20:57:16,404 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 22 [2022-01-31 20:57:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:16,419 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2022-01-31 20:57:16,419 INFO L471 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-01-31 20:57:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2022-01-31 20:57:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-01-31 20:57:16,422 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:16,423 INFO L514 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-01-31 20:57:16,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 20:57:16,424 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:16,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:16,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1242952801, now seen corresponding path program 1 times [2022-01-31 20:57:16,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:16,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [167554403] [2022-01-31 20:57:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:16,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:16,426 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:17,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:17,870 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:17,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [167554403] [2022-01-31 20:57:17,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [167554403] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:17,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:17,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-01-31 20:57:17,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450734676] [2022-01-31 20:57:17,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:17,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-01-31 20:57:17,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:17,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-01-31 20:57:17,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1836, Invalid=2196, Unknown=0, NotChecked=0, Total=4032 [2022-01-31 20:57:17,874 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-01-31 20:57:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:19,856 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2022-01-31 20:57:19,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-31 20:57:19,857 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-01-31 20:57:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:19,858 INFO L225 Difference]: With dead ends: 255 [2022-01-31 20:57:19,858 INFO L226 Difference]: Without dead ends: 253 [2022-01-31 20:57:19,862 INFO L932 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-01-31 20:57:19,862 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 740 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:19,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [740 Valid, 56 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 20:57:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-01-31 20:57:19,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2022-01-31 20:57:19,875 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-01-31 20:57:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2022-01-31 20:57:19,876 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2022-01-31 20:57:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:19,876 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2022-01-31 20:57:19,876 INFO L471 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-01-31 20:57:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2022-01-31 20:57:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-01-31 20:57:19,878 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:19,878 INFO L514 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-01-31 20:57:19,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 20:57:19,878 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 20:57:19,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:19,878 INFO L85 PathProgramCache]: Analyzing trace with hash 123173085, now seen corresponding path program 1 times [2022-01-31 20:57:19,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:19,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [302161998] [2022-01-31 20:57:19,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:19,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:19,880 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:20,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:20,070 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:20,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [302161998] [2022-01-31 20:57:20,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [302161998] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:20,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:20,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:57:20,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716128445] [2022-01-31 20:57:20,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:20,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:57:20,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:20,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:57:20,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:57:20,072 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 6 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-01-31 20:57:20,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:20,438 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2022-01-31 20:57:20,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:57:20,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 6 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-01-31 20:57:20,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:20,439 INFO L225 Difference]: With dead ends: 254 [2022-01-31 20:57:20,439 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 20:57:20,442 INFO L932 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-01-31 20:57:20,443 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 485 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 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.3s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:20,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 31 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 20:57:20,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 20:57:20,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 20:57:20,444 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-01-31 20:57:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 20:57:20,445 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2022-01-31 20:57:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:20,445 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 20:57:20,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 6 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-01-31 20:57:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 20:57:20,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 20:57:20,450 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-01-31 20:57:20,451 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-01-31 20:57:20,451 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-01-31 20:57:20,454 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-01-31 20:57:20,455 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-01-31 20:57:20,456 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-01-31 20:57:20,456 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-01-31 20:57:20,457 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-01-31 20:57:20,457 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-01-31 20:57:20,459 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-01-31 20:57:20,460 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-01-31 20:57:20,460 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-01-31 20:57:20,460 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-01-31 20:57:20,460 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-01-31 20:57:20,460 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-01-31 20:57:20,460 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-01-31 20:57:20,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 20:57:20,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 20:57:26,268 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-01-31 20:57:26,268 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-01-31 20:57:26,268 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-01-31 20:57:26,268 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-01-31 20:57:26,268 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-01-31 20:57:26,268 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-01-31 20:57:26,268 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-01-31 20:57:26,268 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 16 3008) the Hoare annotation is: true [2022-01-31 20:57:26,269 INFO L854 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-01-31 20:57:26,269 INFO L854 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-01-31 20:57:26,269 INFO L854 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-01-31 20:57:26,269 INFO L854 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-01-31 20:57:26,269 INFO L854 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-01-31 20:57:26,269 INFO L854 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-01-31 20:57:26,269 INFO L854 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-01-31 20:57:26,269 INFO L854 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-01-31 20:57:26,269 INFO L854 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-01-31 20:57:26,269 INFO L854 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-01-31 20:57:26,269 INFO L854 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-01-31 20:57:26,269 INFO L854 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-01-31 20:57:26,269 INFO L854 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-01-31 20:57:26,269 INFO L854 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-01-31 20:57:26,269 INFO L854 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-01-31 20:57:26,270 INFO L854 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-01-31 20:57:26,270 INFO L854 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-01-31 20:57:26,270 INFO L854 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-01-31 20:57:26,270 INFO L854 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 173) the Hoare annotation is: false [2022-01-31 20:57:26,270 INFO L854 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: false [2022-01-31 20:57:26,270 INFO L854 garLoopResultBuilder]: At program point L2616(line 2616) the Hoare annotation is: false [2022-01-31 20:57:26,270 INFO L854 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-01-31 20:57:26,270 INFO L854 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-01-31 20:57:26,270 INFO L854 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-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,271 INFO L854 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: false [2022-01-31 20:57:26,271 INFO L854 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 207) the Hoare annotation is: false [2022-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,271 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: false [2022-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,272 INFO L854 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-01-31 20:57:26,273 INFO L854 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-01-31 20:57:26,273 INFO L854 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-01-31 20:57:26,273 INFO L854 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-01-31 20:57:26,273 INFO L854 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-01-31 20:57:26,273 INFO L854 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-01-31 20:57:26,273 INFO L854 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-01-31 20:57:26,273 INFO L854 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 47) the Hoare annotation is: false [2022-01-31 20:57:26,273 INFO L854 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-01-31 20:57:26,273 INFO L854 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-01-31 20:57:26,273 INFO L854 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-01-31 20:57:26,273 INFO L854 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-01-31 20:57:26,273 INFO L854 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-01-31 20:57:26,273 INFO L854 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-01-31 20:57:26,273 INFO L854 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-01-31 20:57:26,273 INFO L854 garLoopResultBuilder]: At program point L117(line 117) the Hoare annotation is: false [2022-01-31 20:57:26,273 INFO L854 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 255) the Hoare annotation is: false [2022-01-31 20:57:26,273 INFO L854 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-01-31 20:57:26,273 INFO L854 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-01-31 20:57:26,274 INFO L854 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-01-31 20:57:26,274 INFO L854 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) the Hoare annotation is: false [2022-01-31 20:57:26,274 INFO L854 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-01-31 20:57:26,274 INFO L854 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-01-31 20:57:26,274 INFO L854 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-01-31 20:57:26,276 INFO L854 garLoopResultBuilder]: At program point L185(line 185) the Hoare annotation is: false [2022-01-31 20:57:26,276 INFO L854 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-01-31 20:57:26,276 INFO L854 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-01-31 20:57:26,276 INFO L854 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 2604) the Hoare annotation is: false [2022-01-31 20:57:26,276 INFO L854 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-01-31 20:57:26,276 INFO L854 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-01-31 20:57:26,276 INFO L854 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-01-31 20:57:26,276 INFO L854 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-01-31 20:57:26,276 INFO L854 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-01-31 20:57:26,276 INFO L854 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-01-31 20:57:26,276 INFO L854 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-01-31 20:57:26,276 INFO L854 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-01-31 20:57:26,276 INFO L854 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-01-31 20:57:26,276 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 garLoopResultBuilder]: At program point L255(line 255) the Hoare annotation is: false [2022-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,277 INFO L854 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-01-31 20:57:26,278 INFO L854 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-01-31 20:57:26,278 INFO L854 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-01-31 20:57:26,278 INFO L854 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-01-31 20:57:26,278 INFO L854 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-01-31 20:57:26,278 INFO L854 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-01-31 20:57:26,278 INFO L854 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-01-31 20:57:26,278 INFO L854 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 117) the Hoare annotation is: false [2022-01-31 20:57:26,278 INFO L854 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-01-31 20:57:26,278 INFO L854 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-01-31 20:57:26,278 INFO L854 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-01-31 20:57:26,279 INFO L854 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-01-31 20:57:26,279 INFO L854 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-01-31 20:57:26,279 INFO L854 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-01-31 20:57:26,279 INFO L854 garLoopResultBuilder]: At program point L2640(lines 2591 2647) the Hoare annotation is: (and (<= 59 main_~main__t~0) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) [2022-01-31 20:57:26,279 INFO L854 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-01-31 20:57:26,279 INFO L854 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-01-31 20:57:26,279 INFO L854 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-01-31 20:57:26,279 INFO L854 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 157) the Hoare annotation is: false [2022-01-31 20:57:26,279 INFO L854 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-01-31 20:57:26,279 INFO L854 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-01-31 20:57:26,279 INFO L854 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-01-31 20:57:26,279 INFO L854 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-01-31 20:57:26,279 INFO L854 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-01-31 20:57:26,279 INFO L854 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-01-31 20:57:26,279 INFO L854 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-01-31 20:57:26,279 INFO L854 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-01-31 20:57:26,279 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 garLoopResultBuilder]: At program point L267(line 267) the Hoare annotation is: false [2022-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,280 INFO L854 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-01-31 20:57:26,281 INFO L854 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-01-31 20:57:26,281 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 16 3008) the Hoare annotation is: true [2022-01-31 20:57:26,281 INFO L854 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-01-31 20:57:26,281 INFO L854 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-01-31 20:57:26,281 INFO L854 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-01-31 20:57:26,281 INFO L854 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-01-31 20:57:26,281 INFO L854 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-01-31 20:57:26,281 INFO L854 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-01-31 20:57:26,281 INFO L854 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-01-31 20:57:26,281 INFO L854 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-01-31 20:57:26,283 INFO L854 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-01-31 20:57:26,283 INFO L854 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-01-31 20:57:26,283 INFO L854 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-01-31 20:57:26,283 INFO L854 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-01-31 20:57:26,283 INFO L854 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-01-31 20:57:26,283 INFO L854 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-01-31 20:57:26,283 INFO L854 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-01-31 20:57:26,284 INFO L854 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-01-31 20:57:26,284 INFO L854 garLoopResultBuilder]: At program point L207(line 207) the Hoare annotation is: false [2022-01-31 20:57:26,284 INFO L854 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 185) the Hoare annotation is: false [2022-01-31 20:57:26,284 INFO L854 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-01-31 20:57:26,284 INFO L854 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-01-31 20:57:26,284 INFO L854 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-01-31 20:57:26,284 INFO L854 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: false [2022-01-31 20:57:26,284 INFO L854 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-01-31 20:57:26,284 INFO L854 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-01-31 20:57:26,284 INFO L854 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-01-31 20:57:26,284 INFO L854 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-01-31 20:57:26,284 INFO L854 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-01-31 20:57:26,284 INFO L854 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-01-31 20:57:26,284 INFO L854 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 219) the Hoare annotation is: false [2022-01-31 20:57:26,284 INFO L854 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-01-31 20:57:26,284 INFO L854 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-01-31 20:57:26,284 INFO L854 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-01-31 20:57:26,284 INFO L854 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-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,285 INFO L854 garLoopResultBuilder]: At program point L145(line 145) the Hoare annotation is: false [2022-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,285 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) the Hoare annotation is: false [2022-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,285 INFO L854 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) the Hoare annotation is: false [2022-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,285 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,286 INFO L854 garLoopResultBuilder]: At program point L219(line 219) the Hoare annotation is: false [2022-01-31 20:57:26,286 INFO L854 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-01-31 20:57:26,287 INFO L854 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-01-31 20:57:26,287 INFO L854 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-01-31 20:57:26,287 INFO L854 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 267) the Hoare annotation is: false [2022-01-31 20:57:26,287 INFO L854 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-01-31 20:57:26,287 INFO L854 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: false [2022-01-31 20:57:26,287 INFO L854 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-01-31 20:57:26,287 INFO L854 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-01-31 20:57:26,287 INFO L854 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-01-31 20:57:26,287 INFO L854 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-01-31 20:57:26,287 INFO L854 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-01-31 20:57:26,287 INFO L854 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-01-31 20:57:26,287 INFO L854 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 2616) the Hoare annotation is: false [2022-01-31 20:57:26,287 INFO L854 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-01-31 20:57:26,287 INFO L854 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-01-31 20:57:26,287 INFO L854 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-01-31 20:57:26,287 INFO L854 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-01-31 20:57:26,287 INFO L854 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-01-31 20:57:26,288 INFO L854 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-01-31 20:57:26,288 INFO L854 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-01-31 20:57:26,288 INFO L854 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: false [2022-01-31 20:57:26,288 INFO L854 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-01-31 20:57:26,288 INFO L854 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-01-31 20:57:26,288 INFO L854 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-01-31 20:57:26,288 INFO L854 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-01-31 20:57:26,288 INFO L854 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-01-31 20:57:26,288 INFO L854 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2022-01-31 20:57:26,288 INFO L854 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-01-31 20:57:26,288 INFO L854 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-01-31 20:57:26,288 INFO L854 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-01-31 20:57:26,288 INFO L854 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-01-31 20:57:26,288 INFO L854 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-01-31 20:57:26,288 INFO L854 garLoopResultBuilder]: At program point L2604(line 2604) the Hoare annotation is: false [2022-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,289 INFO L854 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 145) the Hoare annotation is: false [2022-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,289 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 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-01-31 20:57:26,290 INFO L854 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: false [2022-01-31 20:57:26,290 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 20:57:26,291 INFO L854 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-01-31 20:57:26,291 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 20:57:26,291 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 20:57:26,291 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 20:57:26,291 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 20:57:26,291 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 20:57:26,293 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:26,294 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 20:57:26,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:57:26 BoogieIcfgContainer [2022-01-31 20:57:26,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 20:57:26,306 INFO L158 Benchmark]: Toolchain (without parser) took 23976.72ms. Allocated memory was 194.0MB in the beginning and 412.1MB in the end (delta: 218.1MB). Free memory was 139.5MB in the beginning and 187.1MB in the end (delta: -47.5MB). Peak memory consumption was 229.9MB. Max. memory is 8.0GB. [2022-01-31 20:57:26,306 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 194.0MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 20:57:26,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 648.94ms. Allocated memory was 194.0MB in the beginning and 252.7MB in the end (delta: 58.7MB). Free memory was 139.3MB in the beginning and 197.8MB in the end (delta: -58.5MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2022-01-31 20:57:26,306 INFO L158 Benchmark]: Boogie Preprocessor took 92.59ms. Allocated memory is still 252.7MB. Free memory was 197.8MB in the beginning and 193.1MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-31 20:57:26,306 INFO L158 Benchmark]: RCFGBuilder took 935.95ms. Allocated memory is still 252.7MB. Free memory was 193.1MB in the beginning and 214.2MB in the end (delta: -21.1MB). Peak memory consumption was 94.2MB. Max. memory is 8.0GB. [2022-01-31 20:57:26,307 INFO L158 Benchmark]: TraceAbstraction took 22289.65ms. Allocated memory was 252.7MB in the beginning and 412.1MB in the end (delta: 159.4MB). Free memory was 213.7MB in the beginning and 187.1MB in the end (delta: 26.6MB). Peak memory consumption was 244.3MB. Max. memory is 8.0GB. [2022-01-31 20:57:26,307 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 194.0MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 648.94ms. Allocated memory was 194.0MB in the beginning and 252.7MB in the end (delta: 58.7MB). Free memory was 139.3MB in the beginning and 197.8MB in the end (delta: -58.5MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 92.59ms. Allocated memory is still 252.7MB. Free memory was 197.8MB in the beginning and 193.1MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 935.95ms. Allocated memory is still 252.7MB. Free memory was 193.1MB in the beginning and 214.2MB in the end (delta: -21.1MB). Peak memory consumption was 94.2MB. Max. memory is 8.0GB. * TraceAbstraction took 22289.65ms. Allocated memory was 252.7MB in the beginning and 412.1MB in the end (delta: 159.4MB). Free memory was 213.7MB in the beginning and 187.1MB in the end (delta: 26.6MB). Peak memory consumption was 244.3MB. 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: 22.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10515 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10515 mSDsluCounter, 5255 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1278 mSDsCounter, 2213 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19389 IncrementalHoareTripleChecker+Invalid, 21602 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2213 mSolverCounterUnsat, 3977 mSDtfsCounter, 19389 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2081 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=0, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 161 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 309 LocationsWithAnnotation, 309 PreInvPairs, 335 NumberOfFragments, 5203 HoareAnnotationTreeSize, 309 FomulaSimplifications, 8273 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 309 FomulaSimplificationsInter, 51741 FormulaSimplificationTreeSizeReductionInter, 4.1s 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__tagbuf_len <= main__t) - 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-01-31 20:57:26,337 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...