/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:11:09,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:11:09,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:11:09,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:11:09,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:11:09,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:11:09,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:11:09,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:11:09,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:11:09,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:11:09,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:11:09,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:11:09,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:11:09,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:11:09,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:11:09,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:11:09,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:11:09,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:11:09,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:11:09,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:11:09,287 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:11:09,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:11:09,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:11:09,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:11:09,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:11:09,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:11:09,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:11:09,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:11:09,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:11:09,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:11:09,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:11:09,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:11:09,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:11:09,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:11:09,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:11:09,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:11:09,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:11:09,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:11:09,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:11:09,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:11:09,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:11:09,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:11:09,317 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:11:09,322 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:11:09,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:11:09,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:11:09,323 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:11:09,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:11:09,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:11:09,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:11:09,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:11:09,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:11:09,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:11:09,324 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:11:09,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:11:09,324 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:11:09,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:11:09,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:11:09,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:11:09,324 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:11:09,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:11:09,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:11:09,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:11:09,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:11:09,325 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:11:09,325 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:11:09,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:11:09,325 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:11:09,325 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 06:11:09,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:11:09,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:11:09,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:11:09,523 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:11:09,524 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:11:09,525 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-15 06:11:09,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf9bec8e/29ded66a33cb40aca61417abd8dbc464/FLAG0528f6bc8 [2022-04-15 06:11:09,960 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:11:09,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-04-15 06:11:09,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf9bec8e/29ded66a33cb40aca61417abd8dbc464/FLAG0528f6bc8 [2022-04-15 06:11:09,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf9bec8e/29ded66a33cb40aca61417abd8dbc464 [2022-04-15 06:11:09,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:11:09,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:11:09,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:11:09,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:11:09,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:11:09,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:11:09" (1/1) ... [2022-04-15 06:11:09,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c90aa1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:09, skipping insertion in model container [2022-04-15 06:11:09,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:11:09" (1/1) ... [2022-04-15 06:11:09,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:11:10,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:11:10,185 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-15 06:11:10,188 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-15 06:11:10,189 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-15 06:11:10,190 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-15 06:11:10,208 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-15 06:11:10,209 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-15 06:11:10,210 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-15 06:11:10,211 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-15 06:11:10,212 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-15 06:11:10,213 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-15 06:11:10,215 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-15 06:11:10,216 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-15 06:11:10,217 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-15 06:11:10,219 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-15 06:11:10,228 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-15 06:11:10,230 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-15 06:11:10,230 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-15 06:11:10,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:11:10,245 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:11:10,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2022-04-15 06:11:10,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2022-04-15 06:11:10,259 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-15 06:11:10,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2022-04-15 06:11:10,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2022-04-15 06:11:10,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2022-04-15 06:11:10,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2022-04-15 06:11:10,264 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-15 06:11:10,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2022-04-15 06:11:10,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2022-04-15 06:11:10,268 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-15 06:11:10,268 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-15 06:11:10,270 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-15 06:11:10,272 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-15 06:11:10,274 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-15 06:11:10,275 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-15 06:11:10,276 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-15 06:11:10,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:11:10,288 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:11:10,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:10 WrapperNode [2022-04-15 06:11:10,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:11:10,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:11:10,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:11:10,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:11:10,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:10" (1/1) ... [2022-04-15 06:11:10,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:10" (1/1) ... [2022-04-15 06:11:10,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:10" (1/1) ... [2022-04-15 06:11:10,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:10" (1/1) ... [2022-04-15 06:11:10,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:10" (1/1) ... [2022-04-15 06:11:10,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:10" (1/1) ... [2022-04-15 06:11:10,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:10" (1/1) ... [2022-04-15 06:11:10,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:11:10,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:11:10,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:11:10,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:11:10,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:10" (1/1) ... [2022-04-15 06:11:10,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:11:10,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:11:10,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 06:11:10,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 06:11:10,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:11:10,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:11:10,416 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:11:10,416 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:11:10,416 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:11:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:11:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:11:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:11:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:11:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:11:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:11:10,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:11:10,417 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:11:10,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:11:10,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:11:10,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:11:10,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:11:10,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:11:10,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:11:10,498 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:11:10,500 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:11:10,733 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:11:10,739 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:11:10,740 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-15 06:11:10,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:11:10 BoogieIcfgContainer [2022-04-15 06:11:10,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:11:10,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:11:10,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:11:10,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:11:10,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:11:09" (1/3) ... [2022-04-15 06:11:10,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c001ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:11:10, skipping insertion in model container [2022-04-15 06:11:10,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:11:10" (2/3) ... [2022-04-15 06:11:10,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c001ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:11:10, skipping insertion in model container [2022-04-15 06:11:10,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:11:10" (3/3) ... [2022-04-15 06:11:10,750 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2022-04-15 06:11:10,754 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:11:10,754 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-04-15 06:11:10,781 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:11:10,785 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 06:11:10,785 INFO L341 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-04-15 06:11:10,799 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-15 06:11:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:11:10,804 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:10,805 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:10,805 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-15 06:11:10,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:10,809 INFO L85 PathProgramCache]: Analyzing trace with hash -388107236, now seen corresponding path program 1 times [2022-04-15 06:11:10,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:10,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [402805203] [2022-04-15 06:11:10,821 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:10,821 INFO L85 PathProgramCache]: Analyzing trace with hash -388107236, now seen corresponding path program 2 times [2022-04-15 06:11:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:10,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69903348] [2022-04-15 06:11:10,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:10,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:10,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:10,994 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-15 06:11:10,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {79#true} assume true; {79#true} is VALID [2022-04-15 06:11:10,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79#true} {79#true} #181#return; {79#true} is VALID [2022-04-15 06:11:10,997 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-15 06:11:10,997 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-15 06:11:10,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {79#true} assume true; {79#true} is VALID [2022-04-15 06:11:10,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79#true} {79#true} #181#return; {79#true} is VALID [2022-04-15 06:11:10,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {79#true} call #t~ret10 := main(); {79#true} is VALID [2022-04-15 06:11:10,998 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-15 06:11:10,998 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-15 06:11:10,999 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-15 06:11:10,999 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-15 06:11:11,000 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-15 06:11:11,000 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-15 06:11:11,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {80#false} assume !false; {80#false} is VALID [2022-04-15 06:11:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:11,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:11,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69903348] [2022-04-15 06:11:11,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69903348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:11,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:11,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:11:11,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:11,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [402805203] [2022-04-15 06:11:11,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [402805203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:11,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:11,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:11:11,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103073323] [2022-04-15 06:11:11,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:11,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:11:11,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:11,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:11,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:11,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:11:11,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:11,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:11:11,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:11:11,050 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-15 06:11:11,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:11,513 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2022-04-15 06:11:11,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:11:11,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:11:11,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:11,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-04-15 06:11:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-04-15 06:11:11,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 113 transitions. [2022-04-15 06:11:11,610 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-15 06:11:11,623 INFO L225 Difference]: With dead ends: 87 [2022-04-15 06:11:11,624 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 06:11:11,629 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:11,636 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-15 06:11:11,636 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-15 06:11:11,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 06:11:11,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-15 06:11:11,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:11,705 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-15 06:11:11,705 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-15 06:11:11,706 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-15 06:11:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:11,709 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-15 06:11:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-15 06:11:11,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:11,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:11,710 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-15 06:11:11,710 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-15 06:11:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:11,714 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-15 06:11:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-15 06:11:11,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:11,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:11,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:11,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:11,715 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-15 06:11:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-04-15 06:11:11,718 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2022-04-15 06:11:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:11,718 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-04-15 06:11:11,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:11,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 73 transitions. [2022-04-15 06:11:11,770 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-15 06:11:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-15 06:11:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:11:11,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:11,771 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:11,771 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:11:11,771 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-15 06:11:11,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:11,773 INFO L85 PathProgramCache]: Analyzing trace with hash -384872930, now seen corresponding path program 1 times [2022-04-15 06:11:11,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:11,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [928754830] [2022-04-15 06:11:11,775 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash -384872930, now seen corresponding path program 2 times [2022-04-15 06:11:11,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:11,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988155912] [2022-04-15 06:11:11,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:11,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:11,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:11,839 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-15 06:11:11,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-15 06:11:11,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {543#true} {543#true} #181#return; {543#true} is VALID [2022-04-15 06:11:11,840 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-15 06:11:11,840 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-15 06:11:11,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-15 06:11:11,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {543#true} {543#true} #181#return; {543#true} is VALID [2022-04-15 06:11:11,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {543#true} call #t~ret10 := main(); {543#true} is VALID [2022-04-15 06:11:11,841 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-15 06:11:11,841 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-15 06:11:11,842 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-15 06:11:11,842 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-15 06:11:11,843 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-15 06:11:11,843 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-15 06:11:11,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#false} assume !false; {544#false} is VALID [2022-04-15 06:11:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:11,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:11,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988155912] [2022-04-15 06:11:11,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988155912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:11,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:11,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:11:11,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:11,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [928754830] [2022-04-15 06:11:11,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [928754830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:11,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:11,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:11:11,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013926618] [2022-04-15 06:11:11,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:11,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:11:11,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:11,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:11,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:11,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:11:11,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:11,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:11:11,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:11:11,861 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-15 06:11:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:12,351 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-04-15 06:11:12,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:11:12,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:11:12,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-04-15 06:11:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-04-15 06:11:12,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 117 transitions. [2022-04-15 06:11:12,482 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-15 06:11:12,493 INFO L225 Difference]: With dead ends: 111 [2022-04-15 06:11:12,493 INFO L226 Difference]: Without dead ends: 109 [2022-04-15 06:11:12,493 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:11:12,498 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-15 06:11:12,499 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-15 06:11:12,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-15 06:11:12,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 67. [2022-04-15 06:11:12,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:12,563 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-15 06:11:12,564 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-15 06:11:12,564 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-15 06:11:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:12,572 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-04-15 06:11:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-04-15 06:11:12,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:12,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:12,578 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-15 06:11:12,578 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-15 06:11:12,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:12,598 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-04-15 06:11:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-04-15 06:11:12,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:12,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:12,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:12,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:12,601 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-15 06:11:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-04-15 06:11:12,606 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2022-04-15 06:11:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:12,607 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-04-15 06:11:12,607 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:12,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 71 transitions. [2022-04-15 06:11:12,675 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-15 06:11:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-15 06:11:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 06:11:12,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:12,676 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:12,676 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:11:12,676 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-15 06:11:12,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash 853580642, now seen corresponding path program 1 times [2022-04-15 06:11:12,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:12,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2109812509] [2022-04-15 06:11:12,677 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:12,677 INFO L85 PathProgramCache]: Analyzing trace with hash 853580642, now seen corresponding path program 2 times [2022-04-15 06:11:12,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:12,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299820104] [2022-04-15 06:11:12,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:12,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:12,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:12,826 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-15 06:11:12,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-15 06:11:12,826 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1133#true} {1133#true} #181#return; {1133#true} is VALID [2022-04-15 06:11:12,827 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-15 06:11:12,827 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-15 06:11:12,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-15 06:11:12,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1133#true} {1133#true} #181#return; {1133#true} is VALID [2022-04-15 06:11:12,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {1133#true} call #t~ret10 := main(); {1133#true} is VALID [2022-04-15 06:11:12,828 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-15 06:11:12,844 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-15 06:11:12,844 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-15 06:11:12,845 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-15 06:11:12,845 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-15 06:11:12,846 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-15 06:11:12,847 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-15 06:11:12,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {1134#false} assume !false; {1134#false} is VALID [2022-04-15 06:11:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:12,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:12,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299820104] [2022-04-15 06:11:12,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299820104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:12,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:12,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:11:12,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:12,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2109812509] [2022-04-15 06:11:12,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2109812509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:12,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:12,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:11:12,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666404463] [2022-04-15 06:11:12,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:12,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:11:12,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:12,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:12,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:12,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:11:12,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:12,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:11:12,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:11:12,860 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-15 06:11:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:13,205 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-15 06:11:13,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:11:13,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:11:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:13,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-15 06:11:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-15 06:11:13,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2022-04-15 06:11:13,273 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-15 06:11:13,275 INFO L225 Difference]: With dead ends: 73 [2022-04-15 06:11:13,275 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 06:11:13,276 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:13,279 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-15 06:11:13,282 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-15 06:11:13,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 06:11:13,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-04-15 06:11:13,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:13,364 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-15 06:11:13,364 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-15 06:11:13,365 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-15 06:11:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:13,366 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-15 06:11:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-15 06:11:13,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:13,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:13,367 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-15 06:11:13,367 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-15 06:11:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:13,373 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-15 06:11:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-15 06:11:13,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:13,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:13,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:13,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:13,374 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-15 06:11:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-04-15 06:11:13,375 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2022-04-15 06:11:13,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:13,376 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-04-15 06:11:13,376 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:13,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 74 transitions. [2022-04-15 06:11:13,543 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-15 06:11:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-04-15 06:11:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:11:13,544 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:13,544 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:13,544 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:11:13,545 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-15 06:11:13,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:13,545 INFO L85 PathProgramCache]: Analyzing trace with hash -47660122, now seen corresponding path program 1 times [2022-04-15 06:11:13,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:13,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [549772691] [2022-04-15 06:11:13,545 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:13,545 INFO L85 PathProgramCache]: Analyzing trace with hash -47660122, now seen corresponding path program 2 times [2022-04-15 06:11:13,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:13,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924040074] [2022-04-15 06:11:13,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:13,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:13,657 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-15 06:11:13,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {1575#true} assume true; {1575#true} is VALID [2022-04-15 06:11:13,657 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1575#true} {1575#true} #181#return; {1575#true} is VALID [2022-04-15 06:11:13,658 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-15 06:11:13,658 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-15 06:11:13,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {1575#true} assume true; {1575#true} is VALID [2022-04-15 06:11:13,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1575#true} {1575#true} #181#return; {1575#true} is VALID [2022-04-15 06:11:13,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {1575#true} call #t~ret10 := main(); {1575#true} is VALID [2022-04-15 06:11:13,659 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-15 06:11:13,659 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-15 06:11:13,660 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-15 06:11:13,660 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-15 06:11:13,661 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-15 06:11:13,661 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-15 06:11:13,662 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-15 06:11:13,662 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-15 06:11:13,663 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-15 06:11:13,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#false} assume !false; {1576#false} is VALID [2022-04-15 06:11:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:13,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:13,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924040074] [2022-04-15 06:11:13,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924040074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:13,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:13,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:13,664 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:13,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [549772691] [2022-04-15 06:11:13,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [549772691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:13,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:13,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:13,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787916121] [2022-04-15 06:11:13,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:13,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:11:13,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:13,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:13,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:13,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:11:13,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:13,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:11:13,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:11:13,678 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-15 06:11:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:14,253 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-15 06:11:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:11:14,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:11:14,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-15 06:11:14,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-15 06:11:14,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2022-04-15 06:11:14,341 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-15 06:11:14,343 INFO L225 Difference]: With dead ends: 71 [2022-04-15 06:11:14,343 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 06:11:14,343 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-15 06:11:14,344 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:11:14,345 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.2s Time] [2022-04-15 06:11:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 06:11:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-15 06:11:14,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:14,459 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-15 06:11:14,459 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-15 06:11:14,459 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-15 06:11:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:14,461 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-15 06:11:14,461 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-15 06:11:14,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:14,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:14,462 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-15 06:11:14,462 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-15 06:11:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:14,464 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-15 06:11:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-15 06:11:14,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:14,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:14,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:14,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:14,465 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-15 06:11:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-15 06:11:14,466 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2022-04-15 06:11:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:14,466 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-15 06:11:14,467 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:14,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2022-04-15 06:11:14,554 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-15 06:11:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-15 06:11:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:11:14,555 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:14,555 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:14,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 06:11:14,556 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-15 06:11:14,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1816251534, now seen corresponding path program 1 times [2022-04-15 06:11:14,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:14,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1499621668] [2022-04-15 06:11:14,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:14,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1816251534, now seen corresponding path program 2 times [2022-04-15 06:11:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:14,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854899068] [2022-04-15 06:11:14,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:14,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:14,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:14,655 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-15 06:11:14,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 06:11:14,655 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2006#true} {2006#true} #181#return; {2006#true} is VALID [2022-04-15 06:11:14,656 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-15 06:11:14,656 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-15 06:11:14,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 06:11:14,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2006#true} {2006#true} #181#return; {2006#true} is VALID [2022-04-15 06:11:14,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {2006#true} call #t~ret10 := main(); {2006#true} is VALID [2022-04-15 06:11:14,657 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-15 06:11:14,657 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-15 06:11:14,660 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-15 06:11:14,660 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-15 06:11:14,660 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-15 06:11:14,661 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-15 06:11:14,661 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-15 06:11:14,662 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-15 06:11:14,662 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-15 06:11:14,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {2007#false} assume !false; {2007#false} is VALID [2022-04-15 06:11:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:14,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:14,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854899068] [2022-04-15 06:11:14,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854899068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:14,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:14,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:14,664 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:14,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1499621668] [2022-04-15 06:11:14,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1499621668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:14,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:14,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:14,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279448190] [2022-04-15 06:11:14,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:14,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:11:14,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:14,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:14,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:14,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:11:14,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:14,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:11:14,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:11:14,675 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-15 06:11:15,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:15,134 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-15 06:11:15,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:11:15,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:11:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:15,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-15 06:11:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-15 06:11:15,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-15 06:11:15,196 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-15 06:11:15,197 INFO L225 Difference]: With dead ends: 69 [2022-04-15 06:11:15,197 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 06:11:15,197 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-15 06:11:15,198 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-15 06:11:15,198 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-15 06:11:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 06:11:15,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-15 06:11:15,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:15,291 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-15 06:11:15,291 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-15 06:11:15,291 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-15 06:11:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:15,293 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-15 06:11:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-15 06:11:15,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:15,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:15,293 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-15 06:11:15,293 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-15 06:11:15,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:15,296 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-15 06:11:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-15 06:11:15,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:15,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:15,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:15,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:15,297 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-15 06:11:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-04-15 06:11:15,299 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2022-04-15 06:11:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:15,299 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-04-15 06:11:15,299 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:15,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 70 transitions. [2022-04-15 06:11:15,390 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-15 06:11:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-15 06:11:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:11:15,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:15,391 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:15,391 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 06:11:15,391 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-15 06:11:15,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:15,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1477460696, now seen corresponding path program 1 times [2022-04-15 06:11:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:15,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [816116645] [2022-04-15 06:11:15,392 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1477460696, now seen corresponding path program 2 times [2022-04-15 06:11:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:15,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734499188] [2022-04-15 06:11:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:15,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:15,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:15,501 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-15 06:11:15,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-15 06:11:15,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2425#true} {2425#true} #181#return; {2425#true} is VALID [2022-04-15 06:11:15,508 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-15 06:11:15,508 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-15 06:11:15,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-15 06:11:15,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2425#true} {2425#true} #181#return; {2425#true} is VALID [2022-04-15 06:11:15,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {2425#true} call #t~ret10 := main(); {2425#true} is VALID [2022-04-15 06:11:15,510 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-15 06:11:15,510 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-15 06:11:15,510 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-15 06:11:15,510 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-15 06:11:15,510 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-15 06:11:15,511 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-15 06:11:15,511 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-15 06:11:15,511 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-15 06:11:15,512 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-15 06:11:15,512 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-15 06:11:15,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {2426#false} assume !false; {2426#false} is VALID [2022-04-15 06:11:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:15,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:15,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734499188] [2022-04-15 06:11:15,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734499188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:15,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:15,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:11:15,513 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:15,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [816116645] [2022-04-15 06:11:15,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [816116645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:15,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:15,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:11:15,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430799545] [2022-04-15 06:11:15,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:15,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:11:15,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:15,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:15,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:15,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:11:15,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:15,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:11:15,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:11:15,538 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-15 06:11:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:15,903 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-15 06:11:15,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:11:15,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:11:15,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-15 06:11:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-15 06:11:15,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-15 06:11:15,969 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-15 06:11:15,970 INFO L225 Difference]: With dead ends: 67 [2022-04-15 06:11:15,970 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 06:11:15,970 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-15 06:11:15,984 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-15 06:11:15,984 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-15 06:11:15,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 06:11:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-15 06:11:16,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:16,073 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-15 06:11:16,073 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-15 06:11:16,073 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-15 06:11:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:16,075 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-15 06:11:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-15 06:11:16,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:16,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:16,086 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-15 06:11:16,087 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-15 06:11:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:16,088 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-15 06:11:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-15 06:11:16,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:16,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:16,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:16,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:16,089 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-15 06:11:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-04-15 06:11:16,090 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 16 [2022-04-15 06:11:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:16,090 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-04-15 06:11:16,090 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:16,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 66 transitions. [2022-04-15 06:11:16,161 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-15 06:11:16,161 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-15 06:11:16,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:11:16,161 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:16,161 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:16,161 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 06:11:16,162 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-15 06:11:16,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:16,162 INFO L85 PathProgramCache]: Analyzing trace with hash 469655877, now seen corresponding path program 1 times [2022-04-15 06:11:16,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:16,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1978439609] [2022-04-15 06:11:16,163 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:16,163 INFO L85 PathProgramCache]: Analyzing trace with hash 469655877, now seen corresponding path program 2 times [2022-04-15 06:11:16,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:16,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481381] [2022-04-15 06:11:16,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:16,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:16,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:16,290 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-15 06:11:16,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {2824#true} assume true; {2824#true} is VALID [2022-04-15 06:11:16,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2824#true} {2824#true} #181#return; {2824#true} is VALID [2022-04-15 06:11:16,293 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-15 06:11:16,293 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-15 06:11:16,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {2824#true} assume true; {2824#true} is VALID [2022-04-15 06:11:16,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2824#true} {2824#true} #181#return; {2824#true} is VALID [2022-04-15 06:11:16,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {2824#true} call #t~ret10 := main(); {2824#true} is VALID [2022-04-15 06:11:16,294 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-15 06:11:16,294 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-15 06:11:16,294 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-15 06:11:16,294 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-15 06:11:16,295 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-15 06:11:16,296 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-15 06:11:16,297 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-15 06:11:16,297 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-15 06:11:16,298 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-15 06:11:16,299 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-15 06:11:16,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {2825#false} assume !false; {2825#false} is VALID [2022-04-15 06:11:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:16,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:16,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481381] [2022-04-15 06:11:16,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:16,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:16,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:16,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:16,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1978439609] [2022-04-15 06:11:16,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1978439609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:16,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:16,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:16,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475517206] [2022-04-15 06:11:16,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:16,307 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-15 06:11:16,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:16,308 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-15 06:11:16,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:16,318 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:11:16,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:16,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:11:16,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:11:16,319 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-15 06:11:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:17,025 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2022-04-15 06:11:17,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:11:17,025 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-15 06:11:17,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:17,025 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-15 06:11:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-15 06:11:17,027 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-15 06:11:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-15 06:11:17,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2022-04-15 06:11:17,111 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-15 06:11:17,112 INFO L225 Difference]: With dead ends: 104 [2022-04-15 06:11:17,112 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 06:11:17,113 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-15 06:11:17,113 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 96 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:11:17,113 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.3s Time] [2022-04-15 06:11:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 06:11:17,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 60. [2022-04-15 06:11:17,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:17,192 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-15 06:11:17,192 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-15 06:11:17,192 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-15 06:11:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:17,195 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-04-15 06:11:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-04-15 06:11:17,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:17,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:17,195 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-15 06:11:17,195 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-15 06:11:17,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:17,198 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-04-15 06:11:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-04-15 06:11:17,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:17,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:17,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:17,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:17,198 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-15 06:11:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-04-15 06:11:17,199 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2022-04-15 06:11:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:17,200 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-04-15 06:11:17,200 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-15 06:11:17,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 64 transitions. [2022-04-15 06:11:17,288 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-15 06:11:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-15 06:11:17,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:11:17,289 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:17,289 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:17,289 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 06:11:17,289 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-15 06:11:17,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:17,289 INFO L85 PathProgramCache]: Analyzing trace with hash 469225894, now seen corresponding path program 1 times [2022-04-15 06:11:17,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:17,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [525384889] [2022-04-15 06:11:17,291 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:17,291 INFO L85 PathProgramCache]: Analyzing trace with hash 469225894, now seen corresponding path program 2 times [2022-04-15 06:11:17,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:17,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670783230] [2022-04-15 06:11:17,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:17,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:17,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:17,371 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-15 06:11:17,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {3371#true} assume true; {3371#true} is VALID [2022-04-15 06:11:17,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3371#true} {3371#true} #181#return; {3371#true} is VALID [2022-04-15 06:11:17,387 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-15 06:11:17,388 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-15 06:11:17,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#true} assume true; {3371#true} is VALID [2022-04-15 06:11:17,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3371#true} {3371#true} #181#return; {3371#true} is VALID [2022-04-15 06:11:17,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {3371#true} call #t~ret10 := main(); {3371#true} is VALID [2022-04-15 06:11:17,388 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-15 06:11:17,388 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-15 06:11:17,388 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-15 06:11:17,388 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-15 06:11:17,388 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-15 06:11:17,389 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-15 06:11:17,389 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-15 06:11:17,390 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-15 06:11:17,390 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-15 06:11:17,390 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-15 06:11:17,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {3372#false} assume !false; {3372#false} is VALID [2022-04-15 06:11:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:17,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:17,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670783230] [2022-04-15 06:11:17,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670783230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:17,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:17,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:11:17,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:17,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [525384889] [2022-04-15 06:11:17,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [525384889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:17,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:17,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:11:17,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093886170] [2022-04-15 06:11:17,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:17,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:11:17,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:17,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:17,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:17,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:11:17,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:11:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:11:17,403 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-15 06:11:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:17,784 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-15 06:11:17,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:11:17,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:11:17,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-15 06:11:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-15 06:11:17,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-04-15 06:11:17,850 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-15 06:11:17,850 INFO L225 Difference]: With dead ends: 61 [2022-04-15 06:11:17,851 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 06:11:17,851 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:17,851 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-15 06:11:17,852 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-15 06:11:17,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 06:11:17,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-04-15 06:11:17,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:17,935 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-15 06:11:17,935 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-15 06:11:17,936 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-15 06:11:17,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:17,938 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-15 06:11:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-15 06:11:17,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:17,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:17,938 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-15 06:11:17,939 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-15 06:11:17,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:17,940 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-15 06:11:17,940 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-15 06:11:17,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:17,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:17,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:17,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:17,940 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-15 06:11:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-15 06:11:17,941 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2022-04-15 06:11:17,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:17,942 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-15 06:11:17,942 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:17,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2022-04-15 06:11:18,014 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-15 06:11:18,014 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-15 06:11:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:11:18,015 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:18,015 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:18,015 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 06:11:18,016 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-15 06:11:18,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:18,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1457581016, now seen corresponding path program 1 times [2022-04-15 06:11:18,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:18,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1299932246] [2022-04-15 06:11:18,018 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:18,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1457581016, now seen corresponding path program 2 times [2022-04-15 06:11:18,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:18,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856569780] [2022-04-15 06:11:18,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:18,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:18,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:18,115 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-15 06:11:18,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-15 06:11:18,115 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3733#true} {3733#true} #181#return; {3733#true} is VALID [2022-04-15 06:11:18,116 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-15 06:11:18,116 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-15 06:11:18,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-15 06:11:18,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3733#true} {3733#true} #181#return; {3733#true} is VALID [2022-04-15 06:11:18,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {3733#true} call #t~ret10 := main(); {3733#true} is VALID [2022-04-15 06:11:18,116 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-15 06:11:18,117 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-15 06:11:18,117 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-15 06:11:18,117 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-15 06:11:18,118 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-15 06:11:18,118 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-15 06:11:18,118 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-15 06:11:18,119 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-15 06:11:18,119 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-15 06:11:18,123 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-15 06:11:18,123 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-15 06:11:18,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {3734#false} assume !false; {3734#false} is VALID [2022-04-15 06:11:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:18,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:18,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856569780] [2022-04-15 06:11:18,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856569780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:18,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:18,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:18,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:18,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1299932246] [2022-04-15 06:11:18,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1299932246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:18,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:18,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:18,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417830514] [2022-04-15 06:11:18,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:18,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:11:18,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:18,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:18,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:18,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:11:18,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:18,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:11:18,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:11:18,137 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-15 06:11:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:18,632 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-04-15 06:11:18,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:11:18,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:11:18,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-15 06:11:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-15 06:11:18,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-15 06:11:18,714 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-15 06:11:18,715 INFO L225 Difference]: With dead ends: 74 [2022-04-15 06:11:18,715 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 06:11:18,715 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-15 06:11:18,716 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:11:18,716 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.2s Time] [2022-04-15 06:11:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 06:11:18,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2022-04-15 06:11:18,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:18,785 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-15 06:11:18,795 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-15 06:11:18,795 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-15 06:11:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:18,796 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-15 06:11:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-15 06:11:18,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:18,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:18,797 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-15 06:11:18,797 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-15 06:11:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:18,798 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-15 06:11:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-15 06:11:18,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:18,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:18,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:18,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:18,799 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-15 06:11:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-15 06:11:18,799 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2022-04-15 06:11:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:18,799 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-15 06:11:18,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:18,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 58 transitions. [2022-04-15 06:11:18,899 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-15 06:11:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-15 06:11:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:11:18,900 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:18,900 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:18,901 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 06:11:18,901 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-15 06:11:18,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:18,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1459120216, now seen corresponding path program 1 times [2022-04-15 06:11:18,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:18,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2102232772] [2022-04-15 06:11:18,902 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:18,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1459120216, now seen corresponding path program 2 times [2022-04-15 06:11:18,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:18,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152526636] [2022-04-15 06:11:18,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:18,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:18,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:18,959 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-15 06:11:18,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 06:11:18,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4148#true} {4148#true} #181#return; {4148#true} is VALID [2022-04-15 06:11:18,960 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-15 06:11:18,961 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-15 06:11:18,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 06:11:18,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4148#true} {4148#true} #181#return; {4148#true} is VALID [2022-04-15 06:11:18,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {4148#true} call #t~ret10 := main(); {4148#true} is VALID [2022-04-15 06:11:18,961 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-15 06:11:18,961 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-15 06:11:18,961 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-15 06:11:18,962 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-15 06:11:18,963 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-15 06:11:18,963 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-15 06:11:18,963 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-15 06:11:18,964 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-15 06:11:18,964 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-15 06:11:18,964 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-15 06:11:18,965 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-15 06:11:18,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-15 06:11:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:18,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:18,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152526636] [2022-04-15 06:11:18,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152526636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:18,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:18,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:18,966 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:18,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2102232772] [2022-04-15 06:11:18,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2102232772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:18,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:18,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:18,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879435706] [2022-04-15 06:11:18,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:18,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:11:18,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:18,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:18,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:18,977 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:11:18,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:18,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:11:18,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:11:18,978 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-15 06:11:19,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:19,390 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-15 06:11:19,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:11:19,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:11:19,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-15 06:11:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-15 06:11:19,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-15 06:11:19,453 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-15 06:11:19,454 INFO L225 Difference]: With dead ends: 55 [2022-04-15 06:11:19,454 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 06:11:19,454 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-15 06:11:19,454 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-15 06:11:19,455 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-15 06:11:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 06:11:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-15 06:11:19,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:19,525 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-15 06:11:19,526 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-15 06:11:19,526 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-15 06:11:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:19,527 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-15 06:11:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-15 06:11:19,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:19,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:19,527 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-15 06:11:19,527 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-15 06:11:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:19,528 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-15 06:11:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-15 06:11:19,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:19,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:19,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:19,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:19,528 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-15 06:11:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-15 06:11:19,529 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2022-04-15 06:11:19,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:19,529 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-15 06:11:19,530 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:19,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-15 06:11:19,600 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-15 06:11:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-15 06:11:19,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:11:19,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:19,601 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:19,601 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 06:11:19,601 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-15 06:11:19,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1674433506, now seen corresponding path program 1 times [2022-04-15 06:11:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:19,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1093732627] [2022-04-15 06:11:19,602 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:19,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1674433506, now seen corresponding path program 2 times [2022-04-15 06:11:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:19,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810890284] [2022-04-15 06:11:19,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:19,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:19,767 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-15 06:11:19,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {4483#true} assume true; {4483#true} is VALID [2022-04-15 06:11:19,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4483#true} {4483#true} #181#return; {4483#true} is VALID [2022-04-15 06:11:19,768 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-15 06:11:19,768 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-15 06:11:19,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {4483#true} assume true; {4483#true} is VALID [2022-04-15 06:11:19,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4483#true} {4483#true} #181#return; {4483#true} is VALID [2022-04-15 06:11:19,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {4483#true} call #t~ret10 := main(); {4483#true} is VALID [2022-04-15 06:11:19,769 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-15 06:11:19,769 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-15 06:11:19,770 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-15 06:11:19,770 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-15 06:11:19,771 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-15 06:11:19,771 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-15 06:11:19,771 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-15 06:11:19,772 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-15 06:11:19,787 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-15 06:11:19,788 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-15 06:11:19,789 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-15 06:11:19,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {4484#false} assume !false; {4484#false} is VALID [2022-04-15 06:11:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:19,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:19,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810890284] [2022-04-15 06:11:19,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810890284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:19,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:19,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:19,790 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:19,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1093732627] [2022-04-15 06:11:19,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1093732627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:19,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:19,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:19,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510997391] [2022-04-15 06:11:19,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:19,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:11:19,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:19,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:19,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:19,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:11:19,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:19,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:11:19,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:19,804 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-15 06:11:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:20,572 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-04-15 06:11:20,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:11:20,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:11:20,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-15 06:11:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-15 06:11:20,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 119 transitions. [2022-04-15 06:11:20,690 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-15 06:11:20,691 INFO L225 Difference]: With dead ends: 110 [2022-04-15 06:11:20,691 INFO L226 Difference]: Without dead ends: 108 [2022-04-15 06:11:20,691 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-15 06:11:20,692 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-15 06:11:20,692 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-15 06:11:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-15 06:11:20,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 57. [2022-04-15 06:11:20,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:20,794 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-15 06:11:20,796 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-15 06:11:20,796 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-15 06:11:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:20,810 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-04-15 06:11:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-04-15 06:11:20,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:20,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:20,811 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-15 06:11:20,811 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-15 06:11:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:20,813 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-04-15 06:11:20,813 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-04-15 06:11:20,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:20,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:20,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:20,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:20,813 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-15 06:11:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-04-15 06:11:20,814 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 17 [2022-04-15 06:11:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:20,814 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-04-15 06:11:20,814 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:20,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 62 transitions. [2022-04-15 06:11:20,911 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-15 06:11:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-15 06:11:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:11:20,913 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:20,913 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:20,913 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 06:11:20,913 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-15 06:11:20,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:20,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2058260233, now seen corresponding path program 1 times [2022-04-15 06:11:20,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:20,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [344734455] [2022-04-15 06:11:20,914 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:20,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2058260233, now seen corresponding path program 2 times [2022-04-15 06:11:20,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:20,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029382115] [2022-04-15 06:11:20,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:20,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:20,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:20,967 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-15 06:11:20,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {5051#true} assume true; {5051#true} is VALID [2022-04-15 06:11:20,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5051#true} {5051#true} #181#return; {5051#true} is VALID [2022-04-15 06:11:20,969 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-15 06:11:20,969 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-15 06:11:20,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {5051#true} assume true; {5051#true} is VALID [2022-04-15 06:11:20,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5051#true} {5051#true} #181#return; {5051#true} is VALID [2022-04-15 06:11:20,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {5051#true} call #t~ret10 := main(); {5051#true} is VALID [2022-04-15 06:11:20,969 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-15 06:11:20,976 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-15 06:11:20,977 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-15 06:11:20,977 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-15 06:11:20,977 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-15 06:11:20,978 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-15 06:11:20,978 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-15 06:11:20,978 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-15 06:11:20,978 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-15 06:11:20,979 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-15 06:11:20,979 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-15 06:11:20,980 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-15 06:11:20,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {5052#false} assume !false; {5052#false} is VALID [2022-04-15 06:11:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:20,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:20,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029382115] [2022-04-15 06:11:20,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029382115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:20,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:20,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:20,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:20,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [344734455] [2022-04-15 06:11:20,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [344734455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:20,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:20,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:11:20,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228099808] [2022-04-15 06:11:20,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:20,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:11:20,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:20,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:21,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:21,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:11:21,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:21,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:11:21,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:11:21,006 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-15 06:11:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:21,663 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-04-15 06:11:21,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:11:21,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:11:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:21,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-15 06:11:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-15 06:11:21,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-15 06:11:21,715 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-15 06:11:21,716 INFO L225 Difference]: With dead ends: 77 [2022-04-15 06:11:21,716 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 06:11:21,716 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-15 06:11:21,717 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 63 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:11:21,717 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.2s Time] [2022-04-15 06:11:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 06:11:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2022-04-15 06:11:21,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:21,806 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-15 06:11:21,815 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-15 06:11:21,815 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-15 06:11:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:21,817 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-15 06:11:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-15 06:11:21,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:21,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:21,818 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-15 06:11:21,818 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-15 06:11:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:21,828 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-15 06:11:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-15 06:11:21,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:21,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:21,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:21,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:21,828 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-15 06:11:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-04-15 06:11:21,829 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 18 [2022-04-15 06:11:21,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:21,829 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-04-15 06:11:21,829 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:21,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 60 transitions. [2022-04-15 06:11:21,924 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-15 06:11:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-04-15 06:11:21,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:11:21,925 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:21,925 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:21,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 06:11:21,925 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-15 06:11:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:21,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2059625653, now seen corresponding path program 1 times [2022-04-15 06:11:21,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:21,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [255968789] [2022-04-15 06:11:21,926 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:21,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2059625653, now seen corresponding path program 2 times [2022-04-15 06:11:21,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:21,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074276813] [2022-04-15 06:11:21,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:21,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:22,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:22,022 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-15 06:11:22,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-15 06:11:22,022 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5480#true} {5480#true} #181#return; {5480#true} is VALID [2022-04-15 06:11:22,022 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-15 06:11:22,023 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-15 06:11:22,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-15 06:11:22,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5480#true} #181#return; {5480#true} is VALID [2022-04-15 06:11:22,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {5480#true} call #t~ret10 := main(); {5480#true} is VALID [2022-04-15 06:11:22,023 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-15 06:11:22,023 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-15 06:11:22,024 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-15 06:11:22,024 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-15 06:11:22,025 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-15 06:11:22,025 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-15 06:11:22,026 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-15 06:11:22,026 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-15 06:11:22,026 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-15 06:11:22,027 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-15 06:11:22,027 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-15 06:11:22,028 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-15 06:11:22,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {5481#false} assume !false; {5481#false} is VALID [2022-04-15 06:11:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:22,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:22,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074276813] [2022-04-15 06:11:22,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074276813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:22,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:22,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:22,029 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:22,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [255968789] [2022-04-15 06:11:22,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [255968789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:22,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:22,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:22,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761796545] [2022-04-15 06:11:22,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:22,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-15 06:11:22,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:22,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:22,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:22,042 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:11:22,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:22,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:11:22,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:22,043 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-15 06:11:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:22,677 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-15 06:11:22,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:11:22,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:11:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 06:11:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 06:11:22,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-15 06:11:22,792 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-15 06:11:22,793 INFO L225 Difference]: With dead ends: 92 [2022-04-15 06:11:22,793 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 06:11:22,794 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-15 06:11:22,794 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-15 06:11:22,794 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-15 06:11:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 06:11:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2022-04-15 06:11:22,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:22,921 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-15 06:11:22,921 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-15 06:11:22,921 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-15 06:11:22,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:22,922 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-04-15 06:11:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-04-15 06:11:22,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:22,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:22,923 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-15 06:11:22,923 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-15 06:11:22,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:22,924 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-04-15 06:11:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-04-15 06:11:22,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:22,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:22,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:22,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:22,924 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-15 06:11:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-04-15 06:11:22,925 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 18 [2022-04-15 06:11:22,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:22,925 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-04-15 06:11:22,928 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:22,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 67 transitions. [2022-04-15 06:11:23,006 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-15 06:11:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-15 06:11:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:11:23,007 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:23,007 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:23,007 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 06:11:23,007 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-15 06:11:23,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:23,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2011910403, now seen corresponding path program 1 times [2022-04-15 06:11:23,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:23,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [364232670] [2022-04-15 06:11:23,008 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:23,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2011910403, now seen corresponding path program 2 times [2022-04-15 06:11:23,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:23,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365195704] [2022-04-15 06:11:23,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:23,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:23,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:23,140 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-15 06:11:23,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {5982#true} assume true; {5982#true} is VALID [2022-04-15 06:11:23,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5982#true} {5982#true} #181#return; {5982#true} is VALID [2022-04-15 06:11:23,146 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-15 06:11:23,147 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-15 06:11:23,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {5982#true} assume true; {5982#true} is VALID [2022-04-15 06:11:23,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5982#true} {5982#true} #181#return; {5982#true} is VALID [2022-04-15 06:11:23,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {5982#true} call #t~ret10 := main(); {5982#true} is VALID [2022-04-15 06:11:23,151 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-15 06:11:23,152 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-15 06:11:23,153 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-15 06:11:23,154 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-15 06:11:23,154 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-15 06:11:23,155 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-15 06:11:23,158 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-15 06:11:23,159 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-15 06:11:23,159 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-15 06:11:23,160 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-15 06:11:23,160 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-15 06:11:23,160 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-15 06:11:23,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {5983#false} assume !false; {5983#false} is VALID [2022-04-15 06:11:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:23,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:23,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365195704] [2022-04-15 06:11:23,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365195704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:23,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:23,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:23,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:23,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [364232670] [2022-04-15 06:11:23,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [364232670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:23,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:23,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:23,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731779818] [2022-04-15 06:11:23,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:23,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:11:23,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:23,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:23,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:23,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:11:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:23,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:11:23,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:23,175 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-15 06:11:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:23,655 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-15 06:11:23,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:11:23,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:11:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-15 06:11:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-15 06:11:23,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2022-04-15 06:11:23,729 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-15 06:11:23,730 INFO L225 Difference]: With dead ends: 76 [2022-04-15 06:11:23,730 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 06:11:23,730 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-15 06:11:23,730 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-15 06:11:23,731 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-15 06:11:23,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 06:11:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2022-04-15 06:11:23,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:23,869 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-15 06:11:23,869 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-15 06:11:23,869 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-15 06:11:23,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:23,870 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-15 06:11:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-04-15 06:11:23,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:23,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:23,871 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-15 06:11:23,871 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-15 06:11:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:23,872 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-15 06:11:23,872 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-04-15 06:11:23,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:23,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:23,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:23,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:23,872 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-15 06:11:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-04-15 06:11:23,873 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 18 [2022-04-15 06:11:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:23,873 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-04-15 06:11:23,874 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:23,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 68 transitions. [2022-04-15 06:11:23,980 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-15 06:11:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-15 06:11:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:11:23,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:23,981 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:23,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 06:11:23,981 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-15 06:11:23,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash 361585193, now seen corresponding path program 1 times [2022-04-15 06:11:23,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:23,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1621543236] [2022-04-15 06:11:23,982 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash 361585193, now seen corresponding path program 2 times [2022-04-15 06:11:23,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:23,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963614399] [2022-04-15 06:11:23,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:23,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:24,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:24,117 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-15 06:11:24,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {6418#true} assume true; {6418#true} is VALID [2022-04-15 06:11:24,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6418#true} {6418#true} #181#return; {6418#true} is VALID [2022-04-15 06:11:24,118 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-15 06:11:24,118 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-15 06:11:24,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {6418#true} assume true; {6418#true} is VALID [2022-04-15 06:11:24,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6418#true} {6418#true} #181#return; {6418#true} is VALID [2022-04-15 06:11:24,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {6418#true} call #t~ret10 := main(); {6418#true} is VALID [2022-04-15 06:11:24,119 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-15 06:11:24,119 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-15 06:11:24,119 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-15 06:11:24,120 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-15 06:11:24,120 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-15 06:11:24,120 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-15 06:11:24,121 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-15 06:11:24,121 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-15 06:11:24,122 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-15 06:11:24,122 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-15 06:11:24,122 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-15 06:11:24,123 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-15 06:11:24,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {6419#false} assume !false; {6419#false} is VALID [2022-04-15 06:11:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:24,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:24,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963614399] [2022-04-15 06:11:24,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963614399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:24,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:24,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:24,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:24,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1621543236] [2022-04-15 06:11:24,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1621543236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:24,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:24,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:24,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89516104] [2022-04-15 06:11:24,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:24,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:11:24,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:24,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:24,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:24,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:11:24,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:24,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:11:24,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:24,137 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-15 06:11:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:24,568 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-15 06:11:24,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:11:24,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:11:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2022-04-15 06:11:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2022-04-15 06:11:24,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 79 transitions. [2022-04-15 06:11:24,650 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-15 06:11:24,651 INFO L225 Difference]: With dead ends: 72 [2022-04-15 06:11:24,651 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 06:11:24,651 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-15 06:11:24,652 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-15 06:11:24,652 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-15 06:11:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 06:11:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-04-15 06:11:24,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:24,787 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-15 06:11:24,787 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-15 06:11:24,787 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-15 06:11:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:24,788 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-15 06:11:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-15 06:11:24,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:24,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:24,788 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-15 06:11:24,789 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-15 06:11:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:24,791 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-15 06:11:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-15 06:11:24,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:24,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:24,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:24,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:24,792 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-15 06:11:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-04-15 06:11:24,792 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 18 [2022-04-15 06:11:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:24,793 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-04-15 06:11:24,793 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:24,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 71 transitions. [2022-04-15 06:11:24,925 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-15 06:11:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-15 06:11:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:11:24,925 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:24,925 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:24,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 06:11:24,926 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-15 06:11:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:24,926 INFO L85 PathProgramCache]: Analyzing trace with hash 618445355, now seen corresponding path program 1 times [2022-04-15 06:11:24,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:24,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1445730461] [2022-04-15 06:11:24,926 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:24,926 INFO L85 PathProgramCache]: Analyzing trace with hash 618445355, now seen corresponding path program 2 times [2022-04-15 06:11:24,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:24,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120688119] [2022-04-15 06:11:24,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:24,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:25,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:25,065 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-15 06:11:25,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {6850#true} assume true; {6850#true} is VALID [2022-04-15 06:11:25,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6850#true} {6850#true} #181#return; {6850#true} is VALID [2022-04-15 06:11:25,066 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-15 06:11:25,066 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-15 06:11:25,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {6850#true} assume true; {6850#true} is VALID [2022-04-15 06:11:25,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6850#true} {6850#true} #181#return; {6850#true} is VALID [2022-04-15 06:11:25,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {6850#true} call #t~ret10 := main(); {6850#true} is VALID [2022-04-15 06:11:25,066 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-15 06:11:25,067 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-15 06:11:25,067 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-15 06:11:25,068 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-15 06:11:25,072 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-15 06:11:25,073 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-15 06:11:25,073 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-15 06:11:25,074 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-15 06:11:25,087 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-15 06:11:25,088 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-15 06:11:25,088 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-15 06:11:25,089 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-15 06:11:25,089 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-15 06:11:25,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {6851#false} assume !false; {6851#false} is VALID [2022-04-15 06:11:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:25,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:25,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120688119] [2022-04-15 06:11:25,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120688119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:25,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:25,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:25,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:25,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1445730461] [2022-04-15 06:11:25,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1445730461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:25,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:25,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:25,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142527489] [2022-04-15 06:11:25,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:25,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:11:25,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:25,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:25,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:25,108 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:11:25,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:25,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:11:25,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:25,109 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-15 06:11:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:25,763 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-15 06:11:25,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:11:25,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:11:25,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-04-15 06:11:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-04-15 06:11:25,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 100 transitions. [2022-04-15 06:11:26,012 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-15 06:11:26,013 INFO L225 Difference]: With dead ends: 91 [2022-04-15 06:11:26,013 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 06:11:26,014 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-15 06:11:26,014 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 49 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:11:26,014 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.2s Time] [2022-04-15 06:11:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 06:11:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-15 06:11:26,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:26,125 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-15 06:11:26,125 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-15 06:11:26,125 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-15 06:11:26,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:26,126 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-04-15 06:11:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-04-15 06:11:26,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:26,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:26,127 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-15 06:11:26,127 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-15 06:11:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:26,145 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-04-15 06:11:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-04-15 06:11:26,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:26,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:26,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:26,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:26,145 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-15 06:11:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-04-15 06:11:26,146 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 19 [2022-04-15 06:11:26,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:26,147 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-04-15 06:11:26,147 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:26,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 74 transitions. [2022-04-15 06:11:26,269 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-15 06:11:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-15 06:11:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:11:26,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:26,270 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:26,270 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 06:11:26,270 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-15 06:11:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:26,270 INFO L85 PathProgramCache]: Analyzing trace with hash 679767566, now seen corresponding path program 1 times [2022-04-15 06:11:26,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:26,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1636913955] [2022-04-15 06:11:26,271 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:26,271 INFO L85 PathProgramCache]: Analyzing trace with hash 679767566, now seen corresponding path program 2 times [2022-04-15 06:11:26,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:26,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753883905] [2022-04-15 06:11:26,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:26,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:26,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:26,340 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-15 06:11:26,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {7362#true} assume true; {7362#true} is VALID [2022-04-15 06:11:26,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7362#true} {7362#true} #181#return; {7362#true} is VALID [2022-04-15 06:11:26,344 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-15 06:11:26,344 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-15 06:11:26,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {7362#true} assume true; {7362#true} is VALID [2022-04-15 06:11:26,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7362#true} {7362#true} #181#return; {7362#true} is VALID [2022-04-15 06:11:26,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {7362#true} call #t~ret10 := main(); {7362#true} is VALID [2022-04-15 06:11:26,345 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-15 06:11:26,345 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-15 06:11:26,346 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-15 06:11:26,346 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-15 06:11:26,346 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-15 06:11:26,347 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-15 06:11:26,347 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-15 06:11:26,347 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-15 06:11:26,347 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-15 06:11:26,348 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-15 06:11:26,348 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-15 06:11:26,363 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-15 06:11:26,364 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-15 06:11:26,364 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-15 06:11:26,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {7363#false} assume !false; {7363#false} is VALID [2022-04-15 06:11:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:26,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:26,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753883905] [2022-04-15 06:11:26,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753883905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:26,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:26,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:11:26,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:26,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1636913955] [2022-04-15 06:11:26,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1636913955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:26,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:26,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:11:26,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433662791] [2022-04-15 06:11:26,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:26,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 06:11:26,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:26,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:26,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:26,379 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:11:26,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:26,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:11:26,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:11:26,380 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-15 06:11:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:26,691 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-15 06:11:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:11:26,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 06:11:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:26,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-15 06:11:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-15 06:11:26,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-15 06:11:26,741 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-15 06:11:26,742 INFO L225 Difference]: With dead ends: 67 [2022-04-15 06:11:26,742 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 06:11:26,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:26,742 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:11:26,743 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.1s Time] [2022-04-15 06:11:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 06:11:26,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 06:11:26,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:26,897 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-15 06:11:26,897 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-15 06:11:26,897 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-15 06:11:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:26,901 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-15 06:11:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-15 06:11:26,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:26,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:26,901 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-15 06:11:26,902 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-15 06:11:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:26,902 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-15 06:11:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-15 06:11:26,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:26,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:26,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:26,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:26,903 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-15 06:11:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-04-15 06:11:26,904 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 20 [2022-04-15 06:11:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:26,904 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-04-15 06:11:26,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:26,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 72 transitions. [2022-04-15 06:11:27,089 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-15 06:11:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-15 06:11:27,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:11:27,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:27,090 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:27,090 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 06:11:27,090 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-15 06:11:27,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:27,091 INFO L85 PathProgramCache]: Analyzing trace with hash -402038812, now seen corresponding path program 1 times [2022-04-15 06:11:27,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:27,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [702726224] [2022-04-15 06:11:27,091 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:27,091 INFO L85 PathProgramCache]: Analyzing trace with hash -402038812, now seen corresponding path program 2 times [2022-04-15 06:11:27,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:27,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597423425] [2022-04-15 06:11:27,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:27,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:27,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:27,160 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-15 06:11:27,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {7770#true} assume true; {7770#true} is VALID [2022-04-15 06:11:27,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7770#true} {7770#true} #181#return; {7770#true} is VALID [2022-04-15 06:11:27,165 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-15 06:11:27,166 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-15 06:11:27,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {7770#true} assume true; {7770#true} is VALID [2022-04-15 06:11:27,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7770#true} {7770#true} #181#return; {7770#true} is VALID [2022-04-15 06:11:27,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {7770#true} call #t~ret10 := main(); {7770#true} is VALID [2022-04-15 06:11:27,166 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-15 06:11:27,166 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-15 06:11:27,166 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-15 06:11:27,166 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-15 06:11:27,166 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-15 06:11:27,166 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-15 06:11:27,166 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-15 06:11:27,166 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-15 06:11:27,167 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-15 06:11:27,167 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-15 06:11:27,167 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-15 06:11:27,167 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-15 06:11:27,167 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-15 06:11:27,168 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-15 06:11:27,168 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-15 06:11:27,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {7771#false} assume !false; {7771#false} is VALID [2022-04-15 06:11:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:27,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:27,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597423425] [2022-04-15 06:11:27,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597423425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:27,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:27,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:11:27,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:27,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [702726224] [2022-04-15 06:11:27,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [702726224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:27,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:27,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:11:27,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711450131] [2022-04-15 06:11:27,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:27,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 06:11:27,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:27,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:27,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:27,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:11:27,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:27,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:11:27,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:11:27,197 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-15 06:11:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:27,546 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-15 06:11:27,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:11:27,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 06:11:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-15 06:11:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-15 06:11:27,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-15 06:11:27,595 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-15 06:11:27,596 INFO L225 Difference]: With dead ends: 65 [2022-04-15 06:11:27,596 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 06:11:27,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:27,597 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-15 06:11:27,597 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-15 06:11:27,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 06:11:27,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-15 06:11:27,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:27,707 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-15 06:11:27,707 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-15 06:11:27,707 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-15 06:11:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:27,708 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-15 06:11:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-15 06:11:27,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:27,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:27,708 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-15 06:11:27,709 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-15 06:11:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:27,709 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-15 06:11:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-15 06:11:27,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:27,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:27,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:27,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:27,710 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-15 06:11:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-04-15 06:11:27,710 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 21 [2022-04-15 06:11:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:27,711 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-04-15 06:11:27,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:27,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 68 transitions. [2022-04-15 06:11:27,821 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-15 06:11:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-15 06:11:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:11:27,822 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:27,822 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:27,822 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 06:11:27,822 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-15 06:11:27,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:27,822 INFO L85 PathProgramCache]: Analyzing trace with hash 434938978, now seen corresponding path program 1 times [2022-04-15 06:11:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:27,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [855116434] [2022-04-15 06:11:27,823 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash 434938978, now seen corresponding path program 2 times [2022-04-15 06:11:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:27,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175800072] [2022-04-15 06:11:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:27,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:27,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:27,921 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-15 06:11:27,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {8159#true} assume true; {8159#true} is VALID [2022-04-15 06:11:27,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8159#true} {8159#true} #181#return; {8159#true} is VALID [2022-04-15 06:11:27,922 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-15 06:11:27,922 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-15 06:11:27,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {8159#true} assume true; {8159#true} is VALID [2022-04-15 06:11:27,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8159#true} {8159#true} #181#return; {8159#true} is VALID [2022-04-15 06:11:27,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {8159#true} call #t~ret10 := main(); {8159#true} is VALID [2022-04-15 06:11:27,923 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-15 06:11:27,923 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-15 06:11:27,923 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-15 06:11:27,923 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-15 06:11:27,923 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-15 06:11:27,923 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-15 06:11:27,923 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-15 06:11:27,923 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-15 06:11:27,924 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-15 06:11:27,925 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-15 06:11:27,925 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-15 06:11:27,927 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-15 06:11:27,927 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-15 06:11:27,928 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-15 06:11:27,930 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-15 06:11:27,930 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-15 06:11:27,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {8160#false} assume !false; {8160#false} is VALID [2022-04-15 06:11:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:27,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175800072] [2022-04-15 06:11:27,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175800072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:27,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:27,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:27,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:27,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [855116434] [2022-04-15 06:11:27,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [855116434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:27,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:27,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:27,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490460895] [2022-04-15 06:11:27,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:27,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 06:11:27,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:27,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:27,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:27,958 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:11:27,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:27,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:11:27,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:27,959 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-15 06:11:28,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:28,500 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-04-15 06:11:28,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:11:28,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 06:11:28,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-15 06:11:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-15 06:11:28,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2022-04-15 06:11:28,545 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-15 06:11:28,545 INFO L225 Difference]: With dead ends: 76 [2022-04-15 06:11:28,545 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 06:11:28,546 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:11:28,546 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-15 06:11:28,546 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-15 06:11:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 06:11:28,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2022-04-15 06:11:28,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:28,693 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-15 06:11:28,693 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-15 06:11:28,693 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-15 06:11:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:28,694 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-04-15 06:11:28,694 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-04-15 06:11:28,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:28,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:28,695 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-15 06:11:28,695 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-15 06:11:28,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:28,698 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-04-15 06:11:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-04-15 06:11:28,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:28,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:28,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:28,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:28,699 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-15 06:11:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-04-15 06:11:28,700 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 22 [2022-04-15 06:11:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:28,700 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-04-15 06:11:28,700 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:28,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 63 transitions. [2022-04-15 06:11:28,827 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-15 06:11:28,828 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-04-15 06:11:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:11:28,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:28,828 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-15 06:11:28,828 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 06:11:28,828 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-15 06:11:28,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash -178138558, now seen corresponding path program 1 times [2022-04-15 06:11:28,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:28,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [21005543] [2022-04-15 06:11:28,829 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash -178138558, now seen corresponding path program 2 times [2022-04-15 06:11:28,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:28,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999072127] [2022-04-15 06:11:28,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:28,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:28,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:28,923 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-15 06:11:28,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {8595#true} assume true; {8595#true} is VALID [2022-04-15 06:11:28,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8595#true} {8595#true} #181#return; {8595#true} is VALID [2022-04-15 06:11:28,923 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-15 06:11:28,924 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-15 06:11:28,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {8595#true} assume true; {8595#true} is VALID [2022-04-15 06:11:28,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8595#true} {8595#true} #181#return; {8595#true} is VALID [2022-04-15 06:11:28,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {8595#true} call #t~ret10 := main(); {8595#true} is VALID [2022-04-15 06:11:28,924 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-15 06:11:28,924 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-15 06:11:28,924 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-15 06:11:28,924 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-15 06:11:28,924 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-15 06:11:28,924 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-15 06:11:28,924 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-15 06:11:28,937 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-15 06:11:28,938 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-15 06:11:28,938 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-15 06:11:28,939 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-15 06:11:28,939 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-15 06:11:28,939 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-15 06:11:28,940 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-15 06:11:28,940 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-15 06:11:28,940 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-15 06:11:28,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {8596#false} assume !false; {8596#false} is VALID [2022-04-15 06:11:28,941 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-15 06:11:28,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:28,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999072127] [2022-04-15 06:11:28,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999072127] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:11:28,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431638788] [2022-04-15 06:11:28,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:11:28,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:11:28,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:11:28,956 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-15 06:11:28,999 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-15 06:11:29,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:11:29,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:11:29,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 06:11:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:29,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:11:30,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {8595#true} call ULTIMATE.init(); {8595#true} is VALID [2022-04-15 06:11:30,029 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-15 06:11:30,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {8595#true} assume true; {8595#true} is VALID [2022-04-15 06:11:30,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8595#true} {8595#true} #181#return; {8595#true} is VALID [2022-04-15 06:11:30,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {8595#true} call #t~ret10 := main(); {8595#true} is VALID [2022-04-15 06:11:30,030 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-15 06:11:30,030 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-15 06:11:30,031 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-15 06:11:30,031 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-15 06:11:30,032 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-15 06:11:30,032 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-15 06:11:30,033 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-15 06:11:30,033 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-15 06:11:30,033 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-15 06:11:30,034 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-15 06:11:30,034 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-15 06:11:30,035 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-15 06:11:30,035 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-15 06:11:30,036 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-15 06:11:30,036 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-15 06:11:30,036 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-15 06:11:30,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {8596#false} assume !false; {8596#false} is VALID [2022-04-15 06:11:30,037 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-15 06:11:30,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:11:30,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {8596#false} assume !false; {8596#false} is VALID [2022-04-15 06:11:30,253 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-15 06:11:30,253 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-15 06:11:30,253 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-15 06:11:30,254 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-15 06:11:30,254 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-15 06:11:30,254 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-15 06:11:30,255 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-15 06:11:30,255 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-15 06:11:30,255 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-15 06:11:30,256 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-15 06:11:30,256 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-15 06:11:30,256 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-15 06:11:30,257 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-15 06:11:30,257 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-15 06:11:30,257 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-15 06:11:30,258 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-15 06:11:30,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {8595#true} call #t~ret10 := main(); {8595#true} is VALID [2022-04-15 06:11:30,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8595#true} {8595#true} #181#return; {8595#true} is VALID [2022-04-15 06:11:30,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {8595#true} assume true; {8595#true} is VALID [2022-04-15 06:11:30,258 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-15 06:11:30,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {8595#true} call ULTIMATE.init(); {8595#true} is VALID [2022-04-15 06:11:30,258 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-15 06:11:30,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431638788] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:11:30,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:11:30,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-15 06:11:30,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:30,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [21005543] [2022-04-15 06:11:30,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [21005543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:30,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:30,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:11:30,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320961719] [2022-04-15 06:11:30,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:30,262 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-15 06:11:30,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:30,263 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-15 06:11:30,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:30,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:11:30,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:30,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:11:30,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:11:30,282 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-15 06:11:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:30,848 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-04-15 06:11:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:11:30,849 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-15 06:11:30,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:30,850 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-15 06:11:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-15 06:11:30,851 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-15 06:11:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-15 06:11:30,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-15 06:11:30,915 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-15 06:11:30,915 INFO L225 Difference]: With dead ends: 72 [2022-04-15 06:11:30,916 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 06:11:30,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:11:30,916 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-15 06:11:30,916 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-15 06:11:30,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 06:11:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2022-04-15 06:11:31,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:31,115 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-15 06:11:31,115 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-15 06:11:31,115 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-15 06:11:31,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:31,116 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-04-15 06:11:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-04-15 06:11:31,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:31,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:31,117 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-15 06:11:31,117 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-15 06:11:31,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:31,118 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-04-15 06:11:31,118 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-04-15 06:11:31,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:31,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:31,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:31,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:31,118 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-15 06:11:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-15 06:11:31,119 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 22 [2022-04-15 06:11:31,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:31,119 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-15 06:11:31,119 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-15 06:11:31,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 59 transitions. [2022-04-15 06:11:31,243 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-15 06:11:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-15 06:11:31,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:11:31,244 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:31,244 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-15 06:11:31,287 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-15 06:11:31,451 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-15 06:11:31,451 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-15 06:11:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash -93650716, now seen corresponding path program 1 times [2022-04-15 06:11:31,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:31,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1596444514] [2022-04-15 06:11:31,452 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash -93650716, now seen corresponding path program 2 times [2022-04-15 06:11:31,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:31,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618349042] [2022-04-15 06:11:31,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:31,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:31,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:31,547 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-15 06:11:31,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {9140#true} assume true; {9140#true} is VALID [2022-04-15 06:11:31,547 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9140#true} {9140#true} #181#return; {9140#true} is VALID [2022-04-15 06:11:31,548 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-15 06:11:31,548 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-15 06:11:31,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {9140#true} assume true; {9140#true} is VALID [2022-04-15 06:11:31,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9140#true} {9140#true} #181#return; {9140#true} is VALID [2022-04-15 06:11:31,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {9140#true} call #t~ret10 := main(); {9140#true} is VALID [2022-04-15 06:11:31,548 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-15 06:11:31,548 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-15 06:11:31,548 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-15 06:11:31,549 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-15 06:11:31,549 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-15 06:11:31,549 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-15 06:11:31,549 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-15 06:11:31,563 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-15 06:11:31,564 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-15 06:11:31,564 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-15 06:11:31,565 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-15 06:11:31,565 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-15 06:11:31,566 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-15 06:11:31,566 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-15 06:11:31,566 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-15 06:11:31,566 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-15 06:11:31,567 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-15 06:11:31,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {9141#false} assume !false; {9141#false} is VALID [2022-04-15 06:11:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:31,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:31,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618349042] [2022-04-15 06:11:31,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618349042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:31,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:31,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:31,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:31,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1596444514] [2022-04-15 06:11:31,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1596444514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:31,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:31,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:31,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191951882] [2022-04-15 06:11:31,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:31,569 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-15 06:11:31,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:31,569 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-15 06:11:31,583 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-15 06:11:31,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:11:31,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:31,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:11:31,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:31,583 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-15 06:11:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:32,050 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-04-15 06:11:32,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:11:32,050 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-15 06:11:32,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:32,050 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-15 06:11:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-15 06:11:32,051 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-15 06:11:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-15 06:11:32,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2022-04-15 06:11:32,103 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-15 06:11:32,104 INFO L225 Difference]: With dead ends: 64 [2022-04-15 06:11:32,104 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 06:11:32,104 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-15 06:11:32,104 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-15 06:11:32,104 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-15 06:11:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 06:11:32,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2022-04-15 06:11:32,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:32,235 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-15 06:11:32,235 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-15 06:11:32,235 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-15 06:11:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:32,236 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2022-04-15 06:11:32,236 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-04-15 06:11:32,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:32,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:32,236 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-15 06:11:32,236 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-15 06:11:32,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:32,237 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2022-04-15 06:11:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-04-15 06:11:32,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:32,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:32,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:32,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:32,238 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-15 06:11:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-04-15 06:11:32,239 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 23 [2022-04-15 06:11:32,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:32,239 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-04-15 06:11:32,239 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-15 06:11:32,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 53 transitions. [2022-04-15 06:11:32,348 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-15 06:11:32,349 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-15 06:11:32,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:11:32,349 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:32,349 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-15 06:11:32,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 06:11:32,349 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-15 06:11:32,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash -45935466, now seen corresponding path program 1 times [2022-04-15 06:11:32,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:32,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1979503714] [2022-04-15 06:11:32,350 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash -45935466, now seen corresponding path program 2 times [2022-04-15 06:11:32,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:32,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370287868] [2022-04-15 06:11:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:32,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:32,457 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-15 06:11:32,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-15 06:11:32,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9509#true} {9509#true} #181#return; {9509#true} is VALID [2022-04-15 06:11:32,458 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-15 06:11:32,458 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-15 06:11:32,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-15 06:11:32,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9509#true} {9509#true} #181#return; {9509#true} is VALID [2022-04-15 06:11:32,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {9509#true} call #t~ret10 := main(); {9509#true} is VALID [2022-04-15 06:11:32,458 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-15 06:11:32,459 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-15 06:11:32,459 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-15 06:11:32,459 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-15 06:11:32,459 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-15 06:11:32,459 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-15 06:11:32,459 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-15 06:11:32,459 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-15 06:11:32,460 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-15 06:11:32,460 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-15 06:11:32,461 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-15 06:11:32,461 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-15 06:11:32,461 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-15 06:11:32,462 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-15 06:11:32,462 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-15 06:11:32,462 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-15 06:11:32,462 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-15 06:11:32,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {9510#false} assume !false; {9510#false} is VALID [2022-04-15 06:11:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:32,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:32,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370287868] [2022-04-15 06:11:32,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370287868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:32,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:32,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:32,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:32,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1979503714] [2022-04-15 06:11:32,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1979503714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:32,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:32,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:11:32,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190588804] [2022-04-15 06:11:32,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:32,465 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-15 06:11:32,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:32,465 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-15 06:11:32,492 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-15 06:11:32,493 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:11:32,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:32,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:11:32,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:11:32,494 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-15 06:11:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:32,866 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-15 06:11:32,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:11:32,866 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-15 06:11:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:32,866 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-15 06:11:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-15 06:11:32,867 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-15 06:11:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-15 06:11:32,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-15 06:11:32,921 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-15 06:11:32,922 INFO L225 Difference]: With dead ends: 47 [2022-04-15 06:11:32,922 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 06:11:32,922 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-15 06:11:32,923 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-15 06:11:32,923 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-15 06:11:32,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 06:11:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 06:11:32,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:32,966 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-15 06:11:32,966 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-15 06:11:32,966 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-15 06:11:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:32,967 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 06:11:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 06:11:32,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:32,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:32,967 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-15 06:11:32,967 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-15 06:11:32,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:32,968 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 06:11:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 06:11:32,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:32,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:32,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:32,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:32,968 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-15 06:11:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 06:11:32,970 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 23 [2022-04-15 06:11:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:32,970 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 06:11:32,970 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-15 06:11:32,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-15 06:11:33,013 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-15 06:11:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 06:11:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:11:33,013 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:33,013 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-15 06:11:33,013 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 06:11:33,014 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-15 06:11:33,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1233573943, now seen corresponding path program 1 times [2022-04-15 06:11:33,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:33,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1323277127] [2022-04-15 06:11:33,014 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:11:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1233573943, now seen corresponding path program 2 times [2022-04-15 06:11:33,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:33,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103002275] [2022-04-15 06:11:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:33,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:33,300 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-15 06:11:33,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {9720#true} assume true; {9720#true} is VALID [2022-04-15 06:11:33,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9720#true} {9720#true} #181#return; {9720#true} is VALID [2022-04-15 06:11:33,301 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-15 06:11:33,301 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-15 06:11:33,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {9720#true} assume true; {9720#true} is VALID [2022-04-15 06:11:33,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9720#true} {9720#true} #181#return; {9720#true} is VALID [2022-04-15 06:11:33,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {9720#true} call #t~ret10 := main(); {9720#true} is VALID [2022-04-15 06:11:33,302 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-15 06:11:33,302 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-15 06:11:33,302 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-15 06:11:33,302 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-15 06:11:33,302 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-15 06:11:33,302 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-15 06:11:33,302 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-15 06:11:33,302 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-15 06:11:33,303 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-15 06:11:33,303 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-15 06:11:33,304 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-15 06:11:33,304 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-15 06:11:33,304 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-15 06:11:33,305 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-15 06:11:33,305 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-15 06:11:33,305 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-15 06:11:33,306 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-15 06:11:33,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {9721#false} assume !false; {9721#false} is VALID [2022-04-15 06:11:33,306 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-15 06:11:33,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:33,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103002275] [2022-04-15 06:11:33,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103002275] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:11:33,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201777041] [2022-04-15 06:11:33,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:11:33,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:11:33,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:11:33,308 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-15 06:11:33,351 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-15 06:11:33,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:11:33,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:11:33,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 06:11:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:33,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:11:34,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {9720#true} call ULTIMATE.init(); {9720#true} is VALID [2022-04-15 06:11:34,078 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-15 06:11:34,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {9720#true} assume true; {9720#true} is VALID [2022-04-15 06:11:34,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9720#true} {9720#true} #181#return; {9720#true} is VALID [2022-04-15 06:11:34,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {9720#true} call #t~ret10 := main(); {9720#true} is VALID [2022-04-15 06:11:34,078 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-15 06:11:34,078 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-15 06:11:34,079 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-15 06:11:34,079 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-15 06:11:34,079 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-15 06:11:34,080 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-15 06:11:34,080 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-15 06:11:34,081 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-15 06:11:34,081 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-15 06:11:34,082 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-15 06:11:34,082 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-15 06:11:34,082 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-15 06:11:34,083 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-15 06:11:34,083 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-15 06:11:34,084 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-15 06:11:34,084 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-15 06:11:34,084 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-15 06:11:34,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {9721#false} assume !false; {9721#false} is VALID [2022-04-15 06:11:34,085 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-15 06:11:34,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:11:34,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {9721#false} assume !false; {9721#false} is VALID [2022-04-15 06:11:34,274 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-15 06:11:34,274 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-15 06:11:34,275 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-15 06:11:34,275 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-15 06:11:34,291 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-15 06:11:34,292 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-15 06:11:34,292 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-15 06:11:34,293 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-15 06:11:34,293 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-15 06:11:34,293 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-15 06:11:34,294 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-15 06:11:34,294 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-15 06:11:34,294 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-15 06:11:34,294 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-15 06:11:34,295 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-15 06:11:34,295 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-15 06:11:34,295 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-15 06:11:34,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {9720#true} call #t~ret10 := main(); {9720#true} is VALID [2022-04-15 06:11:34,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9720#true} {9720#true} #181#return; {9720#true} is VALID [2022-04-15 06:11:34,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {9720#true} assume true; {9720#true} is VALID [2022-04-15 06:11:34,296 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-15 06:11:34,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {9720#true} call ULTIMATE.init(); {9720#true} is VALID [2022-04-15 06:11:34,296 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-15 06:11:34,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201777041] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:11:34,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:11:34,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-15 06:11:34,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:34,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1323277127] [2022-04-15 06:11:34,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1323277127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:34,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:34,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:11:34,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126755893] [2022-04-15 06:11:34,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:34,298 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-15 06:11:34,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:34,298 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-15 06:11:34,311 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-15 06:11:34,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:11:34,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:34,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:11:34,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:11:34,312 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-15 06:11:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:34,536 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 06:11:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:11:34,536 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-15 06:11:34,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:34,536 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-15 06:11:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-15 06:11:34,537 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-15 06:11:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-15 06:11:34,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 21 transitions. [2022-04-15 06:11:34,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:34,554 INFO L225 Difference]: With dead ends: 24 [2022-04-15 06:11:34,554 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 06:11:34,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:11:34,555 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:11:34,555 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.1s Time] [2022-04-15 06:11:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 06:11:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 06:11:34,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:34,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:11:34,556 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:11:34,556 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:11:34,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:34,556 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:11:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:11:34,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:34,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:34,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 06:11:34,556 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 06:11:34,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:34,556 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:11:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:11:34,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:34,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:34,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:34,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:11:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 06:11:34,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-15 06:11:34,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:34,557 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 06:11:34,557 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-15 06:11:34,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 06:11:34,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:11:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:11:34,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:34,559 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2022-04-15 06:11:34,560 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2022-04-15 06:11:34,560 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2022-04-15 06:11:34,560 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2022-04-15 06:11:34,560 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2022-04-15 06:11:34,560 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2022-04-15 06:11:34,560 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2022-04-15 06:11:34,560 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2022-04-15 06:11:34,560 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2022-04-15 06:11:34,560 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2022-04-15 06:11:34,560 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2022-04-15 06:11:34,560 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2022-04-15 06:11:34,560 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2022-04-15 06:11:34,560 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2022-04-15 06:11:34,561 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2022-04-15 06:11:34,561 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2022-04-15 06:11:34,561 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2022-04-15 06:11:34,594 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-15 06:11:34,783 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-15 06:11:34,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 06:12:07,877 WARN L232 SmtUtils]: Spent 23.15s 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-15 06:12:11,359 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-15 06:12:11,359 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-15 06:12:11,359 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-15 06:12:11,359 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-15 06:12:11,359 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-15 06:12:11,359 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-15 06:12:11,359 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-15 06:12:11,359 INFO L878 garLoopResultBuilder]: At program point L225(line 225) the Hoare annotation is: false [2022-04-15 06:12:11,360 INFO L878 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) the Hoare annotation is: false [2022-04-15 06:12:11,360 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-15 06:12:11,360 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-15 06:12:11,360 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-15 06:12:11,360 INFO L878 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: false [2022-04-15 06:12:11,360 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-15 06:12:11,360 INFO L878 garLoopResultBuilder]: At program point L143(line 143) the Hoare annotation is: false [2022-04-15 06:12:11,360 INFO L878 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: false [2022-04-15 06:12:11,360 INFO L878 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) the Hoare annotation is: false [2022-04-15 06:12:11,360 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-15 06:12:11,360 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-15 06:12:11,360 INFO L878 garLoopResultBuilder]: At program point L127(line 127) the Hoare annotation is: false [2022-04-15 06:12:11,361 INFO L878 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) the Hoare annotation is: false [2022-04-15 06:12:11,361 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-15 06:12:11,361 INFO L878 garLoopResultBuilder]: At program point L177(line 177) the Hoare annotation is: false [2022-04-15 06:12:11,361 INFO L878 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) the Hoare annotation is: false [2022-04-15 06:12:11,361 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-15 06:12:11,361 INFO L878 garLoopResultBuilder]: At program point L351(line 351) the Hoare annotation is: false [2022-04-15 06:12:11,361 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-15 06:12:11,361 INFO L878 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) the Hoare annotation is: false [2022-04-15 06:12:11,361 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-15 06:12:11,361 INFO L878 garLoopResultBuilder]: At program point L310(line 310) the Hoare annotation is: false [2022-04-15 06:12:11,361 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-15 06:12:11,361 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-15 06:12:11,361 INFO L878 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) the Hoare annotation is: false [2022-04-15 06:12:11,362 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-15 06:12:11,362 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) the Hoare annotation is: false [2022-04-15 06:12:11,362 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-15 06:12:11,362 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-15 06:12:11,362 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-15 06:12:11,362 INFO L878 garLoopResultBuilder]: At program point L237(line 237) the Hoare annotation is: false [2022-04-15 06:12:11,362 INFO L878 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) the Hoare annotation is: false [2022-04-15 06:12:11,362 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-15 06:12:11,362 INFO L878 garLoopResultBuilder]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) the Hoare annotation is: false [2022-04-15 06:12:11,362 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-15 06:12:11,362 INFO L878 garLoopResultBuilder]: At program point L155(line 155) the Hoare annotation is: false [2022-04-15 06:12:11,362 INFO L878 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: false [2022-04-15 06:12:11,362 INFO L878 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) the Hoare annotation is: false [2022-04-15 06:12:11,362 INFO L878 garLoopResultBuilder]: At program point L279(line 279) the Hoare annotation is: false [2022-04-15 06:12:11,362 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-15 06:12:11,363 INFO L878 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) the Hoare annotation is: false [2022-04-15 06:12:11,363 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-15 06:12:11,363 INFO L878 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: false [2022-04-15 06:12:11,363 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-15 06:12:11,363 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-15 06:12:11,363 INFO L878 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) the Hoare annotation is: false [2022-04-15 06:12:11,363 INFO L878 garLoopResultBuilder]: At program point L189(line 189) the Hoare annotation is: false [2022-04-15 06:12:11,363 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-15 06:12:11,363 INFO L878 garLoopResultBuilder]: At program point L115(line 115) the Hoare annotation is: false [2022-04-15 06:12:11,363 INFO L878 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) the Hoare annotation is: false [2022-04-15 06:12:11,363 INFO L878 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) the Hoare annotation is: false [2022-04-15 06:12:11,363 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-15 06:12:11,363 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-15 06:12:11,364 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-15 06:12:11,364 INFO L878 garLoopResultBuilder]: At program point L339(line 339) the Hoare annotation is: false [2022-04-15 06:12:11,364 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-15 06:12:11,364 INFO L878 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) the Hoare annotation is: false [2022-04-15 06:12:11,364 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-15 06:12:11,364 INFO L878 garLoopResultBuilder]: At program point L298(line 298) the Hoare annotation is: false [2022-04-15 06:12:11,364 INFO L878 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) the Hoare annotation is: false [2022-04-15 06:12:11,364 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-15 06:12:11,364 INFO L878 garLoopResultBuilder]: At program point L315(lines 32 368) the Hoare annotation is: (<= 0 main_~main__t~0) [2022-04-15 06:12:11,364 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-15 06:12:11,364 INFO L878 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) the Hoare annotation is: false [2022-04-15 06:12:11,364 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-15 06:12:11,364 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-15 06:12:11,365 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-15 06:12:11,365 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-15 06:12:11,365 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:12:11,365 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-15 06:12:11,365 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:12:11,365 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:12:11,365 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 06:12:11,365 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 06:12:11,365 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:12:11,373 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-15 06:12:11,375 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 06:12:11,389 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:12:11,390 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 06:12:11,391 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 06:12:11,391 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 06:12:11,391 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 06:12:11,392 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-15 06:12:11,468 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-15 06:12:11,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 06:12:11 BoogieIcfgContainer [2022-04-15 06:12:11,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 06:12:11,506 INFO L158 Benchmark]: Toolchain (without parser) took 61527.86ms. Allocated memory was 178.3MB in the beginning and 679.5MB in the end (delta: 501.2MB). Free memory was 120.5MB in the beginning and 337.2MB in the end (delta: -216.7MB). Peak memory consumption was 382.9MB. Max. memory is 8.0GB. [2022-04-15 06:12:11,507 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:12:11,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.56ms. Allocated memory was 178.3MB in the beginning and 272.6MB in the end (delta: 94.4MB). Free memory was 120.4MB in the beginning and 237.0MB in the end (delta: -116.6MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-15 06:12:11,507 INFO L158 Benchmark]: Boogie Preprocessor took 43.69ms. Allocated memory is still 272.6MB. Free memory was 237.0MB in the beginning and 235.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 06:12:11,507 INFO L158 Benchmark]: RCFGBuilder took 407.91ms. Allocated memory is still 272.6MB. Free memory was 235.4MB in the beginning and 218.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-15 06:12:11,507 INFO L158 Benchmark]: TraceAbstraction took 60761.45ms. Allocated memory was 272.6MB in the beginning and 679.5MB in the end (delta: 406.8MB). Free memory was 217.6MB in the beginning and 337.2MB in the end (delta: -119.7MB). Peak memory consumption was 385.9MB. Max. memory is 8.0GB. [2022-04-15 06:12:11,510 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.10ms. Allocated memory is still 178.3MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 308.56ms. Allocated memory was 178.3MB in the beginning and 272.6MB in the end (delta: 94.4MB). Free memory was 120.4MB in the beginning and 237.0MB in the end (delta: -116.6MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.69ms. Allocated memory is still 272.6MB. Free memory was 237.0MB in the beginning and 235.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 407.91ms. Allocated memory is still 272.6MB. Free memory was 235.4MB in the beginning and 218.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 60761.45ms. Allocated memory was 272.6MB in the beginning and 679.5MB in the end (delta: 406.8MB). Free memory was 217.6MB in the beginning and 337.2MB in the end (delta: -119.7MB). Peak memory consumption was 385.9MB. 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: 60.6s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 36.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1383 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1383 mSDsluCounter, 2585 SdHoareTripleChecker+Invalid, 2.8s 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.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 329 GetRequests, 146 SyntacticMatches, 10 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.5s 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.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 299 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 76 PreInvPairs, 101 NumberOfFragments, 953 HoareAnnotationTreeSize, 76 FomulaSimplifications, 25988 FormulaSimplificationTreeSizeReduction, 34.7s HoareSimplificationTime, 76 FomulaSimplificationsInter, 871907 FormulaSimplificationTreeSizeReductionInter, 1.8s 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-15 06:12:11,587 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...