/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:27:20,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:27:20,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:27:20,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:27:20,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:27:20,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:27:20,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:27:20,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:27:20,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:27:20,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:27:20,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:27:20,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:27:20,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:27:20,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:27:20,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:27:20,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:27:20,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:27:20,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:27:20,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:27:20,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:27:20,090 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:27:20,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:27:20,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:27:20,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:27:20,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:27:20,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:27:20,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:27:20,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:27:20,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:27:20,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:27:20,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:27:20,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:27:20,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:27:20,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:27:20,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:27:20,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:27:20,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:27:20,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:27:20,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:27:20,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:27:20,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:27:20,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:27:20,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:27:20,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:27:20,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:27:20,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:27:20,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:27:20,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:27:20,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:27:20,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:27:20,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:27:20,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:27:20,120 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:27:20,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:27:20,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:27:20,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:27:20,121 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:27:20,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:27:20,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:27:20,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:27:20,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:27:20,121 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:27:20,121 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:27:20,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:27:20,122 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:27:20,122 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:27:20,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:27:20,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:27:20,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:27:20,336 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:27:20,337 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:27:20,338 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.v+nlh-reducer.c [2022-04-08 09:27:20,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b69b24a8/3af46a6d4c5144b09f1e1add84dd1a4c/FLAGd3eaf4497 [2022-04-08 09:27:20,774 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:27:20,775 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-04-08 09:27:20,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b69b24a8/3af46a6d4c5144b09f1e1add84dd1a4c/FLAGd3eaf4497 [2022-04-08 09:27:20,801 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b69b24a8/3af46a6d4c5144b09f1e1add84dd1a4c [2022-04-08 09:27:20,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:27:20,805 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:27:20,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:27:20,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:27:20,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:27:20,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:27:20" (1/1) ... [2022-04-08 09:27:20,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f783e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:20, skipping insertion in model container [2022-04-08 09:27:20,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:27:20" (1/1) ... [2022-04-08 09:27:20,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:27:20,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:27:20,996 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.v+nlh-reducer.c[1123,1136] [2022-04-08 09:27:20,999 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.v+nlh-reducer.c[1338,1351] [2022-04-08 09:27:21,001 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.v+nlh-reducer.c[1654,1667] [2022-04-08 09:27:21,003 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.v+nlh-reducer.c[1869,1882] [2022-04-08 09:27:21,005 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.v+nlh-reducer.c[2402,2415] [2022-04-08 09:27:21,006 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.v+nlh-reducer.c[2617,2630] [2022-04-08 09:27:21,008 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.v+nlh-reducer.c[2919,2932] [2022-04-08 09:27:21,010 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.v+nlh-reducer.c[3134,3147] [2022-04-08 09:27:21,011 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.v+nlh-reducer.c[3404,3417] [2022-04-08 09:27:21,013 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.v+nlh-reducer.c[3622,3635] [2022-04-08 09:27:21,015 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.v+nlh-reducer.c[4106,4119] [2022-04-08 09:27:21,017 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.v+nlh-reducer.c[4324,4337] [2022-04-08 09:27:21,019 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.v+nlh-reducer.c[4820,4833] [2022-04-08 09:27:21,021 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.v+nlh-reducer.c[5221,5234] [2022-04-08 09:27:21,023 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.v+nlh-reducer.c[5439,5452] [2022-04-08 09:27:21,025 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.v+nlh-reducer.c[5881,5894] [2022-04-08 09:27:21,026 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.v+nlh-reducer.c[6099,6112] [2022-04-08 09:27:21,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:27:21,035 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:27:21,048 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.v+nlh-reducer.c[1123,1136] [2022-04-08 09:27:21,049 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.v+nlh-reducer.c[1338,1351] [2022-04-08 09:27:21,050 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.v+nlh-reducer.c[1654,1667] [2022-04-08 09:27:21,051 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.v+nlh-reducer.c[1869,1882] [2022-04-08 09:27:21,054 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.v+nlh-reducer.c[2402,2415] [2022-04-08 09:27:21,055 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.v+nlh-reducer.c[2617,2630] [2022-04-08 09:27:21,056 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.v+nlh-reducer.c[2919,2932] [2022-04-08 09:27:21,057 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.v+nlh-reducer.c[3134,3147] [2022-04-08 09:27:21,058 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.v+nlh-reducer.c[3404,3417] [2022-04-08 09:27:21,060 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.v+nlh-reducer.c[3622,3635] [2022-04-08 09:27:21,062 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.v+nlh-reducer.c[4106,4119] [2022-04-08 09:27:21,063 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.v+nlh-reducer.c[4324,4337] [2022-04-08 09:27:21,064 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.v+nlh-reducer.c[4820,4833] [2022-04-08 09:27:21,066 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.v+nlh-reducer.c[5221,5234] [2022-04-08 09:27:21,067 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.v+nlh-reducer.c[5439,5452] [2022-04-08 09:27:21,068 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.v+nlh-reducer.c[5881,5894] [2022-04-08 09:27:21,069 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.v+nlh-reducer.c[6099,6112] [2022-04-08 09:27:21,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:27:21,082 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:27:21,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:21 WrapperNode [2022-04-08 09:27:21,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:27:21,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:27:21,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:27:21,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:27:21,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:21" (1/1) ... [2022-04-08 09:27:21,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:21" (1/1) ... [2022-04-08 09:27:21,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:21" (1/1) ... [2022-04-08 09:27:21,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:21" (1/1) ... [2022-04-08 09:27:21,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:21" (1/1) ... [2022-04-08 09:27:21,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:21" (1/1) ... [2022-04-08 09:27:21,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:21" (1/1) ... [2022-04-08 09:27:21,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:27:21,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:27:21,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:27:21,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:27:21,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:21" (1/1) ... [2022-04-08 09:27:21,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:27:21,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:27:21,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:27:21,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:27:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:27:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:27:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:27:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:27:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:27:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:27:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:27:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:27:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:27:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:27:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:27:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:27:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:27:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:27:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:27:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:27:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:27:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:27:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:27:21,258 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:27:21,259 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:27:21,496 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:27:21,503 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:27:21,503 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-08 09:27:21,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:27:21 BoogieIcfgContainer [2022-04-08 09:27:21,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:27:21,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:27:21,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:27:21,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:27:21,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:27:20" (1/3) ... [2022-04-08 09:27:21,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518cf97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:27:21, skipping insertion in model container [2022-04-08 09:27:21,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:21" (2/3) ... [2022-04-08 09:27:21,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518cf97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:27:21, skipping insertion in model container [2022-04-08 09:27:21,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:27:21" (3/3) ... [2022-04-08 09:27:21,512 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2022-04-08 09:27:21,515 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:27:21,516 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-04-08 09:27:21,549 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:27:21,554 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:27:21,554 INFO L341 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-04-08 09:27:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 71 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:27:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 09:27:21,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:21,577 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:21,577 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:21,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash -388107236, now seen corresponding path program 1 times [2022-04-08 09:27:21,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:21,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1926501169] [2022-04-08 09:27:21,598 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:21,598 INFO L85 PathProgramCache]: Analyzing trace with hash -388107236, now seen corresponding path program 2 times [2022-04-08 09:27:21,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:21,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181779889] [2022-04-08 09:27:21,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:21,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:21,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:21,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {86#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {79#true} is VALID [2022-04-08 09:27:21,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {79#true} assume true; {79#true} is VALID [2022-04-08 09:27:21,902 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79#true} {79#true} #181#return; {79#true} is VALID [2022-04-08 09:27:21,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {79#true} call ULTIMATE.init(); {86#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:21,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {86#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {79#true} is VALID [2022-04-08 09:27:21,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {79#true} assume true; {79#true} is VALID [2022-04-08 09:27:21,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79#true} {79#true} #181#return; {79#true} is VALID [2022-04-08 09:27:21,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {79#true} call #t~ret10 := main(); {79#true} is VALID [2022-04-08 09:27:21,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {79#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {79#true} is VALID [2022-04-08 09:27:21,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {79#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {84#(<= 0 main_~main__t~0)} is VALID [2022-04-08 09:27:21,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {84#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {84#(<= 0 main_~main__t~0)} is VALID [2022-04-08 09:27:21,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {84#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {84#(<= 0 main_~main__t~0)} is VALID [2022-04-08 09:27:21,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {84#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {85#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-08 09:27:21,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {85#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {80#false} is VALID [2022-04-08 09:27:21,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {80#false} assume !false; {80#false} is VALID [2022-04-08 09:27:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:21,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:21,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181779889] [2022-04-08 09:27:21,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181779889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:21,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:21,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:21,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:21,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1926501169] [2022-04-08 09:27:21,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1926501169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:21,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:21,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:21,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381157992] [2022-04-08 09:27:21,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:21,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:27:21,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:21,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:21,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:21,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:27:21,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:21,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:27:21,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:27:21,983 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 71 states have internal predecessors, (99), 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.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:22,589 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2022-04-08 09:27:22,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:27:22,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:27:22,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-04-08 09:27:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-04-08 09:27:22,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 113 transitions. [2022-04-08 09:27:22,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:22,747 INFO L225 Difference]: With dead ends: 87 [2022-04-08 09:27:22,747 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 09:27:22,750 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:22,759 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 126 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:22,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 89 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 09:27:22,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-08 09:27:22,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:22,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:22,854 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:22,855 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:22,859 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-08 09:27:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-08 09:27:22,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:22,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:22,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-08 09:27:22,861 INFO L87 Difference]: Start difference. First operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-08 09:27:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:22,864 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-08 09:27:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-08 09:27:22,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:22,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:22,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:22,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-04-08 09:27:22,870 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2022-04-08 09:27:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:22,870 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-04-08 09:27:22,870 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:22,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 73 transitions. [2022-04-08 09:27:22,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-08 09:27:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 09:27:22,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:22,941 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:22,941 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:27:22,941 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:22,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash -384872930, now seen corresponding path program 1 times [2022-04-08 09:27:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:22,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1573413342] [2022-04-08 09:27:22,946 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:22,946 INFO L85 PathProgramCache]: Analyzing trace with hash -384872930, now seen corresponding path program 2 times [2022-04-08 09:27:22,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:22,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228498635] [2022-04-08 09:27:22,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:22,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:23,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:23,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {550#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {543#true} is VALID [2022-04-08 09:27:23,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-08 09:27:23,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {543#true} {543#true} #181#return; {543#true} is VALID [2022-04-08 09:27:23,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {543#true} call ULTIMATE.init(); {550#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:23,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {543#true} is VALID [2022-04-08 09:27:23,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-08 09:27:23,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {543#true} {543#true} #181#return; {543#true} is VALID [2022-04-08 09:27:23,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {543#true} call #t~ret10 := main(); {543#true} is VALID [2022-04-08 09:27:23,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {543#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {543#true} is VALID [2022-04-08 09:27:23,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {543#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {548#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-08 09:27:23,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {548#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {548#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-08 09:27:23,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {548#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {548#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-08 09:27:23,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {548#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {549#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-08 09:27:23,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {549#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {544#false} is VALID [2022-04-08 09:27:23,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#false} assume !false; {544#false} is VALID [2022-04-08 09:27:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:23,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:23,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228498635] [2022-04-08 09:27:23,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228498635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:23,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:23,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:23,031 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:23,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1573413342] [2022-04-08 09:27:23,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1573413342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:23,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:23,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:23,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544126140] [2022-04-08 09:27:23,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:23,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:27:23,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:23,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:23,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:23,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:27:23,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:23,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:27:23,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:27:23,047 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:23,515 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-04-08 09:27:23,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:27:23,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:27:23,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-04-08 09:27:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-04-08 09:27:23,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 117 transitions. [2022-04-08 09:27:23,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:23,615 INFO L225 Difference]: With dead ends: 111 [2022-04-08 09:27:23,616 INFO L226 Difference]: Without dead ends: 109 [2022-04-08 09:27:23,616 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:27:23,617 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 70 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:23,618 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 218 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:23,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-08 09:27:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 67. [2022-04-08 09:27:23,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:23,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:23,666 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:23,667 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:23,671 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-04-08 09:27:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-04-08 09:27:23,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:23,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:23,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-08 09:27:23,672 INFO L87 Difference]: Start difference. First operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-08 09:27:23,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:23,676 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-04-08 09:27:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-04-08 09:27:23,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:23,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:23,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:23,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:23,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-04-08 09:27:23,680 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2022-04-08 09:27:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:23,680 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-04-08 09:27:23,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:23,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 71 transitions. [2022-04-08 09:27:23,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:23,743 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-08 09:27:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 09:27:23,743 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:23,743 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:23,743 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:27:23,744 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash 853580642, now seen corresponding path program 1 times [2022-04-08 09:27:23,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:23,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1306600864] [2022-04-08 09:27:23,745 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:23,745 INFO L85 PathProgramCache]: Analyzing trace with hash 853580642, now seen corresponding path program 2 times [2022-04-08 09:27:23,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:23,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421613156] [2022-04-08 09:27:23,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:23,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:23,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {1140#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1133#true} is VALID [2022-04-08 09:27:23,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-08 09:27:23,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1133#true} {1133#true} #181#return; {1133#true} is VALID [2022-04-08 09:27:23,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {1133#true} call ULTIMATE.init(); {1140#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:23,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {1140#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1133#true} is VALID [2022-04-08 09:27:23,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-08 09:27:23,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1133#true} {1133#true} #181#return; {1133#true} is VALID [2022-04-08 09:27:23,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {1133#true} call #t~ret10 := main(); {1133#true} is VALID [2022-04-08 09:27:23,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {1133#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {1133#true} is VALID [2022-04-08 09:27:23,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {1133#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-08 09:27:23,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-08 09:27:23,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-08 09:27:23,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-08 09:27:23,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1139#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-08 09:27:23,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {1139#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {1134#false} is VALID [2022-04-08 09:27:23,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {1134#false} assume !false; {1134#false} is VALID [2022-04-08 09:27:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:23,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:23,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421613156] [2022-04-08 09:27:23,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421613156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:23,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:23,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:23,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:23,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1306600864] [2022-04-08 09:27:23,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1306600864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:23,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:23,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:23,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557395283] [2022-04-08 09:27:23,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:23,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:27:23,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:23,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:23,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:23,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:27:23,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:23,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:27:23,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:27:23,828 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:24,122 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-08 09:27:24,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:27:24,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:27:24,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-08 09:27:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-08 09:27:24,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2022-04-08 09:27:24,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:24,187 INFO L225 Difference]: With dead ends: 73 [2022-04-08 09:27:24,188 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 09:27:24,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:24,189 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:24,189 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 128 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 09:27:24,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-04-08 09:27:24,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:24,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,259 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,260 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:24,262 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-08 09:27:24,262 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-08 09:27:24,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:24,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:24,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-08 09:27:24,263 INFO L87 Difference]: Start difference. First operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-08 09:27:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:24,265 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-08 09:27:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-08 09:27:24,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:24,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:24,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:24,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-04-08 09:27:24,268 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2022-04-08 09:27:24,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:24,269 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-04-08 09:27:24,269 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 74 transitions. [2022-04-08 09:27:24,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:24,336 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-04-08 09:27:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:27:24,337 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:24,337 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:24,337 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 09:27:24,337 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:24,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:24,338 INFO L85 PathProgramCache]: Analyzing trace with hash -47660122, now seen corresponding path program 1 times [2022-04-08 09:27:24,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:24,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [188309712] [2022-04-08 09:27:24,338 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash -47660122, now seen corresponding path program 2 times [2022-04-08 09:27:24,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:24,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319017309] [2022-04-08 09:27:24,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:24,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:24,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:24,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {1583#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1575#true} is VALID [2022-04-08 09:27:24,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {1575#true} assume true; {1575#true} is VALID [2022-04-08 09:27:24,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1575#true} {1575#true} #181#return; {1575#true} is VALID [2022-04-08 09:27:24,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {1575#true} call ULTIMATE.init(); {1583#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:24,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {1583#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1575#true} is VALID [2022-04-08 09:27:24,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {1575#true} assume true; {1575#true} is VALID [2022-04-08 09:27:24,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1575#true} {1575#true} #181#return; {1575#true} is VALID [2022-04-08 09:27:24,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {1575#true} call #t~ret10 := main(); {1575#true} is VALID [2022-04-08 09:27:24,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {1575#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {1575#true} is VALID [2022-04-08 09:27:24,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {1575#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1580#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:24,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {1580#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {1580#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:24,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {1580#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {1580#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:24,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {1580#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1580#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:24,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1580#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:24,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {1580#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {1581#(<= 1 main_~main__t~0)} is VALID [2022-04-08 09:27:24,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {1581#(<= 1 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1582#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-08 09:27:24,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {1582#(not (= main_~__VERIFIER_assert__cond~2 0))} assume 0 == ~__VERIFIER_assert__cond~2; {1576#false} is VALID [2022-04-08 09:27:24,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#false} assume !false; {1576#false} is VALID [2022-04-08 09:27:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:24,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:24,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319017309] [2022-04-08 09:27:24,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319017309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:24,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:24,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:24,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:24,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [188309712] [2022-04-08 09:27:24,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [188309712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:24,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:24,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:24,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503912399] [2022-04-08 09:27:24,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:24,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:27:24,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:24,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:24,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:24,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:24,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:24,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:24,421 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:24,802 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-08 09:27:24,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:27:24,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:27:24,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-08 09:27:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-08 09:27:24,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2022-04-08 09:27:24,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:24,860 INFO L225 Difference]: With dead ends: 71 [2022-04-08 09:27:24,860 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 09:27:24,861 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:27:24,862 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 64 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:24,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 126 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:24,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 09:27:24,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-08 09:27:24,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:24,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,946 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,946 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:24,948 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-08 09:27:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-08 09:27:24,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:24,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:24,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-08 09:27:24,950 INFO L87 Difference]: Start difference. First operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-08 09:27:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:24,951 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-08 09:27:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-08 09:27:24,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:24,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:24,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:24,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-08 09:27:24,954 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2022-04-08 09:27:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:24,954 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-08 09:27:24,954 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:24,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2022-04-08 09:27:25,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:25,030 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-08 09:27:25,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:27:25,030 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:25,030 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:25,030 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 09:27:25,031 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:25,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1816251534, now seen corresponding path program 1 times [2022-04-08 09:27:25,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:25,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [609569326] [2022-04-08 09:27:25,032 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:25,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1816251534, now seen corresponding path program 2 times [2022-04-08 09:27:25,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:25,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11046792] [2022-04-08 09:27:25,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:25,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:25,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:25,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {2014#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2006#true} is VALID [2022-04-08 09:27:25,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-08 09:27:25,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2006#true} {2006#true} #181#return; {2006#true} is VALID [2022-04-08 09:27:25,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {2006#true} call ULTIMATE.init(); {2014#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:25,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {2014#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2006#true} is VALID [2022-04-08 09:27:25,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-08 09:27:25,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2006#true} {2006#true} #181#return; {2006#true} is VALID [2022-04-08 09:27:25,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {2006#true} call #t~ret10 := main(); {2006#true} is VALID [2022-04-08 09:27:25,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {2006#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {2006#true} is VALID [2022-04-08 09:27:25,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {2006#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2011#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:25,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {2011#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {2011#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:25,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {2011#(= main_~main__t~0 0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {2011#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:25,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {2011#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {2011#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:25,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {2011#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {2011#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:25,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {2011#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {2012#(<= 1 main_~main__t~0)} is VALID [2022-04-08 09:27:25,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {2012#(<= 1 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {2013#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-08 09:27:25,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {2013#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {2007#false} is VALID [2022-04-08 09:27:25,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {2007#false} assume !false; {2007#false} is VALID [2022-04-08 09:27:25,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:25,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:25,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11046792] [2022-04-08 09:27:25,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11046792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:25,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:25,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:25,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:25,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [609569326] [2022-04-08 09:27:25,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [609569326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:25,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:25,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:25,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040358524] [2022-04-08 09:27:25,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:25,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:27:25,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:25,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:25,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:25,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:25,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:25,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:25,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:25,154 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:25,523 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-08 09:27:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:27:25,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:27:25,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-08 09:27:25,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-08 09:27:25,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-08 09:27:25,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:25,585 INFO L225 Difference]: With dead ends: 69 [2022-04-08 09:27:25,585 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 09:27:25,585 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:27:25,586 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:25,586 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 120 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 09:27:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-08 09:27:25,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:25,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:25,671 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:25,671 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:25,673 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-08 09:27:25,673 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-08 09:27:25,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:25,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:25,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-08 09:27:25,674 INFO L87 Difference]: Start difference. First operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-08 09:27:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:25,680 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-08 09:27:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-08 09:27:25,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:25,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:25,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:25,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:25,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-04-08 09:27:25,682 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2022-04-08 09:27:25,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:25,682 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-04-08 09:27:25,682 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:25,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 70 transitions. [2022-04-08 09:27:25,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-08 09:27:25,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:27:25,750 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:25,750 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:25,750 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 09:27:25,750 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:25,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:25,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1477460696, now seen corresponding path program 1 times [2022-04-08 09:27:25,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:25,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2078583748] [2022-04-08 09:27:25,751 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:25,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1477460696, now seen corresponding path program 2 times [2022-04-08 09:27:25,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:25,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54409676] [2022-04-08 09:27:25,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:25,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:25,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:25,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {2432#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2425#true} is VALID [2022-04-08 09:27:25,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-08 09:27:25,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2425#true} {2425#true} #181#return; {2425#true} is VALID [2022-04-08 09:27:25,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {2425#true} call ULTIMATE.init(); {2432#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:25,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {2432#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2425#true} is VALID [2022-04-08 09:27:25,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-08 09:27:25,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2425#true} {2425#true} #181#return; {2425#true} is VALID [2022-04-08 09:27:25,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {2425#true} call #t~ret10 := main(); {2425#true} is VALID [2022-04-08 09:27:25,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {2425#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {2425#true} is VALID [2022-04-08 09:27:25,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {2425#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2425#true} is VALID [2022-04-08 09:27:25,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {2425#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {2425#true} is VALID [2022-04-08 09:27:25,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {2425#true} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {2425#true} is VALID [2022-04-08 09:27:25,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {2425#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2425#true} is VALID [2022-04-08 09:27:25,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {2425#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2425#true} is VALID [2022-04-08 09:27:25,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {2425#true} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {2425#true} is VALID [2022-04-08 09:27:25,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {2425#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2430#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:25,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {2430#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2431#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-08 09:27:25,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {2431#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {2426#false} is VALID [2022-04-08 09:27:25,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {2426#false} assume !false; {2426#false} is VALID [2022-04-08 09:27:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:25,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:25,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54409676] [2022-04-08 09:27:25,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54409676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:25,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:25,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:25,843 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:25,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2078583748] [2022-04-08 09:27:25,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2078583748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:25,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:25,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:25,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993680633] [2022-04-08 09:27:25,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:25,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 09:27:25,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:25,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:25,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:25,855 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:27:25,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:25,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:27:25,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:27:25,856 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:26,144 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-08 09:27:26,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:27:26,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 09:27:26,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-08 09:27:26,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:26,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-08 09:27:26,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-08 09:27:26,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:26,204 INFO L225 Difference]: With dead ends: 67 [2022-04-08 09:27:26,204 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 09:27:26,204 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:26,205 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:26,205 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 137 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 09:27:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-08 09:27:26,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:26,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:26,287 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:26,287 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:26,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:26,289 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-08 09:27:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-08 09:27:26,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:26,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:26,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-08 09:27:26,290 INFO L87 Difference]: Start difference. First operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-08 09:27:26,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:26,291 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-08 09:27:26,291 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-08 09:27:26,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:26,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:26,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:26,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-04-08 09:27:26,294 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 16 [2022-04-08 09:27:26,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:26,294 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-04-08 09:27:26,294 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:26,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 66 transitions. [2022-04-08 09:27:26,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:26,357 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-08 09:27:26,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:27:26,358 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:26,358 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:26,358 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 09:27:26,358 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:26,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:26,359 INFO L85 PathProgramCache]: Analyzing trace with hash 469655877, now seen corresponding path program 1 times [2022-04-08 09:27:26,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:26,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1664401872] [2022-04-08 09:27:26,360 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:26,360 INFO L85 PathProgramCache]: Analyzing trace with hash 469655877, now seen corresponding path program 2 times [2022-04-08 09:27:26,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:26,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075496576] [2022-04-08 09:27:26,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:26,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:26,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:26,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {2832#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2824#true} is VALID [2022-04-08 09:27:26,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {2824#true} assume true; {2824#true} is VALID [2022-04-08 09:27:26,408 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2824#true} {2824#true} #181#return; {2824#true} is VALID [2022-04-08 09:27:26,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {2824#true} call ULTIMATE.init(); {2832#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:26,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {2832#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2824#true} is VALID [2022-04-08 09:27:26,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {2824#true} assume true; {2824#true} is VALID [2022-04-08 09:27:26,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2824#true} {2824#true} #181#return; {2824#true} is VALID [2022-04-08 09:27:26,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {2824#true} call #t~ret10 := main(); {2824#true} is VALID [2022-04-08 09:27:26,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {2824#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {2824#true} is VALID [2022-04-08 09:27:26,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {2824#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2829#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:26,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {2829#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {2829#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:26,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {2829#(= main_~main__t~0 0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {2829#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:26,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {2829#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {2829#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:26,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {2829#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {2829#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:26,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {2829#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {2830#(<= 1 main_~main__t~0)} is VALID [2022-04-08 09:27:26,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {2830#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {2830#(<= 1 main_~main__t~0)} is VALID [2022-04-08 09:27:26,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {2830#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {2831#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-08 09:27:26,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {2831#(not (= main_~__VERIFIER_assert__cond~16 0))} assume 0 == ~__VERIFIER_assert__cond~16; {2825#false} is VALID [2022-04-08 09:27:26,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {2825#false} assume !false; {2825#false} is VALID [2022-04-08 09:27:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:26,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:26,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075496576] [2022-04-08 09:27:26,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075496576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:26,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:26,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:26,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:26,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1664401872] [2022-04-08 09:27:26,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1664401872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:26,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:26,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:26,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006283027] [2022-04-08 09:27:26,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:26,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 09:27:26,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:26,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:26,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:26,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:26,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:26,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:26,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:26,429 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:26,972 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2022-04-08 09:27:26,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:27:26,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 09:27:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-08 09:27:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-08 09:27:26,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2022-04-08 09:27:27,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:27,064 INFO L225 Difference]: With dead ends: 104 [2022-04-08 09:27:27,065 INFO L226 Difference]: Without dead ends: 102 [2022-04-08 09:27:27,065 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:27:27,068 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 96 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:27,068 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 157 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:27:27,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-08 09:27:27,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 60. [2022-04-08 09:27:27,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:27,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:27,140 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:27,141 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:27,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:27,143 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-04-08 09:27:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-04-08 09:27:27,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:27,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:27,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-08 09:27:27,144 INFO L87 Difference]: Start difference. First operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-08 09:27:27,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:27,146 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-04-08 09:27:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-04-08 09:27:27,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:27,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:27,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:27,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-04-08 09:27:27,148 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2022-04-08 09:27:27,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:27,149 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-04-08 09:27:27,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:27,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 64 transitions. [2022-04-08 09:27:27,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-08 09:27:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:27:27,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:27,221 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:27,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 09:27:27,222 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:27,222 INFO L85 PathProgramCache]: Analyzing trace with hash 469225894, now seen corresponding path program 1 times [2022-04-08 09:27:27,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:27,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1067852846] [2022-04-08 09:27:27,223 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:27,224 INFO L85 PathProgramCache]: Analyzing trace with hash 469225894, now seen corresponding path program 2 times [2022-04-08 09:27:27,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:27,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982419576] [2022-04-08 09:27:27,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:27,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:27,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:27,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {3378#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3371#true} is VALID [2022-04-08 09:27:27,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {3371#true} assume true; {3371#true} is VALID [2022-04-08 09:27:27,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3371#true} {3371#true} #181#return; {3371#true} is VALID [2022-04-08 09:27:27,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {3371#true} call ULTIMATE.init(); {3378#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:27,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {3378#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3371#true} is VALID [2022-04-08 09:27:27,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#true} assume true; {3371#true} is VALID [2022-04-08 09:27:27,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3371#true} {3371#true} #181#return; {3371#true} is VALID [2022-04-08 09:27:27,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {3371#true} call #t~ret10 := main(); {3371#true} is VALID [2022-04-08 09:27:27,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {3371#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {3371#true} is VALID [2022-04-08 09:27:27,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {3371#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3371#true} is VALID [2022-04-08 09:27:27,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {3371#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {3371#true} is VALID [2022-04-08 09:27:27,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {3371#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {3371#true} is VALID [2022-04-08 09:27:27,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {3371#true} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {3371#true} is VALID [2022-04-08 09:27:27,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {3371#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {3371#true} is VALID [2022-04-08 09:27:27,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {3371#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {3371#true} is VALID [2022-04-08 09:27:27,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {3371#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {3376#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:27,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {3376#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {3377#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-08 09:27:27,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {3377#(not (= main_~__VERIFIER_assert__cond~15 0))} assume 0 == ~__VERIFIER_assert__cond~15; {3372#false} is VALID [2022-04-08 09:27:27,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {3372#false} assume !false; {3372#false} is VALID [2022-04-08 09:27:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:27,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:27,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982419576] [2022-04-08 09:27:27,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982419576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:27,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:27,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:27,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:27,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1067852846] [2022-04-08 09:27:27,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1067852846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:27,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:27,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:27,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238257965] [2022-04-08 09:27:27,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:27,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 09:27:27,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:27,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:27,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:27,329 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:27:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:27:27,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:27:27,330 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:27,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:27,610 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-08 09:27:27,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:27:27,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 09:27:27,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-08 09:27:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-08 09:27:27,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-04-08 09:27:27,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:27,659 INFO L225 Difference]: With dead ends: 61 [2022-04-08 09:27:27,659 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 09:27:27,659 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:27,659 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:27,660 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 125 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:27,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 09:27:27,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-04-08 09:27:27,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:27,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:27,736 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:27,736 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:27,738 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-08 09:27:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-08 09:27:27,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:27,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:27,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-08 09:27:27,739 INFO L87 Difference]: Start difference. First operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-08 09:27:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:27,740 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-08 09:27:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-08 09:27:27,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:27,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:27,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:27,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-08 09:27:27,742 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2022-04-08 09:27:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:27,743 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-08 09:27:27,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:27,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2022-04-08 09:27:27,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-08 09:27:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:27:27,813 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:27,813 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:27,814 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 09:27:27,814 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:27,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:27,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1457581016, now seen corresponding path program 1 times [2022-04-08 09:27:27,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:27,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [373597334] [2022-04-08 09:27:27,815 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:27,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1457581016, now seen corresponding path program 2 times [2022-04-08 09:27:27,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:27,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398662258] [2022-04-08 09:27:27,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:27,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:27,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:27,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {3741#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3733#true} is VALID [2022-04-08 09:27:27,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-08 09:27:27,907 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3733#true} {3733#true} #181#return; {3733#true} is VALID [2022-04-08 09:27:27,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {3733#true} call ULTIMATE.init(); {3741#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:27,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {3741#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3733#true} is VALID [2022-04-08 09:27:27,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-08 09:27:27,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3733#true} {3733#true} #181#return; {3733#true} is VALID [2022-04-08 09:27:27,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {3733#true} call #t~ret10 := main(); {3733#true} is VALID [2022-04-08 09:27:27,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {3733#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {3733#true} is VALID [2022-04-08 09:27:27,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {3733#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3738#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:27,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {3738#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {3738#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:27,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {3738#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {3738#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:27,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {3738#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3738#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:27,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {3738#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3738#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:27,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {3738#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {3739#(<= 1 main_~main__t~0)} is VALID [2022-04-08 09:27:27,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {3739#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {3739#(<= 1 main_~main__t~0)} is VALID [2022-04-08 09:27:27,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {3739#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {3739#(<= 1 main_~main__t~0)} is VALID [2022-04-08 09:27:27,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {3739#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3740#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-08 09:27:27,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {3740#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {3734#false} is VALID [2022-04-08 09:27:27,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {3734#false} assume !false; {3734#false} is VALID [2022-04-08 09:27:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:27,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:27,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398662258] [2022-04-08 09:27:27,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398662258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:27,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:27,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:27,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:27,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [373597334] [2022-04-08 09:27:27,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [373597334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:27,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:27,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:27,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41409665] [2022-04-08 09:27:27,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:27,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:27:27,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:27,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:27,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:27,935 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:27,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:27,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:27,935 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:28,300 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-04-08 09:27:28,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:27:28,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:27:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-08 09:27:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-08 09:27:28,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-08 09:27:28,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:28,359 INFO L225 Difference]: With dead ends: 74 [2022-04-08 09:27:28,359 INFO L226 Difference]: Without dead ends: 72 [2022-04-08 09:27:28,360 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:27:28,360 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 72 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:28,360 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 116 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:28,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-08 09:27:28,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2022-04-08 09:27:28,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:28,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,419 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,420 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:28,421 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-08 09:27:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-08 09:27:28,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:28,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:28,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-08 09:27:28,422 INFO L87 Difference]: Start difference. First operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-08 09:27:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:28,423 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-08 09:27:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-08 09:27:28,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:28,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:28,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:28,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-08 09:27:28,425 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2022-04-08 09:27:28,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:28,426 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-08 09:27:28,426 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 58 transitions. [2022-04-08 09:27:28,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-08 09:27:28,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:27:28,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:28,484 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:28,484 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 09:27:28,484 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:28,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:28,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1459120216, now seen corresponding path program 1 times [2022-04-08 09:27:28,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:28,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1546774078] [2022-04-08 09:27:28,485 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:28,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1459120216, now seen corresponding path program 2 times [2022-04-08 09:27:28,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:28,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156265508] [2022-04-08 09:27:28,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:28,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:28,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:28,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {4156#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4148#true} is VALID [2022-04-08 09:27:28,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 09:27:28,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4148#true} {4148#true} #181#return; {4148#true} is VALID [2022-04-08 09:27:28,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4156#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:28,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {4156#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4148#true} is VALID [2022-04-08 09:27:28,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 09:27:28,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4148#true} {4148#true} #181#return; {4148#true} is VALID [2022-04-08 09:27:28,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {4148#true} call #t~ret10 := main(); {4148#true} is VALID [2022-04-08 09:27:28,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {4148#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {4148#true} is VALID [2022-04-08 09:27:28,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {4148#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4153#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:28,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {4153#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {4153#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:28,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {4153#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {4153#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:28,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {4153#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4153#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:28,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {4153#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4153#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:28,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {4153#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {4154#(<= 1 main_~main__t~0)} is VALID [2022-04-08 09:27:28,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {4154#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {4154#(<= 1 main_~main__t~0)} is VALID [2022-04-08 09:27:28,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {4154#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet8;havoc #t~nondet8; {4154#(<= 1 main_~main__t~0)} is VALID [2022-04-08 09:27:28,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {4154#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4155#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-08 09:27:28,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {4155#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {4149#false} is VALID [2022-04-08 09:27:28,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-08 09:27:28,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:28,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:28,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156265508] [2022-04-08 09:27:28,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156265508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:28,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:28,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:28,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:28,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1546774078] [2022-04-08 09:27:28,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1546774078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:28,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:28,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:28,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517049868] [2022-04-08 09:27:28,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:28,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:27:28,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:28,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:28,553 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:28,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:28,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:28,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:28,554 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:28,850 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-08 09:27:28,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:27:28,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:27:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-08 09:27:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-08 09:27:28,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-08 09:27:28,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:28,893 INFO L225 Difference]: With dead ends: 55 [2022-04-08 09:27:28,893 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 09:27:28,893 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:27:28,894 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:28,894 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 90 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 09:27:28,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-08 09:27:28,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:28,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,948 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,948 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:28,950 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-08 09:27:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-08 09:27:28,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:28,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:28,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-08 09:27:28,950 INFO L87 Difference]: Start difference. First operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-08 09:27:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:28,951 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-08 09:27:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-08 09:27:28,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:28,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:28,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:28,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-08 09:27:28,953 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2022-04-08 09:27:28,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:28,953 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-08 09:27:28,953 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:28,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-08 09:27:29,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-08 09:27:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:27:29,010 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:29,010 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:29,010 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 09:27:29,010 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:29,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:29,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1674433506, now seen corresponding path program 1 times [2022-04-08 09:27:29,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:29,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [348049278] [2022-04-08 09:27:29,011 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:29,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1674433506, now seen corresponding path program 2 times [2022-04-08 09:27:29,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:29,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415219850] [2022-04-08 09:27:29,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:29,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:29,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:29,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {4492#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4483#true} is VALID [2022-04-08 09:27:29,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {4483#true} assume true; {4483#true} is VALID [2022-04-08 09:27:29,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4483#true} {4483#true} #181#return; {4483#true} is VALID [2022-04-08 09:27:29,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {4483#true} call ULTIMATE.init(); {4492#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:29,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {4492#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4483#true} is VALID [2022-04-08 09:27:29,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {4483#true} assume true; {4483#true} is VALID [2022-04-08 09:27:29,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4483#true} {4483#true} #181#return; {4483#true} is VALID [2022-04-08 09:27:29,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {4483#true} call #t~ret10 := main(); {4483#true} is VALID [2022-04-08 09:27:29,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {4483#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {4483#true} is VALID [2022-04-08 09:27:29,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {4483#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4488#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-08 09:27:29,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {4488#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:29,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:29,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:29,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:29,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {4490#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:29,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {4490#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {4490#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:29,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {4490#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4490#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:29,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {4490#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4491#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-08 09:27:29,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {4491#(not (= main_~__VERIFIER_assert__cond~17 0))} assume 0 == ~__VERIFIER_assert__cond~17; {4484#false} is VALID [2022-04-08 09:27:29,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {4484#false} assume !false; {4484#false} is VALID [2022-04-08 09:27:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:29,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:29,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415219850] [2022-04-08 09:27:29,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415219850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:29,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:29,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:29,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:29,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [348049278] [2022-04-08 09:27:29,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [348049278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:29,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:29,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:29,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155634827] [2022-04-08 09:27:29,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:29,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:27:29,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:29,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:29,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:29,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:27:29,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:29,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:27:29,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:29,174 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:29,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:29,801 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-04-08 09:27:29,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:27:29,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:27:29,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-08 09:27:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-08 09:27:29,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 119 transitions. [2022-04-08 09:27:29,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:29,888 INFO L225 Difference]: With dead ends: 110 [2022-04-08 09:27:29,888 INFO L226 Difference]: Without dead ends: 108 [2022-04-08 09:27:29,888 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:27:29,889 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 82 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:29,889 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 203 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:27:29,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-08 09:27:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 57. [2022-04-08 09:27:30,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:30,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:30,007 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:30,008 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:30,012 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-04-08 09:27:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-04-08 09:27:30,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:30,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:30,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-08 09:27:30,013 INFO L87 Difference]: Start difference. First operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-08 09:27:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:30,015 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-04-08 09:27:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-04-08 09:27:30,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:30,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:30,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:30,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-04-08 09:27:30,017 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 17 [2022-04-08 09:27:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:30,017 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-04-08 09:27:30,017 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:30,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 62 transitions. [2022-04-08 09:27:30,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-08 09:27:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 09:27:30,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:30,084 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:30,084 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 09:27:30,084 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:30,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:30,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2058260233, now seen corresponding path program 1 times [2022-04-08 09:27:30,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:30,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [500434446] [2022-04-08 09:27:30,085 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:30,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2058260233, now seen corresponding path program 2 times [2022-04-08 09:27:30,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:30,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579559979] [2022-04-08 09:27:30,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:30,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:30,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:30,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {5059#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5051#true} is VALID [2022-04-08 09:27:30,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {5051#true} assume true; {5051#true} is VALID [2022-04-08 09:27:30,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5051#true} {5051#true} #181#return; {5051#true} is VALID [2022-04-08 09:27:30,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {5051#true} call ULTIMATE.init(); {5059#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:30,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {5059#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5051#true} is VALID [2022-04-08 09:27:30,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {5051#true} assume true; {5051#true} is VALID [2022-04-08 09:27:30,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5051#true} {5051#true} #181#return; {5051#true} is VALID [2022-04-08 09:27:30,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {5051#true} call #t~ret10 := main(); {5051#true} is VALID [2022-04-08 09:27:30,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {5051#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {5051#true} is VALID [2022-04-08 09:27:30,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {5051#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5056#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:30,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {5056#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {5056#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:30,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {5056#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {5056#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:30,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {5056#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5056#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:30,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {5056#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5056#(= main_~main__t~0 0)} is VALID [2022-04-08 09:27:30,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {5056#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5057#(<= 1 main_~main__t~0)} is VALID [2022-04-08 09:27:30,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {5057#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {5057#(<= 1 main_~main__t~0)} is VALID [2022-04-08 09:27:30,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {5057#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {5057#(<= 1 main_~main__t~0)} is VALID [2022-04-08 09:27:30,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {5057#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_4~0); {5057#(<= 1 main_~main__t~0)} is VALID [2022-04-08 09:27:30,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {5057#(<= 1 main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5058#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-08 09:27:30,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {5058#(not (= main_~__VERIFIER_assert__cond~8 0))} assume 0 == ~__VERIFIER_assert__cond~8; {5052#false} is VALID [2022-04-08 09:27:30,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {5052#false} assume !false; {5052#false} is VALID [2022-04-08 09:27:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:30,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:30,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579559979] [2022-04-08 09:27:30,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579559979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:30,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:30,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:30,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:30,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [500434446] [2022-04-08 09:27:30,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [500434446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:30,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:30,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:30,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595086411] [2022-04-08 09:27:30,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:30,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 09:27:30,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:30,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:30,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:30,160 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:30,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:30,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:30,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:30,160 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:30,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:30,588 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-04-08 09:27:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:27:30,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 09:27:30,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-08 09:27:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-08 09:27:30,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-08 09:27:30,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:30,641 INFO L225 Difference]: With dead ends: 77 [2022-04-08 09:27:30,642 INFO L226 Difference]: Without dead ends: 75 [2022-04-08 09:27:30,642 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:27:30,642 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 63 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:30,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 108 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-08 09:27:30,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2022-04-08 09:27:30,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:30,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:30,750 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:30,751 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:30,752 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-08 09:27:30,752 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-08 09:27:30,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:30,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:30,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-08 09:27:30,753 INFO L87 Difference]: Start difference. First operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-08 09:27:30,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:30,754 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-08 09:27:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-08 09:27:30,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:30,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:30,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:30,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-04-08 09:27:30,755 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 18 [2022-04-08 09:27:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:30,756 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-04-08 09:27:30,756 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:30,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 60 transitions. [2022-04-08 09:27:30,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-04-08 09:27:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 09:27:30,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:30,828 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:30,828 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 09:27:30,828 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:30,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:30,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2059625653, now seen corresponding path program 1 times [2022-04-08 09:27:30,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:30,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [877668887] [2022-04-08 09:27:30,829 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:30,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2059625653, now seen corresponding path program 2 times [2022-04-08 09:27:30,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:30,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141716763] [2022-04-08 09:27:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:30,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:30,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {5489#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5480#true} is VALID [2022-04-08 09:27:30,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:27:30,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5480#true} {5480#true} #181#return; {5480#true} is VALID [2022-04-08 09:27:30,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {5480#true} call ULTIMATE.init(); {5489#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:30,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {5489#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5480#true} is VALID [2022-04-08 09:27:30,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:27:30,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5480#true} #181#return; {5480#true} is VALID [2022-04-08 09:27:30,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {5480#true} call #t~ret10 := main(); {5480#true} is VALID [2022-04-08 09:27:30,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {5480#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {5480#true} is VALID [2022-04-08 09:27:30,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {5480#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5485#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-08 09:27:30,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {5485#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:30,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:30,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:30,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:30,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:30,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:30,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:30,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:30,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5488#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-08 09:27:30,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {5488#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {5481#false} is VALID [2022-04-08 09:27:30,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {5481#false} assume !false; {5481#false} is VALID [2022-04-08 09:27:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:30,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:30,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141716763] [2022-04-08 09:27:30,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141716763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:30,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:30,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:30,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:30,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [877668887] [2022-04-08 09:27:30,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [877668887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:30,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:30,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:30,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362013001] [2022-04-08 09:27:30,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:30,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 09:27:30,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:30,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:30,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:30,974 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:27:30,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:30,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:27:30,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:30,975 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:31,487 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-08 09:27:31,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:27:31,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 09:27:31,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-08 09:27:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-08 09:27:31,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-08 09:27:31,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:31,568 INFO L225 Difference]: With dead ends: 92 [2022-04-08 09:27:31,568 INFO L226 Difference]: Without dead ends: 90 [2022-04-08 09:27:31,568 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:27:31,569 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 61 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:31,569 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 146 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-08 09:27:31,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2022-04-08 09:27:31,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:31,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:31,668 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:31,668 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:31,669 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-04-08 09:27:31,669 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-04-08 09:27:31,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:31,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:31,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-08 09:27:31,670 INFO L87 Difference]: Start difference. First operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-08 09:27:31,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:31,671 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-04-08 09:27:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-04-08 09:27:31,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:31,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:31,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:31,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-04-08 09:27:31,672 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 18 [2022-04-08 09:27:31,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:31,673 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-04-08 09:27:31,673 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:31,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 67 transitions. [2022-04-08 09:27:31,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:31,759 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-08 09:27:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 09:27:31,760 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:31,760 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:31,760 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 09:27:31,760 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:31,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:31,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2011910403, now seen corresponding path program 1 times [2022-04-08 09:27:31,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:31,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2123226565] [2022-04-08 09:27:31,761 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:31,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2011910403, now seen corresponding path program 2 times [2022-04-08 09:27:31,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:31,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103886991] [2022-04-08 09:27:31,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:31,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:31,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:31,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {5991#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5982#true} is VALID [2022-04-08 09:27:31,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {5982#true} assume true; {5982#true} is VALID [2022-04-08 09:27:31,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5982#true} {5982#true} #181#return; {5982#true} is VALID [2022-04-08 09:27:31,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {5982#true} call ULTIMATE.init(); {5991#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:31,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {5991#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5982#true} is VALID [2022-04-08 09:27:31,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {5982#true} assume true; {5982#true} is VALID [2022-04-08 09:27:31,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5982#true} {5982#true} #181#return; {5982#true} is VALID [2022-04-08 09:27:31,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {5982#true} call #t~ret10 := main(); {5982#true} is VALID [2022-04-08 09:27:31,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {5982#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {5982#true} is VALID [2022-04-08 09:27:31,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {5982#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5987#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-08 09:27:31,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {5987#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:31,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:31,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:31,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:31,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:31,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:31,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet8;havoc #t~nondet8; {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:31,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:31,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {5990#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-08 09:27:31,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {5990#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {5983#false} is VALID [2022-04-08 09:27:31,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {5983#false} assume !false; {5983#false} is VALID [2022-04-08 09:27:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:31,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:31,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103886991] [2022-04-08 09:27:31,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103886991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:31,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:31,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:31,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:31,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2123226565] [2022-04-08 09:27:31,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2123226565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:31,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:31,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:31,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611370775] [2022-04-08 09:27:31,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:31,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 09:27:31,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:31,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:31,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:31,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:27:31,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:31,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:27:31,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:31,923 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:32,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:32,314 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-08 09:27:32,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:27:32,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 09:27:32,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-08 09:27:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-08 09:27:32,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2022-04-08 09:27:32,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:32,369 INFO L225 Difference]: With dead ends: 76 [2022-04-08 09:27:32,369 INFO L226 Difference]: Without dead ends: 72 [2022-04-08 09:27:32,369 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:27:32,369 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 40 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:32,369 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 111 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:32,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-08 09:27:32,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2022-04-08 09:27:32,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:32,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:32,460 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:32,460 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:32,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:32,461 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-08 09:27:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-04-08 09:27:32,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:32,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:32,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-08 09:27:32,462 INFO L87 Difference]: Start difference. First operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-08 09:27:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:32,463 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-08 09:27:32,463 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-04-08 09:27:32,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:32,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:32,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:32,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-04-08 09:27:32,465 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 18 [2022-04-08 09:27:32,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:32,465 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-04-08 09:27:32,465 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:32,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 68 transitions. [2022-04-08 09:27:32,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-08 09:27:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 09:27:32,541 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:32,541 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:32,541 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 09:27:32,541 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:32,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:32,542 INFO L85 PathProgramCache]: Analyzing trace with hash 361585193, now seen corresponding path program 1 times [2022-04-08 09:27:32,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:32,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [548112688] [2022-04-08 09:27:32,542 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:32,542 INFO L85 PathProgramCache]: Analyzing trace with hash 361585193, now seen corresponding path program 2 times [2022-04-08 09:27:32,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:32,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408310485] [2022-04-08 09:27:32,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:32,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:32,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:32,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {6427#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6418#true} is VALID [2022-04-08 09:27:32,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {6418#true} assume true; {6418#true} is VALID [2022-04-08 09:27:32,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6418#true} {6418#true} #181#return; {6418#true} is VALID [2022-04-08 09:27:32,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {6418#true} call ULTIMATE.init(); {6427#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:32,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {6427#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6418#true} is VALID [2022-04-08 09:27:32,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {6418#true} assume true; {6418#true} is VALID [2022-04-08 09:27:32,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6418#true} {6418#true} #181#return; {6418#true} is VALID [2022-04-08 09:27:32,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {6418#true} call #t~ret10 := main(); {6418#true} is VALID [2022-04-08 09:27:32,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {6418#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {6418#true} is VALID [2022-04-08 09:27:32,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {6418#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6423#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-08 09:27:32,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {6423#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:32,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:32,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:32,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:32,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:32,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:32,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:32,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:32,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6426#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-08 09:27:32,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {6426#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {6419#false} is VALID [2022-04-08 09:27:32,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {6419#false} assume !false; {6419#false} is VALID [2022-04-08 09:27:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:32,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:32,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408310485] [2022-04-08 09:27:32,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408310485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:32,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:32,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:32,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:32,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [548112688] [2022-04-08 09:27:32,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [548112688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:32,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:32,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:32,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827426744] [2022-04-08 09:27:32,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:32,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 09:27:32,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:32,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:32,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:32,666 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:27:32,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:32,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:27:32,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:32,667 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:33,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:33,030 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-08 09:27:33,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:27:33,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 09:27:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2022-04-08 09:27:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2022-04-08 09:27:33,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 79 transitions. [2022-04-08 09:27:33,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:33,104 INFO L225 Difference]: With dead ends: 72 [2022-04-08 09:27:33,104 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 09:27:33,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:27:33,105 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 70 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:33,105 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 96 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 09:27:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-04-08 09:27:33,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:33,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:33,205 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:33,205 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:33,206 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-08 09:27:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-08 09:27:33,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:33,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:33,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-08 09:27:33,207 INFO L87 Difference]: Start difference. First operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-08 09:27:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:33,208 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-08 09:27:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-08 09:27:33,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:33,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:33,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:33,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:33,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-04-08 09:27:33,210 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 18 [2022-04-08 09:27:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:33,210 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-04-08 09:27:33,210 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:33,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 71 transitions. [2022-04-08 09:27:33,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-08 09:27:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 09:27:33,296 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:33,296 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:33,296 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 09:27:33,296 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:33,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:33,296 INFO L85 PathProgramCache]: Analyzing trace with hash 618445355, now seen corresponding path program 1 times [2022-04-08 09:27:33,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:33,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1257668070] [2022-04-08 09:27:33,297 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:33,297 INFO L85 PathProgramCache]: Analyzing trace with hash 618445355, now seen corresponding path program 2 times [2022-04-08 09:27:33,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:33,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549584442] [2022-04-08 09:27:33,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:33,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:33,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:33,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {6859#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6850#true} is VALID [2022-04-08 09:27:33,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {6850#true} assume true; {6850#true} is VALID [2022-04-08 09:27:33,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6850#true} {6850#true} #181#return; {6850#true} is VALID [2022-04-08 09:27:33,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {6850#true} call ULTIMATE.init(); {6859#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:33,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {6859#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6850#true} is VALID [2022-04-08 09:27:33,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {6850#true} assume true; {6850#true} is VALID [2022-04-08 09:27:33,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6850#true} {6850#true} #181#return; {6850#true} is VALID [2022-04-08 09:27:33,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {6850#true} call #t~ret10 := main(); {6850#true} is VALID [2022-04-08 09:27:33,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {6850#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {6850#true} is VALID [2022-04-08 09:27:33,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {6850#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6855#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-08 09:27:33,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {6855#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:33,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:33,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:33,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:33,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:33,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:33,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:33,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_4~0); {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:33,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 09:27:33,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6858#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-08 09:27:33,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {6858#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {6851#false} is VALID [2022-04-08 09:27:33,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {6851#false} assume !false; {6851#false} is VALID [2022-04-08 09:27:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:33,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:33,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549584442] [2022-04-08 09:27:33,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549584442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:33,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:33,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:33,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:33,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1257668070] [2022-04-08 09:27:33,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1257668070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:33,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:33,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:33,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560573022] [2022-04-08 09:27:33,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:33,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 09:27:33,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:33,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:33,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:33,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:27:33,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:33,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:27:33,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:33,433 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:34,014 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-08 09:27:34,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:27:34,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 09:27:34,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-04-08 09:27:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-04-08 09:27:34,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 100 transitions. [2022-04-08 09:27:34,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:34,095 INFO L225 Difference]: With dead ends: 91 [2022-04-08 09:27:34,095 INFO L226 Difference]: Without dead ends: 89 [2022-04-08 09:27:34,096 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:27:34,096 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 49 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:34,096 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 199 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-08 09:27:34,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-08 09:27:34,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:34,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,232 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,232 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:34,233 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-04-08 09:27:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-04-08 09:27:34,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:34,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:34,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-08 09:27:34,234 INFO L87 Difference]: Start difference. First operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-08 09:27:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:34,236 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-04-08 09:27:34,236 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-04-08 09:27:34,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:34,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:34,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:34,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-04-08 09:27:34,238 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 19 [2022-04-08 09:27:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:34,238 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-04-08 09:27:34,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 74 transitions. [2022-04-08 09:27:34,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-08 09:27:34,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:27:34,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:34,326 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:34,326 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 09:27:34,326 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:34,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:34,327 INFO L85 PathProgramCache]: Analyzing trace with hash 679767566, now seen corresponding path program 1 times [2022-04-08 09:27:34,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:34,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [899110139] [2022-04-08 09:27:34,327 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:34,327 INFO L85 PathProgramCache]: Analyzing trace with hash 679767566, now seen corresponding path program 2 times [2022-04-08 09:27:34,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:34,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168496374] [2022-04-08 09:27:34,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:34,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:34,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:34,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {7369#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {7362#true} is VALID [2022-04-08 09:27:34,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {7362#true} assume true; {7362#true} is VALID [2022-04-08 09:27:34,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7362#true} {7362#true} #181#return; {7362#true} is VALID [2022-04-08 09:27:34,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {7362#true} call ULTIMATE.init(); {7369#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:34,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {7369#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {7362#true} is VALID [2022-04-08 09:27:34,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {7362#true} assume true; {7362#true} is VALID [2022-04-08 09:27:34,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7362#true} {7362#true} #181#return; {7362#true} is VALID [2022-04-08 09:27:34,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {7362#true} call #t~ret10 := main(); {7362#true} is VALID [2022-04-08 09:27:34,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {7362#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {7362#true} is VALID [2022-04-08 09:27:34,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {7362#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:34,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:34,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:34,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:34,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:34,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:34,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:34,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:34,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:34,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:34,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:34,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7368#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-08 09:27:34,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {7368#(not (= main_~__VERIFIER_assert__cond~6 0))} assume 0 == ~__VERIFIER_assert__cond~6; {7363#false} is VALID [2022-04-08 09:27:34,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {7363#false} assume !false; {7363#false} is VALID [2022-04-08 09:27:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:34,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:34,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168496374] [2022-04-08 09:27:34,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168496374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:34,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:34,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:34,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:34,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [899110139] [2022-04-08 09:27:34,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [899110139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:34,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:34,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:34,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861938847] [2022-04-08 09:27:34,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:34,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 09:27:34,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:34,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:34,396 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:27:34,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:34,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:27:34,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:27:34,397 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:34,652 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-08 09:27:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:27:34,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 09:27:34,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-08 09:27:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-08 09:27:34,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-08 09:27:34,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:34,694 INFO L225 Difference]: With dead ends: 67 [2022-04-08 09:27:34,694 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 09:27:34,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:34,695 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:34,695 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 74 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:27:34,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 09:27:34,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-08 09:27:34,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:34,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,843 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,843 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:34,844 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-08 09:27:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-08 09:27:34,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:34,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:34,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-08 09:27:34,845 INFO L87 Difference]: Start difference. First operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-08 09:27:34,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:34,846 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-08 09:27:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-08 09:27:34,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:34,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:34,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:34,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-04-08 09:27:34,848 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 20 [2022-04-08 09:27:34,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:34,848 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-04-08 09:27:34,848 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:34,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 72 transitions. [2022-04-08 09:27:34,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-08 09:27:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 09:27:34,945 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:34,946 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:34,946 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 09:27:34,946 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:34,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:34,946 INFO L85 PathProgramCache]: Analyzing trace with hash -402038812, now seen corresponding path program 1 times [2022-04-08 09:27:34,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:34,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [323874747] [2022-04-08 09:27:34,946 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash -402038812, now seen corresponding path program 2 times [2022-04-08 09:27:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:34,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345723926] [2022-04-08 09:27:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:34,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:34,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:34,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {7777#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {7770#true} is VALID [2022-04-08 09:27:34,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {7770#true} assume true; {7770#true} is VALID [2022-04-08 09:27:34,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7770#true} {7770#true} #181#return; {7770#true} is VALID [2022-04-08 09:27:34,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {7770#true} call ULTIMATE.init(); {7777#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:34,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {7777#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {7770#true} is VALID [2022-04-08 09:27:34,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {7770#true} assume true; {7770#true} is VALID [2022-04-08 09:27:34,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7770#true} {7770#true} #181#return; {7770#true} is VALID [2022-04-08 09:27:34,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {7770#true} call #t~ret10 := main(); {7770#true} is VALID [2022-04-08 09:27:34,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {7770#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {7770#true} is VALID [2022-04-08 09:27:34,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {7770#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7770#true} is VALID [2022-04-08 09:27:34,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {7770#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {7770#true} is VALID [2022-04-08 09:27:34,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {7770#true} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {7770#true} is VALID [2022-04-08 09:27:34,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {7770#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7770#true} is VALID [2022-04-08 09:27:34,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {7770#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7770#true} is VALID [2022-04-08 09:27:34,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {7770#true} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {7770#true} is VALID [2022-04-08 09:27:34,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {7770#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {7770#true} is VALID [2022-04-08 09:27:34,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {7770#true} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {7770#true} is VALID [2022-04-08 09:27:34,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {7770#true} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7770#true} is VALID [2022-04-08 09:27:34,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {7770#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7770#true} is VALID [2022-04-08 09:27:34,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {7770#true} assume !(0 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {7770#true} is VALID [2022-04-08 09:27:34,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {7770#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7775#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:34,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {7775#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7776#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-08 09:27:34,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {7776#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {7771#false} is VALID [2022-04-08 09:27:34,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {7771#false} assume !false; {7771#false} is VALID [2022-04-08 09:27:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:34,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:34,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345723926] [2022-04-08 09:27:34,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345723926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:34,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:34,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:34,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:34,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [323874747] [2022-04-08 09:27:34,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [323874747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:34,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:34,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:27:34,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129794048] [2022-04-08 09:27:34,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:34,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 09:27:34,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:34,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:35,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:35,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:27:35,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:27:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:27:35,011 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:35,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:35,285 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-08 09:27:35,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:27:35,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 09:27:35,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:35,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-08 09:27:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-08 09:27:35,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-08 09:27:35,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:35,329 INFO L225 Difference]: With dead ends: 65 [2022-04-08 09:27:35,329 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 09:27:35,329 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:35,329 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:35,330 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 97 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 09:27:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-08 09:27:35,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:35,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:35,467 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:35,467 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:35,468 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-08 09:27:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-08 09:27:35,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:35,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:35,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-08 09:27:35,469 INFO L87 Difference]: Start difference. First operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-08 09:27:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:35,470 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-08 09:27:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-08 09:27:35,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:35,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:35,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:35,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-04-08 09:27:35,472 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 21 [2022-04-08 09:27:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:35,472 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-04-08 09:27:35,472 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:35,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 68 transitions. [2022-04-08 09:27:35,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:35,563 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-08 09:27:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 09:27:35,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:35,563 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:35,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 09:27:35,563 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:35,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash 434938978, now seen corresponding path program 1 times [2022-04-08 09:27:35,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:35,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1008403937] [2022-04-08 09:27:35,564 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash 434938978, now seen corresponding path program 2 times [2022-04-08 09:27:35,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:35,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465775187] [2022-04-08 09:27:35,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:35,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:35,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:35,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {8168#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {8159#true} is VALID [2022-04-08 09:27:35,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {8159#true} assume true; {8159#true} is VALID [2022-04-08 09:27:35,647 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8159#true} {8159#true} #181#return; {8159#true} is VALID [2022-04-08 09:27:35,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {8159#true} call ULTIMATE.init(); {8168#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:35,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {8168#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {8159#true} is VALID [2022-04-08 09:27:35,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {8159#true} assume true; {8159#true} is VALID [2022-04-08 09:27:35,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8159#true} {8159#true} #181#return; {8159#true} is VALID [2022-04-08 09:27:35,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {8159#true} call #t~ret10 := main(); {8159#true} is VALID [2022-04-08 09:27:35,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {8159#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {8159#true} is VALID [2022-04-08 09:27:35,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {8159#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {8159#true} is VALID [2022-04-08 09:27:35,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {8159#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {8159#true} is VALID [2022-04-08 09:27:35,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {8159#true} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {8159#true} is VALID [2022-04-08 09:27:35,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {8159#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8159#true} is VALID [2022-04-08 09:27:35,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {8159#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8159#true} is VALID [2022-04-08 09:27:35,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {8159#true} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8159#true} is VALID [2022-04-08 09:27:35,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {8159#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {8164#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:35,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {8164#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {8164#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:35,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {8164#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {8164#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:35,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {8164#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {8165#(or (and (= main_~__VERIFIER_assert__cond~5 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-08 09:27:35,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {8165#(or (and (= main_~__VERIFIER_assert__cond~5 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8166#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:35,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {8166#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {8166#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:35,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {8166#(<= main_~main__t~0 main_~main__tagbuf_len~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {8166#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:35,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {8166#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {8167#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-08 09:27:35,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {8167#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {8160#false} is VALID [2022-04-08 09:27:35,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {8160#false} assume !false; {8160#false} is VALID [2022-04-08 09:27:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:35,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:35,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465775187] [2022-04-08 09:27:35,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465775187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:35,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:35,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:35,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:35,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1008403937] [2022-04-08 09:27:35,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1008403937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:35,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:35,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:35,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49613647] [2022-04-08 09:27:35,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:35,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 09:27:35,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:35,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:35,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:35,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:27:35,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:35,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:27:35,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:35,672 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:36,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:36,089 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-04-08 09:27:36,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:27:36,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 09:27:36,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-08 09:27:36,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-08 09:27:36,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2022-04-08 09:27:36,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:36,142 INFO L225 Difference]: With dead ends: 76 [2022-04-08 09:27:36,142 INFO L226 Difference]: Without dead ends: 74 [2022-04-08 09:27:36,142 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:27:36,143 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 103 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:36,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 62 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-08 09:27:36,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2022-04-08 09:27:36,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:36,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:36,280 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:36,281 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:36,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:36,282 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-04-08 09:27:36,282 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-04-08 09:27:36,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:36,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:36,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-08 09:27:36,283 INFO L87 Difference]: Start difference. First operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-08 09:27:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:36,284 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-04-08 09:27:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-04-08 09:27:36,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:36,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:36,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:36,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:36,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-04-08 09:27:36,285 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 22 [2022-04-08 09:27:36,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:36,286 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-04-08 09:27:36,286 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:36,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 63 transitions. [2022-04-08 09:27:36,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:36,391 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-04-08 09:27:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 09:27:36,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:36,392 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:36,392 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 09:27:36,392 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:36,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash -178138558, now seen corresponding path program 1 times [2022-04-08 09:27:36,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:36,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1034437594] [2022-04-08 09:27:36,393 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:36,393 INFO L85 PathProgramCache]: Analyzing trace with hash -178138558, now seen corresponding path program 2 times [2022-04-08 09:27:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:36,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765614999] [2022-04-08 09:27:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:36,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:36,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:36,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {8605#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {8595#true} is VALID [2022-04-08 09:27:36,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {8595#true} assume true; {8595#true} is VALID [2022-04-08 09:27:36,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8595#true} {8595#true} #181#return; {8595#true} is VALID [2022-04-08 09:27:36,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {8595#true} call ULTIMATE.init(); {8605#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:36,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {8605#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {8595#true} is VALID [2022-04-08 09:27:36,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {8595#true} assume true; {8595#true} is VALID [2022-04-08 09:27:36,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8595#true} {8595#true} #181#return; {8595#true} is VALID [2022-04-08 09:27:36,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {8595#true} call #t~ret10 := main(); {8595#true} is VALID [2022-04-08 09:27:36,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {8595#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {8595#true} is VALID [2022-04-08 09:27:36,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {8595#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {8595#true} is VALID [2022-04-08 09:27:36,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {8595#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {8595#true} is VALID [2022-04-08 09:27:36,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {8595#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8595#true} is VALID [2022-04-08 09:27:36,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {8595#true} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {8595#true} is VALID [2022-04-08 09:27:36,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {8595#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {8595#true} is VALID [2022-04-08 09:27:36,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {8595#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8595#true} is VALID [2022-04-08 09:27:36,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {8595#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {8600#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:36,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {8600#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8600#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:36,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {8600#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8601#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~17 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2022-04-08 09:27:36,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {8601#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~17 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:36,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:36,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:36,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:36,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8604#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-08 09:27:36,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {8604#(not (= main_~__VERIFIER_assert__cond~17 0))} assume 0 == ~__VERIFIER_assert__cond~17; {8596#false} is VALID [2022-04-08 09:27:36,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {8596#false} assume !false; {8596#false} is VALID [2022-04-08 09:27:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:36,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:36,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765614999] [2022-04-08 09:27:36,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765614999] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:27:36,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292150840] [2022-04-08 09:27:36,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:27:36,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:27:36,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:27:36,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:27:36,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 09:27:36,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:27:36,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:27:36,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 09:27:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:36,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:27:37,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {8595#true} call ULTIMATE.init(); {8595#true} is VALID [2022-04-08 09:27:37,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {8595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {8595#true} is VALID [2022-04-08 09:27:37,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {8595#true} assume true; {8595#true} is VALID [2022-04-08 09:27:37,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8595#true} {8595#true} #181#return; {8595#true} is VALID [2022-04-08 09:27:37,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {8595#true} call #t~ret10 := main(); {8595#true} is VALID [2022-04-08 09:27:37,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {8595#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {8595#true} is VALID [2022-04-08 09:27:37,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {8595#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {8627#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} is VALID [2022-04-08 09:27:37,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {8627#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-08 09:27:37,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-08 09:27:37,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-08 09:27:37,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-08 09:27:37,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8644#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-08 09:27:37,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {8644#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-08 09:27:37,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-08 09:27:37,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-08 09:27:37,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-08 09:27:37,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8661#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-08 09:27:37,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {8661#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {8661#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-08 09:27:37,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {8661#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8661#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-08 09:27:37,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {8661#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8671#(<= 1 main_~__VERIFIER_assert__cond~17)} is VALID [2022-04-08 09:27:37,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {8671#(<= 1 main_~__VERIFIER_assert__cond~17)} assume 0 == ~__VERIFIER_assert__cond~17; {8596#false} is VALID [2022-04-08 09:27:37,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {8596#false} assume !false; {8596#false} is VALID [2022-04-08 09:27:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:37,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:27:37,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {8596#false} assume !false; {8596#false} is VALID [2022-04-08 09:27:37,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {8671#(<= 1 main_~__VERIFIER_assert__cond~17)} assume 0 == ~__VERIFIER_assert__cond~17; {8596#false} is VALID [2022-04-08 09:27:37,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8671#(<= 1 main_~__VERIFIER_assert__cond~17)} is VALID [2022-04-08 09:27:37,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:37,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:37,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:37,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:37,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:37,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:37,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:37,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:37,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:37,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:37,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:37,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:37,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {8595#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:37,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {8595#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {8595#true} is VALID [2022-04-08 09:27:37,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {8595#true} call #t~ret10 := main(); {8595#true} is VALID [2022-04-08 09:27:37,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8595#true} {8595#true} #181#return; {8595#true} is VALID [2022-04-08 09:27:37,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {8595#true} assume true; {8595#true} is VALID [2022-04-08 09:27:37,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {8595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {8595#true} is VALID [2022-04-08 09:27:37,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {8595#true} call ULTIMATE.init(); {8595#true} is VALID [2022-04-08 09:27:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:27:37,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292150840] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:27:37,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:27:37,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-08 09:27:37,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:37,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1034437594] [2022-04-08 09:27:37,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1034437594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:37,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:37,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:27:37,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810567538] [2022-04-08 09:27:37,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:37,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 09:27:37,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:37,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:37,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:37,617 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:27:37,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:37,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:27:37,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:27:37,618 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:38,136 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-04-08 09:27:38,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:27:38,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 09:27:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:38,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-08 09:27:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:38,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-08 09:27:38,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-08 09:27:38,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:38,203 INFO L225 Difference]: With dead ends: 72 [2022-04-08 09:27:38,204 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 09:27:38,204 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:27:38,205 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 81 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:38,205 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 55 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:38,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 09:27:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2022-04-08 09:27:38,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:38,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:38,379 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:38,379 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:38,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:38,380 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-04-08 09:27:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-04-08 09:27:38,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:38,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:38,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-08 09:27:38,381 INFO L87 Difference]: Start difference. First operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-08 09:27:38,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:38,382 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-04-08 09:27:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-04-08 09:27:38,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:38,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:38,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:38,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-08 09:27:38,384 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 22 [2022-04-08 09:27:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:38,384 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-08 09:27:38,384 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:38,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 59 transitions. [2022-04-08 09:27:38,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:38,484 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-08 09:27:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 09:27:38,485 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:38,485 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:38,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 09:27:38,685 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:27:38,686 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:38,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:38,686 INFO L85 PathProgramCache]: Analyzing trace with hash -93650716, now seen corresponding path program 1 times [2022-04-08 09:27:38,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:38,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1102501979] [2022-04-08 09:27:38,687 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:38,687 INFO L85 PathProgramCache]: Analyzing trace with hash -93650716, now seen corresponding path program 2 times [2022-04-08 09:27:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:38,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323523162] [2022-04-08 09:27:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:38,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:38,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:38,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {9149#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9140#true} is VALID [2022-04-08 09:27:38,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {9140#true} assume true; {9140#true} is VALID [2022-04-08 09:27:38,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9140#true} {9140#true} #181#return; {9140#true} is VALID [2022-04-08 09:27:38,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {9140#true} call ULTIMATE.init(); {9149#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:38,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {9149#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9140#true} is VALID [2022-04-08 09:27:38,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {9140#true} assume true; {9140#true} is VALID [2022-04-08 09:27:38,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9140#true} {9140#true} #181#return; {9140#true} is VALID [2022-04-08 09:27:38,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {9140#true} call #t~ret10 := main(); {9140#true} is VALID [2022-04-08 09:27:38,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {9140#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {9140#true} is VALID [2022-04-08 09:27:38,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {9140#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {9140#true} is VALID [2022-04-08 09:27:38,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {9140#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {9140#true} is VALID [2022-04-08 09:27:38,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {9140#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9140#true} is VALID [2022-04-08 09:27:38,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {9140#true} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9140#true} is VALID [2022-04-08 09:27:38,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {9140#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {9140#true} is VALID [2022-04-08 09:27:38,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {9140#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9140#true} is VALID [2022-04-08 09:27:38,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {9140#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9145#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:38,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {9145#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {9145#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:38,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {9145#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9145#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:38,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {9145#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9146#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~1 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2022-04-08 09:27:38,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {9146#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~1 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:38,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:38,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:38,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:38,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9148#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-08 09:27:38,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {9148#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {9141#false} is VALID [2022-04-08 09:27:38,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {9141#false} assume !false; {9141#false} is VALID [2022-04-08 09:27:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:38,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:38,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323523162] [2022-04-08 09:27:38,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323523162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:38,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:38,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:38,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:38,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1102501979] [2022-04-08 09:27:38,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1102501979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:38,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:38,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:38,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337117204] [2022-04-08 09:27:38,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:38,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 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 23 [2022-04-08 09:27:38,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:38,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:38,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:38,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:27:38,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:38,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:27:38,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:38,797 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:39,226 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-04-08 09:27:39,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:27:39,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 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 23 [2022-04-08 09:27:39,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-08 09:27:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-08 09:27:39,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2022-04-08 09:27:39,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:39,288 INFO L225 Difference]: With dead ends: 64 [2022-04-08 09:27:39,288 INFO L226 Difference]: Without dead ends: 62 [2022-04-08 09:27:39,288 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:27:39,289 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 67 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:39,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 57 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-08 09:27:39,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2022-04-08 09:27:39,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:39,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,412 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,412 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:39,413 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2022-04-08 09:27:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-04-08 09:27:39,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:39,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:39,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-08 09:27:39,413 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-08 09:27:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:39,414 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2022-04-08 09:27:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-04-08 09:27:39,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:39,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:39,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:39,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-04-08 09:27:39,415 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 23 [2022-04-08 09:27:39,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:39,415 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-04-08 09:27:39,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 53 transitions. [2022-04-08 09:27:39,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:39,485 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-08 09:27:39,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 09:27:39,485 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:39,485 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:39,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 09:27:39,486 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:39,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:39,486 INFO L85 PathProgramCache]: Analyzing trace with hash -45935466, now seen corresponding path program 1 times [2022-04-08 09:27:39,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:39,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1445092055] [2022-04-08 09:27:39,487 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:39,487 INFO L85 PathProgramCache]: Analyzing trace with hash -45935466, now seen corresponding path program 2 times [2022-04-08 09:27:39,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:39,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717946445] [2022-04-08 09:27:39,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:39,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:39,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:39,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {9518#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9509#true} is VALID [2022-04-08 09:27:39,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-08 09:27:39,586 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9509#true} {9509#true} #181#return; {9509#true} is VALID [2022-04-08 09:27:39,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {9509#true} call ULTIMATE.init(); {9518#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:39,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {9518#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9509#true} is VALID [2022-04-08 09:27:39,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-08 09:27:39,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9509#true} {9509#true} #181#return; {9509#true} is VALID [2022-04-08 09:27:39,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {9509#true} call #t~ret10 := main(); {9509#true} is VALID [2022-04-08 09:27:39,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {9509#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {9509#true} is VALID [2022-04-08 09:27:39,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {9509#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {9509#true} is VALID [2022-04-08 09:27:39,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {9509#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {9509#true} is VALID [2022-04-08 09:27:39,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {9509#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9509#true} is VALID [2022-04-08 09:27:39,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {9509#true} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9509#true} is VALID [2022-04-08 09:27:39,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {9509#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {9509#true} is VALID [2022-04-08 09:27:39,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {9509#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9509#true} is VALID [2022-04-08 09:27:39,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {9509#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9514#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:39,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {9514#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {9514#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:39,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {9514#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9514#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:39,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {9514#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9515#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~1 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2022-04-08 09:27:39,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {9515#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~1 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:39,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:39,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet8;havoc #t~nondet8; {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:39,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:39,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {9517#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-08 09:27:39,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {9517#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {9510#false} is VALID [2022-04-08 09:27:39,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {9510#false} assume !false; {9510#false} is VALID [2022-04-08 09:27:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:39,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:39,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717946445] [2022-04-08 09:27:39,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717946445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:39,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:39,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:39,593 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:39,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1445092055] [2022-04-08 09:27:39,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1445092055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:39,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:39,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:39,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168124128] [2022-04-08 09:27:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:39,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 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 23 [2022-04-08 09:27:39,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:39,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:39,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:27:39,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:39,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:27:39,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:39,611 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:39,897 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-08 09:27:39,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:27:39,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 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 23 [2022-04-08 09:27:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:39,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-08 09:27:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-08 09:27:39,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-08 09:27:39,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:39,926 INFO L225 Difference]: With dead ends: 47 [2022-04-08 09:27:39,926 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 09:27:39,926 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:27:39,926 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 69 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:39,927 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 42 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 09:27:39,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 09:27:39,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:39,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,985 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,986 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:39,986 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 09:27:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 09:27:39,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:39,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:39,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-08 09:27:39,986 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-08 09:27:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:39,987 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 09:27:39,987 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 09:27:39,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:39,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:39,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:39,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-08 09:27:39,988 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 23 [2022-04-08 09:27:39,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:39,988 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-08 09:27:39,988 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:39,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-08 09:27:40,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 09:27:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 09:27:40,015 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:40,015 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:40,015 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 09:27:40,015 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-08 09:27:40,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:40,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1233573943, now seen corresponding path program 1 times [2022-04-08 09:27:40,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:40,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1511873191] [2022-04-08 09:27:40,016 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1233573943, now seen corresponding path program 2 times [2022-04-08 09:27:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:40,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882391859] [2022-04-08 09:27:40,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:40,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:40,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:40,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {9730#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9720#true} is VALID [2022-04-08 09:27:40,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {9720#true} assume true; {9720#true} is VALID [2022-04-08 09:27:40,100 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9720#true} {9720#true} #181#return; {9720#true} is VALID [2022-04-08 09:27:40,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {9720#true} call ULTIMATE.init(); {9730#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:40,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {9730#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9720#true} is VALID [2022-04-08 09:27:40,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {9720#true} assume true; {9720#true} is VALID [2022-04-08 09:27:40,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9720#true} {9720#true} #181#return; {9720#true} is VALID [2022-04-08 09:27:40,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {9720#true} call #t~ret10 := main(); {9720#true} is VALID [2022-04-08 09:27:40,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {9720#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {9720#true} is VALID [2022-04-08 09:27:40,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {9720#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {9720#true} is VALID [2022-04-08 09:27:40,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {9720#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {9720#true} is VALID [2022-04-08 09:27:40,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {9720#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9720#true} is VALID [2022-04-08 09:27:40,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {9720#true} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9720#true} is VALID [2022-04-08 09:27:40,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {9720#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {9720#true} is VALID [2022-04-08 09:27:40,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {9720#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9720#true} is VALID [2022-04-08 09:27:40,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {9720#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9725#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:40,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {9725#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {9725#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:40,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {9725#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {9726#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~17 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2022-04-08 09:27:40,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {9726#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~17 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:40,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:40,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:40,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:40,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:40,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9729#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-08 09:27:40,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {9729#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {9721#false} is VALID [2022-04-08 09:27:40,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {9721#false} assume !false; {9721#false} is VALID [2022-04-08 09:27:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:40,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:40,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882391859] [2022-04-08 09:27:40,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882391859] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:27:40,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666181093] [2022-04-08 09:27:40,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:27:40,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:27:40,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:27:40,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:27:40,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 09:27:40,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:27:40,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:27:40,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 09:27:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:40,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:27:40,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {9720#true} call ULTIMATE.init(); {9720#true} is VALID [2022-04-08 09:27:40,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {9720#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9720#true} is VALID [2022-04-08 09:27:40,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {9720#true} assume true; {9720#true} is VALID [2022-04-08 09:27:40,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9720#true} {9720#true} #181#return; {9720#true} is VALID [2022-04-08 09:27:40,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {9720#true} call #t~ret10 := main(); {9720#true} is VALID [2022-04-08 09:27:40,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {9720#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {9720#true} is VALID [2022-04-08 09:27:40,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {9720#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {9752#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} is VALID [2022-04-08 09:27:40,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {9752#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-08 09:27:40,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-08 09:27:40,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-08 09:27:40,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-08 09:27:40,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9769#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-08 09:27:40,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {9769#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-08 09:27:40,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-08 09:27:40,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-08 09:27:40,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-08 09:27:40,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-08 09:27:40,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-08 09:27:40,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-08 09:27:40,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-08 09:27:40,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9799#(<= 1 main_~__VERIFIER_assert__cond~1)} is VALID [2022-04-08 09:27:40,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {9799#(<= 1 main_~__VERIFIER_assert__cond~1)} assume 0 == ~__VERIFIER_assert__cond~1; {9721#false} is VALID [2022-04-08 09:27:40,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {9721#false} assume !false; {9721#false} is VALID [2022-04-08 09:27:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:40,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:27:40,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {9721#false} assume !false; {9721#false} is VALID [2022-04-08 09:27:40,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {9799#(<= 1 main_~__VERIFIER_assert__cond~1)} assume 0 == ~__VERIFIER_assert__cond~1; {9721#false} is VALID [2022-04-08 09:27:40,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9799#(<= 1 main_~__VERIFIER_assert__cond~1)} is VALID [2022-04-08 09:27:40,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:40,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:40,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:40,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:40,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:40,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:40,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:40,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:40,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:40,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:40,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:40,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:40,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 09:27:40,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {9720#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 09:27:40,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {9720#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {9720#true} is VALID [2022-04-08 09:27:40,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {9720#true} call #t~ret10 := main(); {9720#true} is VALID [2022-04-08 09:27:40,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9720#true} {9720#true} #181#return; {9720#true} is VALID [2022-04-08 09:27:40,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {9720#true} assume true; {9720#true} is VALID [2022-04-08 09:27:40,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {9720#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9720#true} is VALID [2022-04-08 09:27:40,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {9720#true} call ULTIMATE.init(); {9720#true} is VALID [2022-04-08 09:27:40,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:27:40,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666181093] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:27:40,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:27:40,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-08 09:27:40,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:40,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1511873191] [2022-04-08 09:27:40,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1511873191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:40,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:40,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:27:40,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018874342] [2022-04-08 09:27:40,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:40,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 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 23 [2022-04-08 09:27:40,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:40,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:41,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:41,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:27:41,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:41,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:27:41,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:27:41,016 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:41,167 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 09:27:41,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:27:41,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 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 23 [2022-04-08 09:27:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-08 09:27:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-08 09:27:41,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 21 transitions. [2022-04-08 09:27:41,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:41,187 INFO L225 Difference]: With dead ends: 24 [2022-04-08 09:27:41,187 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:27:41,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:27:41,188 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:41,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:27:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:27:41,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:27:41,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:41,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:27:41,189 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:27:41,189 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:27:41,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:41,189 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:27:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:27:41,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:41,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:41,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:27:41,190 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:27:41,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:41,190 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:27:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:27:41,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:41,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:41,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:41,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:27:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:27:41,190 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-08 09:27:41,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:41,191 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:27:41,191 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:41,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:27:41,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:27:41,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:41,193 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2022-04-08 09:27:41,194 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2022-04-08 09:27:41,194 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2022-04-08 09:27:41,194 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2022-04-08 09:27:41,194 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2022-04-08 09:27:41,194 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2022-04-08 09:27:41,194 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2022-04-08 09:27:41,194 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2022-04-08 09:27:41,194 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2022-04-08 09:27:41,194 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2022-04-08 09:27:41,194 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2022-04-08 09:27:41,195 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2022-04-08 09:27:41,195 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2022-04-08 09:27:41,195 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2022-04-08 09:27:41,195 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2022-04-08 09:27:41,195 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2022-04-08 09:27:41,195 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2022-04-08 09:27:41,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 09:27:41,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-08 09:27:41,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:28:13,033 WARN L232 SmtUtils]: Spent 22.94s on a formula simplification. DAG size of input: 64 DAG size of output: 65 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 09:28:16,515 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-08 09:28:16,515 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-08 09:28:16,515 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-08 09:28:16,515 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-08 09:28:16,515 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-08 09:28:16,515 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-08 09:28:16,516 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-08 09:28:16,516 INFO L878 garLoopResultBuilder]: At program point L225(line 225) the Hoare annotation is: false [2022-04-08 09:28:16,516 INFO L878 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) the Hoare annotation is: false [2022-04-08 09:28:16,516 INFO L878 garLoopResultBuilder]: At program point L349(lines 349 358) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~17 0)) (not (= main_~__VERIFIER_assert__cond~16 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-08 09:28:16,516 INFO L878 garLoopResultBuilder]: At program point L250(lines 102 252) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-08 09:28:16,516 INFO L878 garLoopResultBuilder]: At program point mainEXIT(lines 15 375) the Hoare annotation is: (or (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) (<= 0 main_~main__t~0)) [2022-04-08 09:28:16,516 INFO L878 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: false [2022-04-08 09:28:16,517 INFO L878 garLoopResultBuilder]: At program point L308(lines 308 316) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~15 0))) [2022-04-08 09:28:16,518 INFO L878 garLoopResultBuilder]: At program point L143(line 143) the Hoare annotation is: false [2022-04-08 09:28:16,518 INFO L878 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: false [2022-04-08 09:28:16,518 INFO L878 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) the Hoare annotation is: false [2022-04-08 09:28:16,518 INFO L878 garLoopResultBuilder]: At program point L102(lines 102 252) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-08 09:28:16,518 INFO L878 garLoopResultBuilder]: At program point L325(lines 325 362) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~17 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1) (and (<= main_~main__t~0 1) .cse0 (< main_~main__t~0 main_~main__tagbuf_len~0) .cse1))) [2022-04-08 09:28:16,518 INFO L878 garLoopResultBuilder]: At program point L127(line 127) the Hoare annotation is: false [2022-04-08 09:28:16,518 INFO L878 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) the Hoare annotation is: false [2022-04-08 09:28:16,518 INFO L878 garLoopResultBuilder]: At program point L20(lines 20 374) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-04-08 09:28:16,518 INFO L878 garLoopResultBuilder]: At program point L177(line 177) the Hoare annotation is: false [2022-04-08 09:28:16,519 INFO L878 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) the Hoare annotation is: false [2022-04-08 09:28:16,519 INFO L878 garLoopResultBuilder]: At program point L235(lines 235 243) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse4 (<= 1 main_~main__t~0))) (or (and .cse0 .cse1 .cse2 .cse3 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse4) (and .cse0 (<= main_~main__t~0 1) .cse1 (< 0 (+ main_~main__tagbuf_len~0 1)) .cse2 .cse3 (not (= main_~main__tagbuf_len~0 0)) .cse4))) [2022-04-08 09:28:16,519 INFO L878 garLoopResultBuilder]: At program point L351(line 351) the Hoare annotation is: false [2022-04-08 09:28:16,519 INFO L878 garLoopResultBuilder]: At program point L153(lines 153 161) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 09:28:16,519 INFO L878 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) the Hoare annotation is: false [2022-04-08 09:28:16,520 INFO L878 garLoopResultBuilder]: At program point L54(lines 54 254) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (let ((.cse0 (let ((.cse1 (not (= main_~__VERIFIER_assert__cond~0 0)))) (or (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0) .cse1) (and (<= 0 main_~main__tagbuf_len~0) .cse1 (= main_~main__t~0 0)))))) (or (and (not (= main_~__VERIFIER_assert__cond~17 0)) .cse0) (and (<= main_~main__t~0 1) .cse0)))) [2022-04-08 09:28:16,520 INFO L878 garLoopResultBuilder]: At program point L310(line 310) the Hoare annotation is: false [2022-04-08 09:28:16,520 INFO L878 garLoopResultBuilder]: At program point L277(lines 277 364) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (not (= main_~__VERIFIER_assert__cond~13 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-04-08 09:28:16,520 INFO L878 garLoopResultBuilder]: At program point mainFINAL(lines 15 375) the Hoare annotation is: (or (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) (<= 0 main_~main__t~0)) [2022-04-08 09:28:16,520 INFO L878 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) the Hoare annotation is: false [2022-04-08 09:28:16,520 INFO L878 garLoopResultBuilder]: At program point L71(lines 71 95) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 09:28:16,520 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) the Hoare annotation is: false [2022-04-08 09:28:16,520 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 15 375) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-04-08 09:28:16,520 INFO L878 garLoopResultBuilder]: At program point L187(lines 187 197) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-08 09:28:16,520 INFO L878 garLoopResultBuilder]: At program point L113(lines 113 204) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-08 09:28:16,520 INFO L878 garLoopResultBuilder]: At program point L237(line 237) the Hoare annotation is: false [2022-04-08 09:28:16,520 INFO L878 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) the Hoare annotation is: false [2022-04-08 09:28:16,520 INFO L878 garLoopResultBuilder]: At program point L328(lines 32 368) the Hoare annotation is: (or (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and (<= main_~main__t~0 1) .cse0) (and .cse0 (not (= main_~__VERIFIER_assert__cond~17 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) (and (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))) [2022-04-08 09:28:16,521 INFO L878 garLoopResultBuilder]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) the Hoare annotation is: false [2022-04-08 09:28:16,521 INFO L878 garLoopResultBuilder]: At program point L196(lines 60 254) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 09:28:16,521 INFO L878 garLoopResultBuilder]: At program point L155(line 155) the Hoare annotation is: false [2022-04-08 09:28:16,521 INFO L878 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: false [2022-04-08 09:28:16,521 INFO L878 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) the Hoare annotation is: false [2022-04-08 09:28:16,521 INFO L878 garLoopResultBuilder]: At program point L279(line 279) the Hoare annotation is: false [2022-04-08 09:28:16,521 INFO L878 garLoopResultBuilder]: At program point L337(lines 337 360) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0))) (.cse2 (<= 1 main_~main__t~0))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse1 .cse2) (and (<= main_~main__t~0 1) .cse0 .cse1 .cse2))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) [2022-04-08 09:28:16,521 INFO L878 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) the Hoare annotation is: false [2022-04-08 09:28:16,521 INFO L878 garLoopResultBuilder]: At program point L106(lines 106 210) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-08 09:28:16,521 INFO L878 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: false [2022-04-08 09:28:16,521 INFO L878 garLoopResultBuilder]: At program point L296(lines 296 318) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 09:28:16,522 INFO L878 garLoopResultBuilder]: At program point L32(lines 32 368) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-04-08 09:28:16,522 INFO L878 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) the Hoare annotation is: false [2022-04-08 09:28:16,522 INFO L878 garLoopResultBuilder]: At program point L189(line 189) the Hoare annotation is: false [2022-04-08 09:28:16,522 INFO L878 garLoopResultBuilder]: At program point L24(lines 24 369) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= main_~main__t~0 0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 09:28:16,522 INFO L878 garLoopResultBuilder]: At program point L115(line 115) the Hoare annotation is: false [2022-04-08 09:28:16,522 INFO L878 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) the Hoare annotation is: false [2022-04-08 09:28:16,522 INFO L878 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) the Hoare annotation is: false [2022-04-08 09:28:16,522 INFO L878 garLoopResultBuilder]: At program point L289(lines 289 363) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (<= 1 main_~main__t~0)) (.cse2 (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse1 .cse2) (and (<= main_~main__t~0 1) .cse0 .cse1 .cse2))) [2022-04-08 09:28:16,522 INFO L878 garLoopResultBuilder]: At program point L223(lines 223 245) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse3 (<= 1 main_~main__t~0))) (or (and .cse0 .cse1 .cse2 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse3) (and .cse0 (<= main_~main__t~0 1) .cse1 (< 0 (+ main_~main__tagbuf_len~0 1)) .cse2 (not (= main_~main__tagbuf_len~0 0)) .cse3))) [2022-04-08 09:28:16,522 INFO L878 garLoopResultBuilder]: At program point L83(lines 83 93) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 09:28:16,523 INFO L878 garLoopResultBuilder]: At program point L339(line 339) the Hoare annotation is: false [2022-04-08 09:28:16,523 INFO L878 garLoopResultBuilder]: At program point L141(lines 141 163) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 09:28:16,523 INFO L878 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) the Hoare annotation is: false [2022-04-08 09:28:16,523 INFO L878 garLoopResultBuilder]: At program point L42(lines 42 256) the Hoare annotation is: (and (< main_~main__t~0 main_~main__tagbuf_len~0) (let ((.cse0 (let ((.cse1 (not (= main_~__VERIFIER_assert__cond~0 0)))) (or (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0) .cse1) (and (<= 0 main_~main__tagbuf_len~0) .cse1 (= main_~main__t~0 0)))))) (or (and (not (= main_~__VERIFIER_assert__cond~17 0)) .cse0) (and (<= main_~main__t~0 1) .cse0)))) [2022-04-08 09:28:16,523 INFO L878 garLoopResultBuilder]: At program point L298(line 298) the Hoare annotation is: false [2022-04-08 09:28:16,523 INFO L878 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) the Hoare annotation is: false [2022-04-08 09:28:16,523 INFO L878 garLoopResultBuilder]: At program point L125(lines 125 202) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-08 09:28:16,523 INFO L878 garLoopResultBuilder]: At program point L315(lines 32 368) the Hoare annotation is: (<= 0 main_~main__t~0) [2022-04-08 09:28:16,523 INFO L878 garLoopResultBuilder]: At program point L216(lines 216 251) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-08 09:28:16,523 INFO L878 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) the Hoare annotation is: false [2022-04-08 09:28:16,523 INFO L878 garLoopResultBuilder]: At program point L175(lines 175 199) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-08 09:28:16,523 INFO L878 garLoopResultBuilder]: At program point L266(lines 266 366) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-04-08 09:28:16,523 INFO L878 garLoopResultBuilder]: At program point L134(lines 134 201) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 09:28:16,523 INFO L878 garLoopResultBuilder]: At program point L357(lines 283 364) the Hoare annotation is: (let ((.cse0 (= main_~main__t~0 0))) (let ((.cse1 (let ((.cse2 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse3 (<= 0 main_~main__t~0))) (or (and .cse2 .cse3 .cse0) (and .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0))))))) (or (and (< main_~main__t~0 main_~main__tagbuf_len~0) .cse0 .cse1) (and (not (= main_~__VERIFIER_assert__cond~17 0)) .cse1 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)))))) [2022-04-08 09:28:16,524 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:28:16,524 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 09:28:16,524 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:28:16,524 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:28:16,524 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:28:16,524 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:28:16,524 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:28:16,526 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 09:28:16,527 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:28:16,529 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:28:16,530 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 09:28:16,530 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 09:28:16,531 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 09:28:16,531 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 09:28:16,532 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-08 09:28:16,591 INFO L163 areAnnotationChecker]: CFG has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:28:16,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:28:16 BoogieIcfgContainer [2022-04-08 09:28:16,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:28:16,603 INFO L158 Benchmark]: Toolchain (without parser) took 55797.96ms. Allocated memory was 186.6MB in the beginning and 550.5MB in the end (delta: 363.9MB). Free memory was 129.9MB in the beginning and 264.6MB in the end (delta: -134.7MB). Peak memory consumption was 309.0MB. Max. memory is 8.0GB. [2022-04-08 09:28:16,603 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 186.6MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:28:16,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.77ms. Allocated memory was 186.6MB in the beginning and 264.2MB in the end (delta: 77.6MB). Free memory was 129.8MB in the beginning and 228.1MB in the end (delta: -98.3MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. [2022-04-08 09:28:16,604 INFO L158 Benchmark]: Boogie Preprocessor took 42.96ms. Allocated memory is still 264.2MB. Free memory was 227.6MB in the beginning and 226.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 09:28:16,604 INFO L158 Benchmark]: RCFGBuilder took 377.97ms. Allocated memory is still 264.2MB. Free memory was 226.1MB in the beginning and 209.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-08 09:28:16,604 INFO L158 Benchmark]: TraceAbstraction took 55095.46ms. Allocated memory was 264.2MB in the beginning and 550.5MB in the end (delta: 286.3MB). Free memory was 208.7MB in the beginning and 264.6MB in the end (delta: -55.9MB). Peak memory consumption was 311.3MB. Max. memory is 8.0GB. [2022-04-08 09:28:16,605 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 186.6MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 276.77ms. Allocated memory was 186.6MB in the beginning and 264.2MB in the end (delta: 77.6MB). Free memory was 129.8MB in the beginning and 228.1MB in the end (delta: -98.3MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.96ms. Allocated memory is still 264.2MB. Free memory was 227.6MB in the beginning and 226.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 377.97ms. Allocated memory is still 264.2MB. Free memory was 226.1MB in the beginning and 209.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 55095.46ms. Allocated memory was 264.2MB in the beginning and 550.5MB in the end (delta: 286.3MB). Free memory was 208.7MB in the beginning and 264.6MB in the end (delta: -55.9MB). Peak memory consumption was 311.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 44]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 127]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 143]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 155]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 225]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 237]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 279]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 298]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 310]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 339]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 351]: 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, 83 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 55.0s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 35.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1383 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1383 mSDsluCounter, 2585 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1559 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3022 IncrementalHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 1026 mSDtfsCounter, 3022 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 329 GetRequests, 146 SyntacticMatches, 10 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 299 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 76 PreInvPairs, 101 NumberOfFragments, 953 HoareAnnotationTreeSize, 76 FomulaSimplifications, 25988 FormulaSimplificationTreeSizeReduction, 33.1s HoareSimplificationTime, 76 FomulaSimplificationsInter, 871907 FormulaSimplificationTreeSizeReductionInter, 1.9s 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 17 specifications checked. All of them hold - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && main__t <= main__tagbuf_len - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((main__t < main__tagbuf_len && main__t == 0) && (((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) || ((!(__VERIFIER_assert__cond == 0) && (((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= main__t)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) || (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0))) && !(main__tagbuf_len <= main__t)) && 1 <= main__t) || (main__t < main__tagbuf_len && main__t == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len <= main__t)) && 1 <= main__t - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: ((\old(__return_305) == __return_305 && \old(__tmp_247_0) == __tmp_247_0) && \old(__tmp_383_0) == __tmp_383_0) || 0 <= main__t RESULT: Ultimate proved your program to be correct! [2022-04-08 09:28:16,640 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...