/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 23:23:44,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 23:23:44,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 23:23:44,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 23:23:44,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 23:23:44,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 23:23:44,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 23:23:44,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 23:23:44,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 23:23:44,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 23:23:44,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 23:23:44,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 23:23:44,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 23:23:44,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 23:23:44,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 23:23:44,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 23:23:44,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 23:23:44,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 23:23:44,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 23:23:44,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 23:23:44,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 23:23:44,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 23:23:44,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 23:23:44,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 23:23:44,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 23:23:44,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 23:23:44,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 23:23:44,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 23:23:44,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 23:23:44,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 23:23:44,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 23:23:44,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 23:23:44,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 23:23:44,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 23:23:44,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 23:23:44,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 23:23:44,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 23:23:44,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 23:23:44,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 23:23:44,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 23:23:44,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 23:23:44,837 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-01-31 23:23:44,842 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 23:23:44,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 23:23:44,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 23:23:44,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 23:23:44,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 23:23:44,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 23:23:44,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 23:23:44,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 23:23:44,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 23:23:44,844 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 23:23:44,844 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 23:23:44,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 23:23:44,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 23:23:44,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 23:23:44,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 23:23:44,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:23:44,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 23:23:44,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 23:23:44,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 23:23:44,845 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-01-31 23:23:44,845 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 23:23:45,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 23:23:45,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 23:23:45,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 23:23:45,019 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 23:23:45,020 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 23:23:45,021 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-01-31 23:23:45,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7d2665e6/cfbf2bf0bc3a46b5b55fca1d347cb901/FLAG6b9cde3d7 [2022-01-31 23:23:45,430 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 23:23:45,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-01-31 23:23:45,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7d2665e6/cfbf2bf0bc3a46b5b55fca1d347cb901/FLAG6b9cde3d7 [2022-01-31 23:23:45,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7d2665e6/cfbf2bf0bc3a46b5b55fca1d347cb901 [2022-01-31 23:23:45,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 23:23:45,452 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 23:23:45,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 23:23:45,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 23:23:45,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 23:23:45,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:23:45" (1/1) ... [2022-01-31 23:23:45,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a2cca9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:45, skipping insertion in model container [2022-01-31 23:23:45,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:23:45" (1/1) ... [2022-01-31 23:23:45,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 23:23:45,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 23:23:45,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2022-01-31 23:23:45,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-01-31 23:23:45,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-01-31 23:23:45,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-01-31 23:23:45,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-01-31 23:23:45,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-01-31 23:23:45,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-01-31 23:23:45,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-01-31 23:23:45,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-01-31 23:23:45,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-01-31 23:23:45,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-01-31 23:23:45,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-01-31 23:23:45,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-01-31 23:23:45,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-01-31 23:23:45,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-01-31 23:23:45,744 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-01-31 23:23:45,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:23:45,753 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 23:23:45,767 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2022-01-31 23:23:45,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-01-31 23:23:45,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-01-31 23:23:45,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-01-31 23:23:45,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-01-31 23:23:45,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-01-31 23:23:45,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-01-31 23:23:45,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-01-31 23:23:45,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-01-31 23:23:45,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-01-31 23:23:45,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-01-31 23:23:45,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-01-31 23:23:45,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-01-31 23:23:45,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-01-31 23:23:45,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-01-31 23:23:45,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-01-31 23:23:45,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:23:45,815 INFO L208 MainTranslator]: Completed translation [2022-01-31 23:23:45,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:45 WrapperNode [2022-01-31 23:23:45,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 23:23:45,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 23:23:45,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 23:23:45,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 23:23:45,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:45" (1/1) ... [2022-01-31 23:23:45,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:45" (1/1) ... [2022-01-31 23:23:45,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:45" (1/1) ... [2022-01-31 23:23:45,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:45" (1/1) ... [2022-01-31 23:23:45,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:45" (1/1) ... [2022-01-31 23:23:45,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:45" (1/1) ... [2022-01-31 23:23:45,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:45" (1/1) ... [2022-01-31 23:23:45,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 23:23:45,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 23:23:45,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 23:23:45,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 23:23:45,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:45" (1/1) ... [2022-01-31 23:23:45,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:23:45,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 23:23:45,914 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 23:23:45,935 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 23:23:45,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 23:23:45,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 23:23:45,958 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 23:23:45,958 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 23:23:45,958 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 23:23:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 23:23:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 23:23:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 23:23:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 23:23:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 23:23:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 23:23:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 23:23:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 23:23:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 23:23:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 23:23:45,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 23:23:45,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 23:23:45,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 23:23:45,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 23:23:46,086 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 23:23:46,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 23:23:46,411 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 23:23:46,416 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 23:23:46,416 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-31 23:23:46,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:23:46 BoogieIcfgContainer [2022-01-31 23:23:46,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 23:23:46,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 23:23:46,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 23:23:46,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 23:23:46,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:23:45" (1/3) ... [2022-01-31 23:23:46,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@957ee7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:23:46, skipping insertion in model container [2022-01-31 23:23:46,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:45" (2/3) ... [2022-01-31 23:23:46,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@957ee7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:23:46, skipping insertion in model container [2022-01-31 23:23:46,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:23:46" (3/3) ... [2022-01-31 23:23:46,422 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2022-01-31 23:23:46,425 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 23:23:46,425 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-01-31 23:23:46,451 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 23:23:46,458 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=QVASR [2022-01-31 23:23:46,459 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-01-31 23:23:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 104 states have (on average 1.9038461538461537) internal successors, (198), 120 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 23:23:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-31 23:23:46,483 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:46,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:46,483 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 23:23:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:46,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1600664684, now seen corresponding path program 1 times [2022-01-31 23:23:46,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:46,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [194707197] [2022-01-31 23:23:46,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:46,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:46,533 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:46,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:46,712 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:46,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [194707197] [2022-01-31 23:23:46,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [194707197] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:46,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:46,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:46,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014387472] [2022-01-31 23:23:46,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:46,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:46,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:46,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:46,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:46,759 INFO L87 Difference]: Start difference. First operand has 125 states, 104 states have (on average 1.9038461538461537) internal successors, (198), 120 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:47,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:47,146 INFO L93 Difference]: Finished difference Result 143 states and 221 transitions. [2022-01-31 23:23:47,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:47,148 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 23:23:47,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:47,158 INFO L225 Difference]: With dead ends: 143 [2022-01-31 23:23:47,158 INFO L226 Difference]: Without dead ends: 123 [2022-01-31 23:23:47,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:47,164 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 269 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:47,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 118 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 23:23:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-31 23:23:47,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2022-01-31 23:23:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2022-01-31 23:23:47,224 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2022-01-31 23:23:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:47,225 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2022-01-31 23:23:47,225 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 23:23:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-01-31 23:23:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-31 23:23:47,227 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:47,227 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:47,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 23:23:47,227 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 23:23:47,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:47,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1919005414, now seen corresponding path program 1 times [2022-01-31 23:23:47,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:47,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1647837613] [2022-01-31 23:23:47,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:47,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:47,234 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:47,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:47,341 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 23:23:47,341 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:47,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1647837613] [2022-01-31 23:23:47,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1647837613] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:47,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:47,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:47,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275345159] [2022-01-31 23:23:47,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:47,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:47,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:47,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:47,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:47,346 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:47,604 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2022-01-31 23:23:47,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:47,604 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 23:23:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:47,605 INFO L225 Difference]: With dead ends: 121 [2022-01-31 23:23:47,605 INFO L226 Difference]: Without dead ends: 113 [2022-01-31 23:23:47,606 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 23:23:47,606 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 85 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:47,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 248 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:23:47,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-31 23:23:47,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-01-31 23:23:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2022-01-31 23:23:47,618 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2022-01-31 23:23:47,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:47,619 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2022-01-31 23:23:47,619 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 23:23:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-01-31 23:23:47,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 23:23:47,619 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:47,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:47,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 23:23:47,620 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 23:23:47,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1908131676, now seen corresponding path program 1 times [2022-01-31 23:23:47,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:47,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [448209912] [2022-01-31 23:23:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:47,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:47,622 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:47,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:47,669 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 23:23:47,669 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:47,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [448209912] [2022-01-31 23:23:47,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [448209912] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:47,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:47,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:47,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920451054] [2022-01-31 23:23:47,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:47,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:47,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:47,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:47,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:47,670 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:47,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:47,892 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-01-31 23:23:47,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:47,892 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 23:23:47,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:47,893 INFO L225 Difference]: With dead ends: 113 [2022-01-31 23:23:47,893 INFO L226 Difference]: Without dead ends: 111 [2022-01-31 23:23:47,893 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 23:23:47,894 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 140 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:47,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 118 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:23:47,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-01-31 23:23:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-01-31 23:23:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2022-01-31 23:23:47,904 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2022-01-31 23:23:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:47,904 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2022-01-31 23:23:47,904 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 23:23:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-01-31 23:23:47,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 23:23:47,905 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:47,905 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:47,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 23:23:47,905 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 23:23:47,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:47,905 INFO L85 PathProgramCache]: Analyzing trace with hash -977457091, now seen corresponding path program 1 times [2022-01-31 23:23:47,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:47,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1111713398] [2022-01-31 23:23:47,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:47,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:47,907 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:47,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:47,942 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 23:23:47,942 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:47,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1111713398] [2022-01-31 23:23:47,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1111713398] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:47,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:47,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:47,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400955680] [2022-01-31 23:23:47,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:47,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:47,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:47,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:47,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:47,943 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:48,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:48,085 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-01-31 23:23:48,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:23:48,086 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 23:23:48,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:48,086 INFO L225 Difference]: With dead ends: 111 [2022-01-31 23:23:48,087 INFO L226 Difference]: Without dead ends: 107 [2022-01-31 23:23:48,087 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 23:23:48,087 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 65 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:48,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 199 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:48,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-31 23:23:48,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-01-31 23:23:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2022-01-31 23:23:48,096 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2022-01-31 23:23:48,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:48,097 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2022-01-31 23:23:48,097 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 23:23:48,097 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-01-31 23:23:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 23:23:48,097 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:48,097 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 23:23:48,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 23:23:48,098 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 23:23:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:48,098 INFO L85 PathProgramCache]: Analyzing trace with hash -223130707, now seen corresponding path program 1 times [2022-01-31 23:23:48,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:48,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [126054673] [2022-01-31 23:23:48,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:48,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:48,099 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:48,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:48,136 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 23:23:48,136 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:48,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [126054673] [2022-01-31 23:23:48,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [126054673] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:48,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:48,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:48,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593646385] [2022-01-31 23:23:48,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:48,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:48,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:48,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:48,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:48,137 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:48,348 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2022-01-31 23:23:48,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:48,348 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 23:23:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:48,349 INFO L225 Difference]: With dead ends: 125 [2022-01-31 23:23:48,349 INFO L226 Difference]: Without dead ends: 123 [2022-01-31 23:23:48,350 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 23:23:48,351 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 157 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:48,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 128 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:23:48,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-31 23:23:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-01-31 23:23:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-01-31 23:23:48,369 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2022-01-31 23:23:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:48,369 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-01-31 23:23:48,369 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 23:23:48,369 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-01-31 23:23:48,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 23:23:48,370 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:48,370 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 23:23:48,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 23:23:48,371 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 23:23:48,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:48,371 INFO L85 PathProgramCache]: Analyzing trace with hash -221591507, now seen corresponding path program 1 times [2022-01-31 23:23:48,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:48,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1475632348] [2022-01-31 23:23:48,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:48,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:48,373 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:48,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:48,449 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 23:23:48,449 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:48,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1475632348] [2022-01-31 23:23:48,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1475632348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:48,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:48,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:48,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926309015] [2022-01-31 23:23:48,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:48,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:48,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:48,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:48,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:48,453 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:48,631 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2022-01-31 23:23:48,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:48,631 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 23:23:48,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:48,632 INFO L225 Difference]: With dead ends: 105 [2022-01-31 23:23:48,632 INFO L226 Difference]: Without dead ends: 103 [2022-01-31 23:23:48,632 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 23:23:48,633 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 130 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:48,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 100 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-31 23:23:48,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-01-31 23:23:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-01-31 23:23:48,645 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2022-01-31 23:23:48,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:48,645 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-01-31 23:23:48,645 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 23:23:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-01-31 23:23:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 23:23:48,646 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:48,646 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 23:23:48,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 23:23:48,646 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 23:23:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:48,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1674251212, now seen corresponding path program 1 times [2022-01-31 23:23:48,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:48,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2064012614] [2022-01-31 23:23:48,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:48,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:48,648 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:48,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:48,708 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 23:23:48,708 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:48,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2064012614] [2022-01-31 23:23:48,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2064012614] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:48,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:48,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:48,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696185702] [2022-01-31 23:23:48,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:48,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:48,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:48,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:48,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:48,710 INFO L87 Difference]: Start difference. First operand 103 states and 115 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 23:23:48,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:48,917 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2022-01-31 23:23:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:48,917 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 23:23:48,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:48,918 INFO L225 Difference]: With dead ends: 124 [2022-01-31 23:23:48,918 INFO L226 Difference]: Without dead ends: 122 [2022-01-31 23:23:48,918 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 23:23:48,919 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 148 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:48,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 120 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:23:48,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-01-31 23:23:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2022-01-31 23:23:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 97 states have internal predecessors, (110), 2 states have call successors, (2), 2 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 23:23:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2022-01-31 23:23:48,929 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2022-01-31 23:23:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:48,930 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2022-01-31 23:23:48,930 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 23:23:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2022-01-31 23:23:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 23:23:48,935 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:48,935 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 23:23:48,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 23:23:48,938 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 23:23:48,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1672885792, now seen corresponding path program 1 times [2022-01-31 23:23:48,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:48,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [881145289] [2022-01-31 23:23:48,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:48,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:48,941 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:49,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:49,040 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:49,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [881145289] [2022-01-31 23:23:49,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [881145289] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:49,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:49,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:49,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642071117] [2022-01-31 23:23:49,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:49,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:49,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:49,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:49,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:49,041 INFO L87 Difference]: Start difference. First operand 101 states and 113 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 23:23:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:49,262 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2022-01-31 23:23:49,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:49,262 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 23:23:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:49,263 INFO L225 Difference]: With dead ends: 134 [2022-01-31 23:23:49,263 INFO L226 Difference]: Without dead ends: 132 [2022-01-31 23:23:49,263 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 23:23:49,263 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 102 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:49,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 214 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:23:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-01-31 23:23:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2022-01-31 23:23:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-01-31 23:23:49,273 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 18 [2022-01-31 23:23:49,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:49,273 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-01-31 23:23:49,273 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 23:23:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-01-31 23:23:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 23:23:49,276 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:49,276 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 23:23:49,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 23:23:49,276 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 23:23:49,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1720601042, now seen corresponding path program 1 times [2022-01-31 23:23:49,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:49,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1512568582] [2022-01-31 23:23:49,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:49,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:49,281 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:49,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:49,361 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 23:23:49,362 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:49,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1512568582] [2022-01-31 23:23:49,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1512568582] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:49,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:49,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:49,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17009690] [2022-01-31 23:23:49,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:49,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:49,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:49,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:49,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:49,363 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:49,586 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2022-01-31 23:23:49,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:23:49,586 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 23:23:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:49,589 INFO L225 Difference]: With dead ends: 117 [2022-01-31 23:23:49,589 INFO L226 Difference]: Without dead ends: 113 [2022-01-31 23:23:49,589 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 23:23:49,591 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 75 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:49,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 217 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:23:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-31 23:23:49,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-01-31 23:23:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2022-01-31 23:23:49,598 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 18 [2022-01-31 23:23:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:49,598 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2022-01-31 23:23:49,598 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 23:23:49,598 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2022-01-31 23:23:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 23:23:49,599 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:49,599 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 23:23:49,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 23:23:49,599 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 23:23:49,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:49,600 INFO L85 PathProgramCache]: Analyzing trace with hash 362183168, now seen corresponding path program 1 times [2022-01-31 23:23:49,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:49,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1123371981] [2022-01-31 23:23:49,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:49,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:49,601 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:49,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:49,682 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 23:23:49,682 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:49,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1123371981] [2022-01-31 23:23:49,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1123371981] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:49,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:49,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:49,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393034525] [2022-01-31 23:23:49,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:49,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:49,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:49,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:49,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:49,683 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:49,950 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-01-31 23:23:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:49,950 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 23:23:49,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:49,951 INFO L225 Difference]: With dead ends: 135 [2022-01-31 23:23:49,951 INFO L226 Difference]: Without dead ends: 133 [2022-01-31 23:23:49,951 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 23:23:49,951 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 93 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:49,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 284 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:23:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-01-31 23:23:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2022-01-31 23:23:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-01-31 23:23:49,959 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 19 [2022-01-31 23:23:49,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:49,959 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-01-31 23:23:49,959 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 23:23:49,959 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-01-31 23:23:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 23:23:49,959 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:49,959 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 23:23:49,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 23:23:49,959 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 23:23:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:49,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1325574371, now seen corresponding path program 1 times [2022-01-31 23:23:49,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:49,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [355037485] [2022-01-31 23:23:49,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:49,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:49,961 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:49,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:49,991 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 23:23:49,991 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:49,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [355037485] [2022-01-31 23:23:49,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [355037485] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:49,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:49,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:49,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706710997] [2022-01-31 23:23:49,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:49,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:49,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:49,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:49,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:49,992 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:50,123 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-01-31 23:23:50,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:23:50,124 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 23:23:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:50,124 INFO L225 Difference]: With dead ends: 111 [2022-01-31 23:23:50,124 INFO L226 Difference]: Without dead ends: 109 [2022-01-31 23:23:50,125 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 23:23:50,125 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 152 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:50,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 115 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:50,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-31 23:23:50,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-01-31 23:23:50,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2022-01-31 23:23:50,132 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 20 [2022-01-31 23:23:50,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:50,132 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2022-01-31 23:23:50,132 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 23:23:50,132 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-01-31 23:23:50,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 23:23:50,133 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:50,133 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 23:23:50,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 23:23:50,133 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 23:23:50,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:50,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1856864327, now seen corresponding path program 1 times [2022-01-31 23:23:50,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:50,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [165141403] [2022-01-31 23:23:50,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:50,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:50,135 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:50,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:50,179 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 23:23:50,180 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:50,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [165141403] [2022-01-31 23:23:50,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [165141403] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:50,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:50,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:50,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376031306] [2022-01-31 23:23:50,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:50,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:50,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:50,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:50,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:50,181 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:50,311 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-01-31 23:23:50,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:23:50,311 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 23:23:50,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:50,312 INFO L225 Difference]: With dead ends: 109 [2022-01-31 23:23:50,312 INFO L226 Difference]: Without dead ends: 105 [2022-01-31 23:23:50,312 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 23:23:50,312 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:50,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:50,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-01-31 23:23:50,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-01-31 23:23:50,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-01-31 23:23:50,319 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 21 [2022-01-31 23:23:50,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:50,319 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-01-31 23:23:50,319 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 23:23:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-01-31 23:23:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 23:23:50,319 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:50,320 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 23:23:50,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 23:23:50,320 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 23:23:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1714979017, now seen corresponding path program 1 times [2022-01-31 23:23:50,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:50,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [533918665] [2022-01-31 23:23:50,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:50,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:50,321 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:50,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:50,368 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 23:23:50,368 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:50,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [533918665] [2022-01-31 23:23:50,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [533918665] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:50,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:50,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:50,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760839326] [2022-01-31 23:23:50,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:50,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:50,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:50,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:50,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:50,369 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:50,589 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2022-01-31 23:23:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:50,590 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 23:23:50,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:50,590 INFO L225 Difference]: With dead ends: 121 [2022-01-31 23:23:50,590 INFO L226 Difference]: Without dead ends: 119 [2022-01-31 23:23:50,590 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 23:23:50,591 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 199 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:50,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 80 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:23:50,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-01-31 23:23:50,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-01-31 23:23:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-01-31 23:23:50,598 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 22 [2022-01-31 23:23:50,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:50,598 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-01-31 23:23:50,598 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 23:23:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-01-31 23:23:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 23:23:50,599 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:50,599 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 23:23:50,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 23:23:50,599 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 23:23:50,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:50,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1738536758, now seen corresponding path program 1 times [2022-01-31 23:23:50,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:50,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [730742010] [2022-01-31 23:23:50,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:50,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:50,601 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:50,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:50,672 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 23:23:50,673 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:50,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [730742010] [2022-01-31 23:23:50,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [730742010] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:50,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:50,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:50,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427997836] [2022-01-31 23:23:50,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:50,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:50,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:50,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:50,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:50,674 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:50,939 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2022-01-31 23:23:50,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:50,939 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 23:23:50,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:50,940 INFO L225 Difference]: With dead ends: 113 [2022-01-31 23:23:50,940 INFO L226 Difference]: Without dead ends: 111 [2022-01-31 23:23:50,940 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 23:23:50,940 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 191 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:50,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 74 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:23:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-01-31 23:23:50,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2022-01-31 23:23:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-01-31 23:23:50,947 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 22 [2022-01-31 23:23:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:50,948 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-01-31 23:23:50,948 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 23:23:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-01-31 23:23:50,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 23:23:50,958 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:50,958 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 23:23:50,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 23:23:50,958 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 23:23:50,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:50,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1786252008, now seen corresponding path program 1 times [2022-01-31 23:23:50,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:50,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1191832861] [2022-01-31 23:23:50,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:50,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:50,960 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,010 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 23:23:51,010 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:51,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1191832861] [2022-01-31 23:23:51,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1191832861] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:51,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:51,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:51,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345744938] [2022-01-31 23:23:51,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:51,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:51,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:51,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:51,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:51,011 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:51,227 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-01-31 23:23:51,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:23:51,227 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 23:23:51,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:51,227 INFO L225 Difference]: With dead ends: 95 [2022-01-31 23:23:51,227 INFO L226 Difference]: Without dead ends: 58 [2022-01-31 23:23:51,228 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 23:23:51,228 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 173 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:51,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 61 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-31 23:23:51,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-01-31 23:23:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-01-31 23:23:51,233 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 22 [2022-01-31 23:23:51,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:51,233 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-01-31 23:23:51,233 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 23:23:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-01-31 23:23:51,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 23:23:51,234 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:51,234 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] [2022-01-31 23:23:51,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 23:23:51,234 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 23:23:51,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:51,234 INFO L85 PathProgramCache]: Analyzing trace with hash -563432656, now seen corresponding path program 1 times [2022-01-31 23:23:51,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:51,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2036565712] [2022-01-31 23:23:51,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:51,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:51,236 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,338 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 23:23:51,339 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:51,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2036565712] [2022-01-31 23:23:51,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2036565712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:51,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:51,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:23:51,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128977687] [2022-01-31 23:23:51,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:51,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:23:51,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:51,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:23:51,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:23:51,340 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:51,587 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-01-31 23:23:51,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 23:23:51,588 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-01-31 23:23:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:51,588 INFO L225 Difference]: With dead ends: 67 [2022-01-31 23:23:51,588 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 23:23:51,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-01-31 23:23:51,589 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 94 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:51,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 68 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 23:23:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2022-01-31 23:23:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-01-31 23:23:51,593 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2022-01-31 23:23:51,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:51,593 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-01-31 23:23:51,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,593 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-01-31 23:23:51,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 23:23:51,594 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:51,594 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] [2022-01-31 23:23:51,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 23:23:51,594 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 23:23:51,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:51,594 INFO L85 PathProgramCache]: Analyzing trace with hash -563446558, now seen corresponding path program 1 times [2022-01-31 23:23:51,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:51,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [531668963] [2022-01-31 23:23:51,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:51,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:51,595 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,692 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 23:23:51,693 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:51,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [531668963] [2022-01-31 23:23:51,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [531668963] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:51,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:51,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:23:51,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800328414] [2022-01-31 23:23:51,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:51,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:23:51,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:51,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:23:51,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:23:51,694 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:51,910 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-01-31 23:23:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 23:23:51,910 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-01-31 23:23:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:51,911 INFO L225 Difference]: With dead ends: 56 [2022-01-31 23:23:51,911 INFO L226 Difference]: Without dead ends: 54 [2022-01-31 23:23:51,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-01-31 23:23:51,911 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 109 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:51,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 42 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-31 23:23:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-01-31 23:23:51,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-01-31 23:23:51,915 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2022-01-31 23:23:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:51,915 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-01-31 23:23:51,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-01-31 23:23:51,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 23:23:51,916 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:51,916 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] [2022-01-31 23:23:51,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 23:23:51,916 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 23:23:51,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:51,916 INFO L85 PathProgramCache]: Analyzing trace with hash -286539729, now seen corresponding path program 1 times [2022-01-31 23:23:51,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:51,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [54452865] [2022-01-31 23:23:51,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:51,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:51,918 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:52,000 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 23:23:52,001 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:52,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [54452865] [2022-01-31 23:23:52,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [54452865] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:52,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:52,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:23:52,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943622337] [2022-01-31 23:23:52,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:52,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:23:52,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:52,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:23:52,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:52,002 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:52,110 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-01-31 23:23:52,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:52,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-01-31 23:23:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:52,111 INFO L225 Difference]: With dead ends: 62 [2022-01-31 23:23:52,111 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 23:23:52,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:23:52,111 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 81 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:52,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 49 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 23:23:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2022-01-31 23:23:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 2 states have call successors, (2), 2 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 23:23:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-01-31 23:23:52,115 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2022-01-31 23:23:52,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:52,116 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-01-31 23:23:52,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-01-31 23:23:52,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 23:23:52,116 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:52,116 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] [2022-01-31 23:23:52,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 23:23:52,116 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 23:23:52,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:52,116 INFO L85 PathProgramCache]: Analyzing trace with hash -286970705, now seen corresponding path program 1 times [2022-01-31 23:23:52,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:52,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [362107195] [2022-01-31 23:23:52,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:52,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:52,118 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:52,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:52,207 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 23:23:52,207 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:52,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [362107195] [2022-01-31 23:23:52,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [362107195] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:52,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:52,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:23:52,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824367172] [2022-01-31 23:23:52,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:52,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:23:52,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:52,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:23:52,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:52,208 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:52,281 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-01-31 23:23:52,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:23:52,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-01-31 23:23:52,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:52,282 INFO L225 Difference]: With dead ends: 52 [2022-01-31 23:23:52,282 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 23:23:52,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:23:52,283 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 86 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:52,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 33 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:23:52,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 23:23:52,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 23:23:52,283 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 23:23:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 23:23:52,283 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-01-31 23:23:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:52,284 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 23:23:52,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 23:23:52,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 23:23:52,285 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-01-31 23:23:52,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-01-31 23:23:52,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-01-31 23:23:52,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-01-31 23:23:52,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-01-31 23:23:52,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-01-31 23:23:52,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-01-31 23:23:52,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-01-31 23:23:52,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-01-31 23:23:52,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-01-31 23:23:52,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-01-31 23:23:52,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-01-31 23:23:52,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-01-31 23:23:52,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-01-31 23:23:52,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-01-31 23:23:52,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-01-31 23:23:52,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 23:23:52,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 23:23:54,048 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-01-31 23:23:54,048 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-01-31 23:23:54,048 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-01-31 23:23:54,048 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-01-31 23:23:54,048 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-01-31 23:23:54,048 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-01-31 23:23:54,048 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-01-31 23:23:54,048 INFO L854 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 117) the Hoare annotation is: false [2022-01-31 23:23:54,049 INFO L854 garLoopResultBuilder]: At program point L217(lines 217 229) 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)) [2022-01-31 23:23:54,049 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 17 1006) the Hoare annotation is: true [2022-01-31 23:23:54,049 INFO L854 garLoopResultBuilder]: At program point L597(lines 597 969) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 5 main_~main__t~0)) [2022-01-31 23:23:54,049 INFO L854 garLoopResultBuilder]: At program point L366(lines 366 991) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,049 INFO L854 garLoopResultBuilder]: At program point L267(lines 267 275) 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))) (or (and (<= main_~main__t~0 1) .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 0)) .cse2) (and .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse2))) [2022-01-31 23:23:54,049 INFO L854 garLoopResultBuilder]: At program point L581(lines 581 971) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 4 main_~main__t~0)) [2022-01-31 23:23:54,049 INFO L854 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: false [2022-01-31 23:23:54,049 INFO L854 garLoopResultBuilder]: At program point L895(line 895) the Hoare annotation is: false [2022-01-31 23:23:54,049 INFO L854 garLoopResultBuilder]: At program point L317(lines 317 994) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,049 INFO L854 garLoopResultBuilder]: At program point L185(line 185) the Hoare annotation is: false [2022-01-31 23:23:54,049 INFO L854 garLoopResultBuilder]: At program point L400(lines 400 424) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,049 INFO L854 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 919) the Hoare annotation is: false [2022-01-31 23:23:54,049 INFO L854 garLoopResultBuilder]: At program point L136(lines 136 242) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,050 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) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,050 INFO L854 garLoopResultBuilder]: At program point L615(lines 615 626) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,050 INFO L854 garLoopResultBuilder]: At program point L929(lines 929 941) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~50 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~51 0)) (<= 9 main_~main__t~0)) [2022-01-31 23:23:54,050 INFO L854 garLoopResultBuilder]: At program point L219(line 219) the Hoare annotation is: false [2022-01-31 23:23:54,050 INFO L854 garLoopResultBuilder]: At program point L665(lines 665 963) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 6 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-01-31 23:23:54,050 INFO L854 garLoopResultBuilder]: At program point L434(lines 434 985) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 2 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-01-31 23:23:54,050 INFO L854 garLoopResultBuilder]: At program point L269(line 269) the Hoare annotation is: false [2022-01-31 23:23:54,050 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 17 1006) the Hoare annotation is: true [2022-01-31 23:23:54,050 INFO L854 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 895) the Hoare annotation is: false [2022-01-31 23:23:54,050 INFO L854 garLoopResultBuilder]: At program point L649(lines 649 965) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 5 main_~main__t~0)) [2022-01-31 23:23:54,050 INFO L854 garLoopResultBuilder]: At program point L385(lines 385 988) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 2 main_~main__t~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,050 INFO L854 garLoopResultBuilder]: At program point L22(lines 22 1005) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-01-31 23:23:54,050 INFO L854 garLoopResultBuilder]: At program point L468(lines 468 492) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,050 INFO L854 garLoopResultBuilder]: At program point L881(lines 881 907) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~48 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0)) [2022-01-31 23:23:54,050 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) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,051 INFO L854 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 207) the Hoare annotation is: false [2022-01-31 23:23:54,051 INFO L854 garLoopResultBuilder]: At program point L683(lines 683 694) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,051 INFO L854 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: false [2022-01-31 23:23:54,051 INFO L854 garLoopResultBuilder]: At program point L72(lines 72 288) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (< 0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,051 INFO L854 garLoopResultBuilder]: At program point L931(line 931) the Hoare annotation is: false [2022-01-31 23:23:54,051 INFO L854 garLoopResultBuilder]: At program point L733(lines 733 957) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-01-31 23:23:54,051 INFO L854 garLoopResultBuilder]: At program point L155(lines 155 234) 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)) [2022-01-31 23:23:54,051 INFO L854 garLoopResultBuilder]: At program point L502(lines 502 979) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 3 main_~main__t~0)) [2022-01-31 23:23:54,051 INFO L854 garLoopResultBuilder]: At program point L205(lines 205 231) 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)) [2022-01-31 23:23:54,051 INFO L854 garLoopResultBuilder]: At program point L717(lines 717 959) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 6 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-01-31 23:23:54,051 INFO L854 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 931) the Hoare annotation is: false [2022-01-31 23:23:54,051 INFO L854 garLoopResultBuilder]: At program point L453(lines 453 982) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 3 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,051 INFO L854 garLoopResultBuilder]: At program point L866(lines 866 946) the Hoare annotation is: (and (<= 9 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,051 INFO L854 garLoopResultBuilder]: At program point L255(lines 255 277) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~12 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 (not (<= main_~main__tagbuf_len~0 0)) .cse1) (and .cse0 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1))) [2022-01-31 23:23:54,052 INFO L854 garLoopResultBuilder]: At program point L536(lines 536 560) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,052 INFO L854 garLoopResultBuilder]: At program point L883(line 883) the Hoare annotation is: false [2022-01-31 23:23:54,052 INFO L854 garLoopResultBuilder]: At program point L751(lines 751 762) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,052 INFO L854 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: false [2022-01-31 23:23:54,052 INFO L854 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 257) the Hoare annotation is: false [2022-01-31 23:23:54,052 INFO L854 garLoopResultBuilder]: At program point L801(lines 801 951) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 8 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-01-31 23:23:54,052 INFO L854 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: false [2022-01-31 23:23:54,052 INFO L854 garLoopResultBuilder]: At program point L570(lines 570 973) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 4 main_~main__t~0)) [2022-01-31 23:23:54,052 INFO L854 garLoopResultBuilder]: At program point L917(lines 917 943) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~50 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0)) [2022-01-31 23:23:54,052 INFO L854 garLoopResultBuilder]: At program point L785(lines 785 953) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-01-31 23:23:54,052 INFO L854 garLoopResultBuilder]: At program point L207(line 207) the Hoare annotation is: false [2022-01-31 23:23:54,052 INFO L854 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) the Hoare annotation is: false [2022-01-31 23:23:54,052 INFO L854 garLoopResultBuilder]: At program point L521(lines 521 976) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 4 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,052 INFO L854 garLoopResultBuilder]: At program point L868(lines 26 1000) the Hoare annotation is: (and (<= 0 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,052 INFO L854 garLoopResultBuilder]: At program point L257(line 257) the Hoare annotation is: false [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) the Hoare annotation is: false [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point L604(lines 604 628) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point L26(lines 26 1000) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point L819(lines 819 830) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point L638(lines 638 967) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 5 main_~main__t~0)) [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point L919(line 919) the Hoare annotation is: false [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point L853(lines 853 947) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 8 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point L143(lines 143 236) 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)) [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point L589(lines 589 970) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 5 main_~main__t~0)) [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 269) the Hoare annotation is: false [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point L325(lines 325 993) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point L672(lines 672 696) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 173) the Hoare annotation is: false [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point L309(lines 309 995) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (< 0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point L904(lines 65 999) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,053 INFO L854 garLoopResultBuilder]: At program point L706(lines 706 961) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 6 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) the Hoare annotation is: false [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point L343(lines 343 354) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point L145(line 145) the Hoare annotation is: false [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point L657(lines 657 964) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 6 main_~main__t~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point L46(lines 46 56) 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 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point L1004(lines 22 1005) the Hoare annotation is: (or (<= 0 main_~main__t~0) (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|))) [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point L393(lines 393 987) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 2 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point L740(lines 740 764) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) the Hoare annotation is: false [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point L96(lines 96 285) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 17 1006) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point L377(lines 377 989) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point L774(lines 774 955) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point L411(lines 411 422) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 185) the Hoare annotation is: false [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point L725(lines 725 958) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,054 INFO L854 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: false [2022-01-31 23:23:54,055 INFO L854 garLoopResultBuilder]: At program point L461(lines 461 981) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 3 main_~main__t~0)) [2022-01-31 23:23:54,055 INFO L854 garLoopResultBuilder]: At program point L940(lines 858 947) the Hoare annotation is: (and (<= 9 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,055 INFO L854 garLoopResultBuilder]: At program point L874(lines 874 945) the Hoare annotation is: (and (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0)) [2022-01-31 23:23:54,055 INFO L854 garLoopResultBuilder]: At program point L808(lines 808 832) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,055 INFO L854 garLoopResultBuilder]: At program point L164(lines 164 233) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,055 INFO L854 garLoopResultBuilder]: At program point L65(lines 65 999) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (< 0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,055 INFO L854 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2022-01-31 23:23:54,055 INFO L854 garLoopResultBuilder]: At program point L445(lines 445 983) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 2 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-01-31 23:23:54,055 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) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,055 INFO L854 garLoopResultBuilder]: At program point L842(lines 842 949) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 8 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-01-31 23:23:54,055 INFO L854 garLoopResultBuilder]: At program point L132(lines 132 284) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,055 INFO L854 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) the Hoare annotation is: false [2022-01-31 23:23:54,055 INFO L854 garLoopResultBuilder]: At program point L479(lines 479 490) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,055 INFO L854 garLoopResultBuilder]: At program point L793(lines 793 952) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 8 main_~main__t~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,055 INFO L854 garLoopResultBuilder]: At program point L248(lines 248 283) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,056 INFO L854 garLoopResultBuilder]: At program point L83(lines 83 286) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (< 0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,056 INFO L854 garLoopResultBuilder]: At program point L529(lines 529 975) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 4 main_~main__t~0)) [2022-01-31 23:23:54,056 INFO L854 garLoopResultBuilder]: At program point L298(lines 298 997) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (< 0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,056 INFO L854 garLoopResultBuilder]: At program point L34(lines 34 58) 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 23:23:54,056 INFO L854 garLoopResultBuilder]: At program point L513(lines 513 977) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 3 main_~main__t~0)) [2022-01-31 23:23:54,056 INFO L854 garLoopResultBuilder]: At program point L893(lines 893 905) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~48 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~49 0))) [2022-01-31 23:23:54,056 INFO L854 garLoopResultBuilder]: At program point L282(lines 132 284) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,056 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) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:23:54,056 INFO L854 garLoopResultBuilder]: At program point L117(line 117) the Hoare annotation is: false [2022-01-31 23:23:54,056 INFO L854 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 883) the Hoare annotation is: false [2022-01-31 23:23:54,056 INFO L854 garLoopResultBuilder]: At program point L332(lines 332 356) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,056 INFO L854 garLoopResultBuilder]: At program point L547(lines 547 558) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-01-31 23:23:54,056 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 23:23:54,056 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 23:23:54,056 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 23:23:54,056 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 23:23:54,057 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 23:23:54,057 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 23:23:54,057 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 23:23:54,059 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] [2022-01-31 23:23:54,059 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 23:23:54,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:23:54 BoogieIcfgContainer [2022-01-31 23:23:54,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 23:23:54,070 INFO L158 Benchmark]: Toolchain (without parser) took 8618.93ms. Allocated memory was 210.8MB in the beginning and 363.9MB in the end (delta: 153.1MB). Free memory was 158.2MB in the beginning and 202.0MB in the end (delta: -43.9MB). Peak memory consumption was 186.1MB. Max. memory is 8.0GB. [2022-01-31 23:23:54,071 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 210.8MB. Free memory is still 174.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 23:23:54,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.15ms. Allocated memory was 210.8MB in the beginning and 303.0MB in the end (delta: 92.3MB). Free memory was 158.0MB in the beginning and 266.3MB in the end (delta: -108.3MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-01-31 23:23:54,071 INFO L158 Benchmark]: Boogie Preprocessor took 54.19ms. Allocated memory is still 303.0MB. Free memory was 266.3MB in the beginning and 263.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 23:23:54,071 INFO L158 Benchmark]: RCFGBuilder took 546.17ms. Allocated memory is still 303.0MB. Free memory was 263.9MB in the beginning and 238.5MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-01-31 23:23:54,071 INFO L158 Benchmark]: TraceAbstraction took 7652.01ms. Allocated memory was 303.0MB in the beginning and 363.9MB in the end (delta: 60.8MB). Free memory was 238.1MB in the beginning and 202.0MB in the end (delta: 36.0MB). Peak memory consumption was 172.7MB. Max. memory is 8.0GB. [2022-01-31 23:23:54,072 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.11ms. Allocated memory is still 210.8MB. Free memory is still 174.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 363.15ms. Allocated memory was 210.8MB in the beginning and 303.0MB in the end (delta: 92.3MB). Free memory was 158.0MB in the beginning and 266.3MB in the end (delta: -108.3MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.19ms. Allocated memory is still 303.0MB. Free memory was 266.3MB in the beginning and 263.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 546.17ms. Allocated memory is still 303.0MB. Free memory was 263.9MB in the beginning and 238.5MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 7652.01ms. Allocated memory was 303.0MB in the beginning and 363.9MB in the end (delta: 60.8MB). Free memory was 238.1MB in the beginning and 202.0MB in the end (delta: 36.0MB). Peak memory consumption was 172.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 105]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 117]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 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: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 269]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 883]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 895]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 919]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 931]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 132 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2409 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2409 mSDsluCounter, 2439 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1356 mSDsCounter, 438 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5255 IncrementalHoareTripleChecker+Invalid, 5693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 438 mSolverCounterUnsat, 1083 mSDtfsCounter, 5255 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 148 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 125 LocationsWithAnnotation, 125 PreInvPairs, 147 NumberOfFragments, 1678 HoareAnnotationTreeSize, 125 FomulaSimplifications, 13187 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 125 FomulaSimplificationsInter, 4837 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 858]: Loop Invariant Derived loop invariant: 9 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 0 <= main__t || ((((__tmp_3137_1 == \old(__tmp_3137_1) && __tmp_2624_1 == \old(__tmp_2624_1)) && __tmp_3137_0 == \old(__tmp_3137_0)) && \old(__return_2598) == __return_2598) && __tmp_2624_0 == \old(__tmp_2624_0)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 1 <= main__t - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-01-31 23:23:54,097 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...