/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:46:05,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:46:05,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:46:05,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:46:05,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:46:05,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:46:05,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:46:05,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:46:05,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:46:05,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:46:05,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:46:05,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:46:05,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:46:05,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:46:05,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:46:05,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:46:05,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:46:05,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:46:05,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:46:05,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:46:05,182 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:46:05,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:46:05,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:46:05,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:46:05,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:46:05,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:46:05,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:46:05,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:46:05,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:46:05,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:46:05,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:46:05,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:46:05,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:46:05,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:46:05,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:46:05,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:46:05,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:46:05,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:46:05,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:46:05,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:46:05,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:46:05,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:46:05,200 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:46:05,233 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:46:05,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:46:05,234 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:46:05,234 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:46:05,235 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:46:05,235 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:46:05,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:46:05,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:46:05,235 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:46:05,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:46:05,236 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:46:05,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:46:05,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:46:05,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:46:05,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:46:05,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:46:05,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:46:05,238 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:46:05,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:46:05,238 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:46:05,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:46:05,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:46:05,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:46:05,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:46:05,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:46:05,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:46:05,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:46:05,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:46:05,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:46:05,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:46:05,240 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:46:05,240 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:46:05,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:46:05,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 10:46:05,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:46:05,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:46:05,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:46:05,492 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:46:05,493 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:46:05,494 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+lhb-reducer.c [2022-04-27 10:46:05,547 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e89bbd1/c415d0e99bbd434192520ec0966db633/FLAGc33eaeb5b [2022-04-27 10:46:06,017 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:46:06,018 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-04-27 10:46:06,027 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e89bbd1/c415d0e99bbd434192520ec0966db633/FLAGc33eaeb5b [2022-04-27 10:46:06,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e89bbd1/c415d0e99bbd434192520ec0966db633 [2022-04-27 10:46:06,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:46:06,520 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:46:06,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:46:06,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:46:06,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:46:06,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:46:06" (1/1) ... [2022-04-27 10:46:06,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bedf439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:06, skipping insertion in model container [2022-04-27 10:46:06,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:46:06" (1/1) ... [2022-04-27 10:46:06,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:46:06,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:46:06,698 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+lhb-reducer.c[1224,1237] [2022-04-27 10:46:06,702 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+lhb-reducer.c[1636,1649] [2022-04-27 10:46:06,704 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+lhb-reducer.c[1851,1864] [2022-04-27 10:46:06,708 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+lhb-reducer.c[2384,2397] [2022-04-27 10:46:06,709 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+lhb-reducer.c[2599,2612] [2022-04-27 10:46:06,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2022-04-27 10:46:06,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2022-04-27 10:46:06,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2022-04-27 10:46:06,737 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+lhb-reducer.c[3604,3617] [2022-04-27 10:46:06,760 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+lhb-reducer.c[4088,4101] [2022-04-27 10:46:06,761 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+lhb-reducer.c[4306,4319] [2022-04-27 10:46:06,763 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+lhb-reducer.c[4802,4815] [2022-04-27 10:46:06,765 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+lhb-reducer.c[5203,5216] [2022-04-27 10:46:06,766 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+lhb-reducer.c[5421,5434] [2022-04-27 10:46:06,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2022-04-27 10:46:06,769 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+lhb-reducer.c[6010,6023] [2022-04-27 10:46:06,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2022-04-27 10:46:06,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2022-04-27 10:46:06,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:46:06,780 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:46:06,797 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+lhb-reducer.c[1224,1237] [2022-04-27 10:46:06,798 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+lhb-reducer.c[1636,1649] [2022-04-27 10:46:06,799 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+lhb-reducer.c[1851,1864] [2022-04-27 10:46:06,800 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+lhb-reducer.c[2384,2397] [2022-04-27 10:46:06,801 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+lhb-reducer.c[2599,2612] [2022-04-27 10:46:06,803 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+lhb-reducer.c[2901,2914] [2022-04-27 10:46:06,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2022-04-27 10:46:06,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2022-04-27 10:46:06,806 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+lhb-reducer.c[3604,3617] [2022-04-27 10:46:06,808 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+lhb-reducer.c[4088,4101] [2022-04-27 10:46:06,809 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+lhb-reducer.c[4306,4319] [2022-04-27 10:46:06,811 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+lhb-reducer.c[4802,4815] [2022-04-27 10:46:06,812 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+lhb-reducer.c[5203,5216] [2022-04-27 10:46:06,814 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+lhb-reducer.c[5421,5434] [2022-04-27 10:46:06,815 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+lhb-reducer.c[5792,5805] [2022-04-27 10:46:06,816 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+lhb-reducer.c[6010,6023] [2022-04-27 10:46:06,817 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+lhb-reducer.c[6296,6309] [2022-04-27 10:46:06,818 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+lhb-reducer.c[6514,6527] [2022-04-27 10:46:06,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:46:06,847 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:46:06,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:06 WrapperNode [2022-04-27 10:46:06,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:46:06,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:46:06,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:46:06,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:46:06,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:06" (1/1) ... [2022-04-27 10:46:06,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:06" (1/1) ... [2022-04-27 10:46:06,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:06" (1/1) ... [2022-04-27 10:46:06,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:06" (1/1) ... [2022-04-27 10:46:06,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:06" (1/1) ... [2022-04-27 10:46:06,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:06" (1/1) ... [2022-04-27 10:46:06,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:06" (1/1) ... [2022-04-27 10:46:06,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:46:06,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:46:06,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:46:06,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:46:06,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:06" (1/1) ... [2022-04-27 10:46:06,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:46:06,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:46:06,944 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-27 10:46:06,952 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-27 10:46:06,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:46:06,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:46:06,977 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:46:06,977 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:46:06,977 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:46:06,978 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:46:06,978 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:46:06,978 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:46:06,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:46:06,978 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:46:06,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:46:06,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:46:06,980 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:46:06,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:46:06,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:46:06,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:46:06,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:46:06,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:46:06,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:46:07,079 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:46:07,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:46:07,351 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:46:07,357 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:46:07,358 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 10:46:07,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:46:07 BoogieIcfgContainer [2022-04-27 10:46:07,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:46:07,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:46:07,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:46:07,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:46:07,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:46:06" (1/3) ... [2022-04-27 10:46:07,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780b7417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:46:07, skipping insertion in model container [2022-04-27 10:46:07,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:06" (2/3) ... [2022-04-27 10:46:07,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780b7417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:46:07, skipping insertion in model container [2022-04-27 10:46:07,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:46:07" (3/3) ... [2022-04-27 10:46:07,370 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2022-04-27 10:46:07,380 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:46:07,380 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-04-27 10:46:07,415 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:46:07,421 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ef8b040, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3eae3d2a [2022-04-27 10:46:07,421 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-04-27 10:46:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 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-27 10:46:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:46:07,434 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:07,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:07,435 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:07,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:07,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1796468500, now seen corresponding path program 1 times [2022-04-27 10:46:07,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:07,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396087706] [2022-04-27 10:46:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:07,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:07,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {90#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {83#true} is VALID [2022-04-27 10:46:07,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {83#true} assume true; {83#true} is VALID [2022-04-27 10:46:07,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83#true} {83#true} #191#return; {83#true} is VALID [2022-04-27 10:46:07,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {83#true} call ULTIMATE.init(); {90#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:07,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {83#true} is VALID [2022-04-27 10:46:07,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {83#true} assume true; {83#true} is VALID [2022-04-27 10:46:07,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83#true} {83#true} #191#return; {83#true} is VALID [2022-04-27 10:46:07,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {83#true} call #t~ret10 := main(); {83#true} is VALID [2022-04-27 10:46:07,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {83#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; {83#true} is VALID [2022-04-27 10:46:07,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {83#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {88#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 10:46:07,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {88#(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; {88#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 10:46:07,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {88#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !(0 == ~main____CPAchecker_TMP_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; {88#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 10:46:07,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {88#(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; {89#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-27 10:46:07,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {89#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {84#false} is VALID [2022-04-27 10:46:07,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {84#false} assume !false; {84#false} is VALID [2022-04-27 10:46:07,761 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-27 10:46:07,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:07,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396087706] [2022-04-27 10:46:07,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396087706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:07,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:07,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:46:07,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864372235] [2022-04-27 10:46:07,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:07,771 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-27 10:46:07,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:07,776 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-27 10:46:07,798 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-27 10:46:07,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:46:07,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:07,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:46:07,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:46:07,825 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 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-27 10:46:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:08,326 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2022-04-27 10:46:08,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:46:08,326 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-27 10:46:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:08,327 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-27 10:46:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2022-04-27 10:46:08,338 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-27 10:46:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2022-04-27 10:46:08,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 172 transitions. [2022-04-27 10:46:08,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:08,508 INFO L225 Difference]: With dead ends: 129 [2022-04-27 10:46:08,508 INFO L226 Difference]: Without dead ends: 111 [2022-04-27 10:46:08,510 INFO L412 NwaCegarLoop]: 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-27 10:46:08,513 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 67 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:08,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-27 10:46:08,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2022-04-27 10:46:08,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:08,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:08,549 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:08,550 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:08,566 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-04-27 10:46:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2022-04-27 10:46:08,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:08,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:08,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 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 111 states. [2022-04-27 10:46:08,569 INFO L87 Difference]: Start difference. First operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 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 111 states. [2022-04-27 10:46:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:08,584 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-04-27 10:46:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2022-04-27 10:46:08,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:08,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:08,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:08,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-04-27 10:46:08,592 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2022-04-27 10:46:08,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:08,593 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-04-27 10:46:08,593 INFO L496 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-27 10:46:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-04-27 10:46:08,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:46:08,597 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:08,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:08,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:46:08,598 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:08,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1799639252, now seen corresponding path program 1 times [2022-04-27 10:46:08,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:08,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378355011] [2022-04-27 10:46:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:08,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:08,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {552#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {545#true} is VALID [2022-04-27 10:46:08,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#true} assume true; {545#true} is VALID [2022-04-27 10:46:08,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {545#true} {545#true} #191#return; {545#true} is VALID [2022-04-27 10:46:08,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {545#true} call ULTIMATE.init(); {552#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:08,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {552#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {545#true} is VALID [2022-04-27 10:46:08,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {545#true} assume true; {545#true} is VALID [2022-04-27 10:46:08,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {545#true} {545#true} #191#return; {545#true} is VALID [2022-04-27 10:46:08,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {545#true} call #t~ret10 := main(); {545#true} is VALID [2022-04-27 10:46:08,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {545#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; {545#true} is VALID [2022-04-27 10:46:08,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {545#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {550#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 10:46:08,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#(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; {550#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 10:46:08,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#(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; {550#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 10:46:08,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {550#(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; {551#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-27 10:46:08,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {551#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {546#false} is VALID [2022-04-27 10:46:08,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {546#false} assume !false; {546#false} is VALID [2022-04-27 10:46:08,718 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-27 10:46:08,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:08,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378355011] [2022-04-27 10:46:08,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378355011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:08,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:08,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:46:08,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136776917] [2022-04-27 10:46:08,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:08,720 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-27 10:46:08,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:08,721 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-27 10:46:08,730 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-27 10:46:08,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:46:08,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:08,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:46:08,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:46:08,732 INFO L87 Difference]: Start difference. First operand 73 states and 77 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-27 10:46:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:09,153 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-04-27 10:46:09,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:46:09,153 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-27 10:46:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:09,154 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-27 10:46:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-04-27 10:46:09,156 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-27 10:46:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-04-27 10:46:09,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 117 transitions. [2022-04-27 10:46:09,253 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-27 10:46:09,255 INFO L225 Difference]: With dead ends: 111 [2022-04-27 10:46:09,255 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 10:46:09,256 INFO L412 NwaCegarLoop]: 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-27 10:46:09,257 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 72 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:09,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 218 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 10:46:09,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2022-04-27 10:46:09,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:09,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:09,265 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:09,265 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:09,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:09,269 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-04-27 10:46:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-04-27 10:46:09,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:09,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:09,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 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-27 10:46:09,270 INFO L87 Difference]: Start difference. First operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 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-27 10:46:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:09,273 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-04-27 10:46:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-04-27 10:46:09,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:09,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:09,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:09,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:09,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-04-27 10:46:09,277 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2022-04-27 10:46:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:09,277 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-04-27 10:46:09,277 INFO L496 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-27 10:46:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-27 10:46:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:46:09,278 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:09,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:09,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:46:09,278 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:09,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:09,279 INFO L85 PathProgramCache]: Analyzing trace with hash -991466384, now seen corresponding path program 1 times [2022-04-27 10:46:09,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:09,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982641728] [2022-04-27 10:46:09,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:09,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:09,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:09,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {989#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {981#true} is VALID [2022-04-27 10:46:09,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-27 10:46:09,367 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {981#true} {981#true} #191#return; {981#true} is VALID [2022-04-27 10:46:09,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {981#true} call ULTIMATE.init(); {989#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:09,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {989#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {981#true} is VALID [2022-04-27 10:46:09,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-27 10:46:09,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {981#true} {981#true} #191#return; {981#true} is VALID [2022-04-27 10:46:09,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {981#true} call #t~ret10 := main(); {981#true} is VALID [2022-04-27 10:46:09,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {981#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; {981#true} is VALID [2022-04-27 10:46:09,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {981#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {986#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:09,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {986#(= 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; {986#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:09,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {986#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_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; {986#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:09,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {986#(= 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; {986#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:09,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {986#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {986#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:09,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {986#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {987#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:09,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {987#(<= 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; {988#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-27 10:46:09,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {988#(not (= main_~__VERIFIER_assert__cond~2 0))} assume 0 == ~__VERIFIER_assert__cond~2; {982#false} is VALID [2022-04-27 10:46:09,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {982#false} assume !false; {982#false} is VALID [2022-04-27 10:46:09,373 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-27 10:46:09,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:09,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982641728] [2022-04-27 10:46:09,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982641728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:09,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:09,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:46:09,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62377475] [2022-04-27 10:46:09,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:09,374 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-27 10:46:09,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:09,375 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-27 10:46:09,385 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-27 10:46:09,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:46:09,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:09,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:46:09,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:46:09,386 INFO L87 Difference]: Start difference. First operand 71 states and 75 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-27 10:46:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:09,701 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-27 10:46:09,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:46:09,702 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-27 10:46:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:09,702 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-27 10:46:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-27 10:46:09,703 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-27 10:46:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-27 10:46:09,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2022-04-27 10:46:09,780 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-27 10:46:09,785 INFO L225 Difference]: With dead ends: 73 [2022-04-27 10:46:09,785 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 10:46:09,785 INFO L412 NwaCegarLoop]: 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-27 10:46:09,788 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 68 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:09,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 132 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 10:46:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2022-04-27 10:46:09,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:09,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 69 states, 51 states have (on average 1.3725490196078431) 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-27 10:46:09,806 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 69 states, 51 states have (on average 1.3725490196078431) 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-27 10:46:09,806 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 69 states, 51 states have (on average 1.3725490196078431) 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-27 10:46:09,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:09,810 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-27 10:46:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-27 10:46:09,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:09,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:09,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 51 states have (on average 1.3725490196078431) 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 71 states. [2022-04-27 10:46:09,813 INFO L87 Difference]: Start difference. First operand has 69 states, 51 states have (on average 1.3725490196078431) 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 71 states. [2022-04-27 10:46:09,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:09,815 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-27 10:46:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-27 10:46:09,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:09,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:09,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:09,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) 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-27 10:46:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-04-27 10:46:09,818 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2022-04-27 10:46:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:09,818 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-04-27 10:46:09,818 INFO L496 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-27 10:46:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-27 10:46:09,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:46:09,819 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:09,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:09,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:46:09,819 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:09,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:09,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1020772778, now seen corresponding path program 1 times [2022-04-27 10:46:09,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:09,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180506661] [2022-04-27 10:46:09,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:09,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:09,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:09,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1298#true} is VALID [2022-04-27 10:46:09,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {1298#true} assume true; {1298#true} is VALID [2022-04-27 10:46:09,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1298#true} {1298#true} #191#return; {1298#true} is VALID [2022-04-27 10:46:09,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {1298#true} call ULTIMATE.init(); {1306#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:09,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1298#true} is VALID [2022-04-27 10:46:09,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {1298#true} assume true; {1298#true} is VALID [2022-04-27 10:46:09,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1298#true} {1298#true} #191#return; {1298#true} is VALID [2022-04-27 10:46:09,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {1298#true} call #t~ret10 := main(); {1298#true} is VALID [2022-04-27 10:46:09,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {1298#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; {1298#true} is VALID [2022-04-27 10:46:09,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {1298#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1303#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:09,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {1303#(= 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; {1303#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:09,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {1303#(= 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; {1303#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:09,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {1303#(= 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; {1303#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:09,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {1303#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {1303#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:09,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {1303#(= 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; {1304#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:09,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {1304#(<= 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; {1305#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-27 10:46:09,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {1305#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {1299#false} is VALID [2022-04-27 10:46:09,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {1299#false} assume !false; {1299#false} is VALID [2022-04-27 10:46:09,879 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-27 10:46:09,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:09,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180506661] [2022-04-27 10:46:09,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180506661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:09,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:09,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:46:09,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823924463] [2022-04-27 10:46:09,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:09,881 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-27 10:46:09,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:09,881 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-27 10:46:09,892 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-27 10:46:09,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:46:09,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:09,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:46:09,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:46:09,893 INFO L87 Difference]: Start difference. First operand 69 states and 73 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-27 10:46:10,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:10,203 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-27 10:46:10,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:46:10,203 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-27 10:46:10,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:10,204 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-27 10:46:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-27 10:46:10,205 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-27 10:46:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-27 10:46:10,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2022-04-27 10:46:10,278 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-27 10:46:10,281 INFO L225 Difference]: With dead ends: 71 [2022-04-27 10:46:10,281 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 10:46:10,284 INFO L412 NwaCegarLoop]: 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-27 10:46:10,286 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 126 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-27 10:46:10,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 126 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 10:46:10,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-04-27 10:46:10,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:10,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 67 states, 50 states have (on average 1.36) 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-27 10:46:10,303 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 67 states, 50 states have (on average 1.36) 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-27 10:46:10,304 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 67 states, 50 states have (on average 1.36) 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-27 10:46:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:10,306 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-27 10:46:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-27 10:46:10,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:10,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:10,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 50 states have (on average 1.36) 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 69 states. [2022-04-27 10:46:10,307 INFO L87 Difference]: Start difference. First operand has 67 states, 50 states have (on average 1.36) 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 69 states. [2022-04-27 10:46:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:10,308 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-27 10:46:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-27 10:46:10,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:10,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:10,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:10,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) 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-27 10:46:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-04-27 10:46:10,311 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2022-04-27 10:46:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:10,311 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-04-27 10:46:10,311 INFO L496 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-27 10:46:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-27 10:46:10,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:46:10,312 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:10,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:10,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:46:10,312 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:10,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:10,312 INFO L85 PathProgramCache]: Analyzing trace with hash -670683748, now seen corresponding path program 1 times [2022-04-27 10:46:10,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:10,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470381199] [2022-04-27 10:46:10,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:10,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:10,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:10,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {1614#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1607#true} is VALID [2022-04-27 10:46:10,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {1607#true} assume true; {1607#true} is VALID [2022-04-27 10:46:10,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1607#true} {1607#true} #191#return; {1607#true} is VALID [2022-04-27 10:46:10,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {1607#true} call ULTIMATE.init(); {1614#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:10,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {1614#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1607#true} is VALID [2022-04-27 10:46:10,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {1607#true} assume true; {1607#true} is VALID [2022-04-27 10:46:10,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1607#true} {1607#true} #191#return; {1607#true} is VALID [2022-04-27 10:46:10,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {1607#true} call #t~ret10 := main(); {1607#true} is VALID [2022-04-27 10:46:10,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {1607#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; {1607#true} is VALID [2022-04-27 10:46:10,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {1607#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1607#true} is VALID [2022-04-27 10:46:10,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {1607#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; {1607#true} is VALID [2022-04-27 10:46:10,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {1607#true} assume !(0 == ~main____CPAchecker_TMP_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; {1607#true} is VALID [2022-04-27 10:46:10,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {1607#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; {1607#true} is VALID [2022-04-27 10:46:10,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {1607#true} assume !(0 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {1607#true} is VALID [2022-04-27 10:46:10,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {1607#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {1607#true} is VALID [2022-04-27 10:46:10,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {1607#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; {1612#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:10,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {1612#(<= 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; {1613#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-27 10:46:10,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {1613#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {1608#false} is VALID [2022-04-27 10:46:10,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {1608#false} assume !false; {1608#false} is VALID [2022-04-27 10:46:10,390 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-27 10:46:10,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:10,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470381199] [2022-04-27 10:46:10,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470381199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:10,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:10,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:46:10,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078036273] [2022-04-27 10:46:10,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:10,391 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-27 10:46:10,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:10,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-27 10:46:10,404 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-27 10:46:10,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:46:10,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:10,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:46:10,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:46:10,405 INFO L87 Difference]: Start difference. First operand 67 states and 71 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-27 10:46:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:10,644 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-27 10:46:10,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:46:10,645 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-27 10:46:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:10,645 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-27 10:46:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-27 10:46:10,647 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-27 10:46:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-27 10:46:10,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-04-27 10:46:10,723 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-27 10:46:10,724 INFO L225 Difference]: With dead ends: 69 [2022-04-27 10:46:10,724 INFO L226 Difference]: Without dead ends: 65 [2022-04-27 10:46:10,725 INFO L412 NwaCegarLoop]: 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-27 10:46:10,725 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 23 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:10,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 147 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-27 10:46:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-04-27 10:46:10,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:10,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 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-27 10:46:10,740 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 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-27 10:46:10,741 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 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-27 10:46:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:10,742 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-04-27 10:46:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-04-27 10:46:10,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:10,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:10,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 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 65 states. [2022-04-27 10:46:10,743 INFO L87 Difference]: Start difference. First operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 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 65 states. [2022-04-27 10:46:10,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:10,745 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-04-27 10:46:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-04-27 10:46:10,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:10,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:10,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:10,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 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-27 10:46:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-04-27 10:46:10,750 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2022-04-27 10:46:10,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:10,750 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-04-27 10:46:10,750 INFO L496 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-27 10:46:10,750 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-27 10:46:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:46:10,751 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:10,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:10,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:46:10,751 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:10,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:10,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1578739961, now seen corresponding path program 1 times [2022-04-27 10:46:10,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:10,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896780609] [2022-04-27 10:46:10,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:10,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:10,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:10,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {1910#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1902#true} is VALID [2022-04-27 10:46:10,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {1902#true} assume true; {1902#true} is VALID [2022-04-27 10:46:10,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1902#true} {1902#true} #191#return; {1902#true} is VALID [2022-04-27 10:46:10,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {1902#true} call ULTIMATE.init(); {1910#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:10,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {1910#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1902#true} is VALID [2022-04-27 10:46:10,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {1902#true} assume true; {1902#true} is VALID [2022-04-27 10:46:10,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1902#true} {1902#true} #191#return; {1902#true} is VALID [2022-04-27 10:46:10,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {1902#true} call #t~ret10 := main(); {1902#true} is VALID [2022-04-27 10:46:10,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {1902#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; {1902#true} is VALID [2022-04-27 10:46:10,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {1902#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1907#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:10,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {1907#(= 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; {1907#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:10,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {1907#(= 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; {1907#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:10,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {1907#(= 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; {1907#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:10,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {1907#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {1907#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:10,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {1907#(= 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; {1908#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:10,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {1908#(<= 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; {1908#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:10,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {1908#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {1909#(not (= main_~__VERIFIER_assert__cond~18 0))} is VALID [2022-04-27 10:46:10,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {1909#(not (= main_~__VERIFIER_assert__cond~18 0))} assume 0 == ~__VERIFIER_assert__cond~18; {1903#false} is VALID [2022-04-27 10:46:10,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {1903#false} assume !false; {1903#false} is VALID [2022-04-27 10:46:10,824 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-27 10:46:10,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:10,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896780609] [2022-04-27 10:46:10,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896780609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:10,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:10,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:46:10,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327057698] [2022-04-27 10:46:10,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:10,826 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-27 10:46:10,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:10,826 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-27 10:46:10,837 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-27 10:46:10,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:46:10,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:10,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:46:10,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:46:10,838 INFO L87 Difference]: Start difference. First operand 63 states and 67 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-27 10:46:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:11,271 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-04-27 10:46:11,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:46:11,271 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-27 10:46:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:11,271 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-27 10:46:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-04-27 10:46:11,273 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-27 10:46:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-04-27 10:46:11,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 115 transitions. [2022-04-27 10:46:11,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:11,373 INFO L225 Difference]: With dead ends: 108 [2022-04-27 10:46:11,373 INFO L226 Difference]: Without dead ends: 106 [2022-04-27 10:46:11,373 INFO L412 NwaCegarLoop]: 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-27 10:46:11,374 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 102 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:11,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 167 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:46:11,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-27 10:46:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 61. [2022-04-27 10:46:11,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:11,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:11,401 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:11,401 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:11,404 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-04-27 10:46:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-04-27 10:46:11,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:11,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:11,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 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 106 states. [2022-04-27 10:46:11,405 INFO L87 Difference]: Start difference. First operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 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 106 states. [2022-04-27 10:46:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:11,407 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-04-27 10:46:11,407 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-04-27 10:46:11,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:11,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:11,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:11,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-04-27 10:46:11,409 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 16 [2022-04-27 10:46:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:11,409 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-04-27 10:46:11,409 INFO L496 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-27 10:46:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-27 10:46:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:46:11,410 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:11,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:11,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 10:46:11,410 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:11,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:11,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1578753863, now seen corresponding path program 1 times [2022-04-27 10:46:11,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:11,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326305380] [2022-04-27 10:46:11,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:11,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:11,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:11,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {2327#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2319#true} is VALID [2022-04-27 10:46:11,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-27 10:46:11,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2319#true} {2319#true} #191#return; {2319#true} is VALID [2022-04-27 10:46:11,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {2319#true} call ULTIMATE.init(); {2327#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:11,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {2327#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2319#true} is VALID [2022-04-27 10:46:11,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-27 10:46:11,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #191#return; {2319#true} is VALID [2022-04-27 10:46:11,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret10 := main(); {2319#true} is VALID [2022-04-27 10:46:11,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {2319#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; {2319#true} is VALID [2022-04-27 10:46:11,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {2319#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2324#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:11,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {2324#(= 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; {2324#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:11,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {2324#(= 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; {2324#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:11,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {2324#(= 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; {2324#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:11,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {2324#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {2324#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:11,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {2324#(= 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; {2325#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:11,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {2325#(<= 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; {2325#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:11,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {2325#(<= 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; {2326#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-27 10:46:11,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {2326#(not (= main_~__VERIFIER_assert__cond~16 0))} assume 0 == ~__VERIFIER_assert__cond~16; {2320#false} is VALID [2022-04-27 10:46:11,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-27 10:46:11,465 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-27 10:46:11,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:11,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326305380] [2022-04-27 10:46:11,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326305380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:11,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:11,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:46:11,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629470452] [2022-04-27 10:46:11,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:11,466 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-27 10:46:11,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:11,466 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-27 10:46:11,478 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-27 10:46:11,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:46:11,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:11,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:46:11,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:46:11,479 INFO L87 Difference]: Start difference. First operand 61 states and 65 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-27 10:46:11,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:11,853 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-04-27 10:46:11,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:46:11,854 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-27 10:46:11,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:11,854 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-27 10:46:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-27 10:46:11,856 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-27 10:46:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-27 10:46:11,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2022-04-27 10:46:11,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:11,935 INFO L225 Difference]: With dead ends: 93 [2022-04-27 10:46:11,935 INFO L226 Difference]: Without dead ends: 91 [2022-04-27 10:46:11,935 INFO L412 NwaCegarLoop]: 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-27 10:46:11,936 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 88 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:11,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 147 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:11,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-27 10:46:11,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2022-04-27 10:46:11,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:11,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 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-27 10:46:11,950 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 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-27 10:46:11,951 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 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-27 10:46:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:11,953 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-04-27 10:46:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-04-27 10:46:11,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:11,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:11,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 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 91 states. [2022-04-27 10:46:11,953 INFO L87 Difference]: Start difference. First operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 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 91 states. [2022-04-27 10:46:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:11,955 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-04-27 10:46:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-04-27 10:46:11,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:11,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:11,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:11,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:11,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 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-27 10:46:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-27 10:46:11,957 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2022-04-27 10:46:11,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:11,957 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-27 10:46:11,958 INFO L496 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-27 10:46:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-27 10:46:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:46:11,958 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:11,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:11,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 10:46:11,958 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:11,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:11,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1579181860, now seen corresponding path program 1 times [2022-04-27 10:46:11,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:11,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991823473] [2022-04-27 10:46:11,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:11,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:11,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:12,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2688#true} is VALID [2022-04-27 10:46:12,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {2688#true} assume true; {2688#true} is VALID [2022-04-27 10:46:12,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2688#true} {2688#true} #191#return; {2688#true} is VALID [2022-04-27 10:46:12,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {2688#true} call ULTIMATE.init(); {2695#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:12,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2688#true} is VALID [2022-04-27 10:46:12,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {2688#true} assume true; {2688#true} is VALID [2022-04-27 10:46:12,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2688#true} {2688#true} #191#return; {2688#true} is VALID [2022-04-27 10:46:12,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {2688#true} call #t~ret10 := main(); {2688#true} is VALID [2022-04-27 10:46:12,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {2688#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; {2688#true} is VALID [2022-04-27 10:46:12,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {2688#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2688#true} is VALID [2022-04-27 10:46:12,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {2688#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; {2688#true} is VALID [2022-04-27 10:46:12,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {2688#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; {2688#true} is VALID [2022-04-27 10:46:12,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {2688#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; {2688#true} is VALID [2022-04-27 10:46:12,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {2688#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {2688#true} is VALID [2022-04-27 10:46:12,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {2688#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; {2688#true} is VALID [2022-04-27 10:46:12,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {2688#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; {2693#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:12,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {2693#(<= 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; {2694#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-27 10:46:12,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {2694#(not (= main_~__VERIFIER_assert__cond~15 0))} assume 0 == ~__VERIFIER_assert__cond~15; {2689#false} is VALID [2022-04-27 10:46:12,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {2689#false} assume !false; {2689#false} is VALID [2022-04-27 10:46:12,007 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-27 10:46:12,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:12,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991823473] [2022-04-27 10:46:12,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991823473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:12,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:12,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:46:12,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308727832] [2022-04-27 10:46:12,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:12,008 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-27 10:46:12,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:12,008 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-27 10:46:12,018 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-27 10:46:12,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:46:12,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:12,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:46:12,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:46:12,019 INFO L87 Difference]: Start difference. First operand 59 states and 63 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-27 10:46:12,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:12,236 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-27 10:46:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:46:12,236 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-27 10:46:12,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:12,236 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-27 10:46:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-27 10:46:12,237 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-27 10:46:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-27 10:46:12,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-04-27 10:46:12,285 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-27 10:46:12,286 INFO L225 Difference]: With dead ends: 61 [2022-04-27 10:46:12,286 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 10:46:12,286 INFO L412 NwaCegarLoop]: 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-27 10:46:12,286 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 20 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 129 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-27 10:46:12,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 129 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 10:46:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-04-27 10:46:12,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:12,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 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-27 10:46:12,294 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 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-27 10:46:12,294 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 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-27 10:46:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:12,295 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-27 10:46:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-27 10:46:12,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:12,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:12,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 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 57 states. [2022-04-27 10:46:12,296 INFO L87 Difference]: Start difference. First operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 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 57 states. [2022-04-27 10:46:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:12,298 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-27 10:46:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-27 10:46:12,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:12,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:12,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:12,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 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-27 10:46:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-04-27 10:46:12,300 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2022-04-27 10:46:12,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:12,300 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-04-27 10:46:12,300 INFO L496 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-27 10:46:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-04-27 10:46:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:46:12,300 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:12,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:12,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 10:46:12,301 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:12,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:12,301 INFO L85 PathProgramCache]: Analyzing trace with hash 697862626, now seen corresponding path program 1 times [2022-04-27 10:46:12,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:12,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499436002] [2022-04-27 10:46:12,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:12,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:12,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:12,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {2959#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2951#true} is VALID [2022-04-27 10:46:12,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {2951#true} assume true; {2951#true} is VALID [2022-04-27 10:46:12,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2951#true} {2951#true} #191#return; {2951#true} is VALID [2022-04-27 10:46:12,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {2951#true} call ULTIMATE.init(); {2959#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:12,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {2959#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2951#true} is VALID [2022-04-27 10:46:12,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {2951#true} assume true; {2951#true} is VALID [2022-04-27 10:46:12,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2951#true} {2951#true} #191#return; {2951#true} is VALID [2022-04-27 10:46:12,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {2951#true} call #t~ret10 := main(); {2951#true} is VALID [2022-04-27 10:46:12,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {2951#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; {2951#true} is VALID [2022-04-27 10:46:12,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {2951#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2956#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:12,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {2956#(= 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; {2956#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:12,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {2956#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_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; {2956#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:12,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {2956#(= 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; {2956#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:12,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {2956#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {2956#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:12,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {2956#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {2957#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:12,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {2957#(<= 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; {2957#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:12,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {2957#(<= 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; {2957#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:12,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {2957#(<= 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; {2958#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-27 10:46:12,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {2958#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {2952#false} is VALID [2022-04-27 10:46:12,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {2952#false} assume !false; {2952#false} is VALID [2022-04-27 10:46:12,353 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-27 10:46:12,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:12,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499436002] [2022-04-27 10:46:12,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499436002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:12,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:12,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:46:12,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437900625] [2022-04-27 10:46:12,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:12,354 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-27 10:46:12,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:12,355 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-27 10:46:12,371 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-27 10:46:12,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:46:12,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:12,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:46:12,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:46:12,372 INFO L87 Difference]: Start difference. First operand 55 states and 59 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-27 10:46:12,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:12,674 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-04-27 10:46:12,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:46:12,674 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-27 10:46:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:12,675 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-27 10:46:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 10:46:12,676 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-27 10:46:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 10:46:12,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-27 10:46:12,738 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-27 10:46:12,739 INFO L225 Difference]: With dead ends: 74 [2022-04-27 10:46:12,739 INFO L226 Difference]: Without dead ends: 72 [2022-04-27 10:46:12,740 INFO L412 NwaCegarLoop]: 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-27 10:46:12,740 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 74 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:12,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 116 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-27 10:46:12,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2022-04-27 10:46:12,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:12,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:12,748 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:12,748 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:12,750 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-27 10:46:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-27 10:46:12,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:12,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:12,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 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-27 10:46:12,750 INFO L87 Difference]: Start difference. First operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 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-27 10:46:12,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:12,752 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-27 10:46:12,752 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-27 10:46:12,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:12,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:12,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:12,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-04-27 10:46:12,754 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2022-04-27 10:46:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:12,754 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-04-27 10:46:12,754 INFO L496 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-27 10:46:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 10:46:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:46:12,755 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:12,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:12,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 10:46:12,755 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:12,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash 699401826, now seen corresponding path program 1 times [2022-04-27 10:46:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:12,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659467280] [2022-04-27 10:46:12,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:12,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:12,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:12,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {3265#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3257#true} is VALID [2022-04-27 10:46:12,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {3257#true} assume true; {3257#true} is VALID [2022-04-27 10:46:12,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3257#true} {3257#true} #191#return; {3257#true} is VALID [2022-04-27 10:46:12,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {3257#true} call ULTIMATE.init(); {3265#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:12,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {3265#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3257#true} is VALID [2022-04-27 10:46:12,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {3257#true} assume true; {3257#true} is VALID [2022-04-27 10:46:12,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3257#true} {3257#true} #191#return; {3257#true} is VALID [2022-04-27 10:46:12,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {3257#true} call #t~ret10 := main(); {3257#true} is VALID [2022-04-27 10:46:12,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {3257#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; {3257#true} is VALID [2022-04-27 10:46:12,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {3257#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3262#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:12,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {3262#(= 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; {3262#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:12,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {3262#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_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; {3262#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:12,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {3262#(= 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; {3262#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:12,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {3262#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {3262#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:12,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {3262#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {3263#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:12,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {3263#(<= 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; {3263#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:12,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {3263#(<= 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; {3263#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:12,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {3263#(<= 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; {3264#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-27 10:46:12,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {3264#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {3258#false} is VALID [2022-04-27 10:46:12,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {3258#false} assume !false; {3258#false} is VALID [2022-04-27 10:46:12,811 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-27 10:46:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:12,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659467280] [2022-04-27 10:46:12,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659467280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:12,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:12,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:46:12,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311737503] [2022-04-27 10:46:12,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:12,812 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-27 10:46:12,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:12,813 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-27 10:46:12,824 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-27 10:46:12,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:46:12,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:12,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:46:12,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:46:12,825 INFO L87 Difference]: Start difference. First operand 53 states and 57 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-27 10:46:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:13,067 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-27 10:46:13,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:46:13,067 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-27 10:46:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:13,068 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-27 10:46:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-27 10:46:13,069 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-27 10:46:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-27 10:46:13,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-27 10:46:13,113 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-27 10:46:13,114 INFO L225 Difference]: With dead ends: 55 [2022-04-27 10:46:13,114 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 10:46:13,114 INFO L412 NwaCegarLoop]: 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-27 10:46:13,115 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:13,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 90 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:13,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 10:46:13,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-04-27 10:46:13,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:13,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:13,122 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:13,122 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:13,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:13,123 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 10:46:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 10:46:13,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:13,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:13,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 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-27 10:46:13,124 INFO L87 Difference]: Start difference. First operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 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-27 10:46:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:13,125 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 10:46:13,125 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 10:46:13,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:13,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:13,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:13,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-04-27 10:46:13,126 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2022-04-27 10:46:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:13,126 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-04-27 10:46:13,126 INFO L496 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-27 10:46:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-27 10:46:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:46:13,127 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:13,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:13,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 10:46:13,127 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:13,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:13,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1696295318, now seen corresponding path program 1 times [2022-04-27 10:46:13,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:13,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142714826] [2022-04-27 10:46:13,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:13,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:13,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:13,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {3511#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3502#true} is VALID [2022-04-27 10:46:13,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {3502#true} assume true; {3502#true} is VALID [2022-04-27 10:46:13,231 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3502#true} {3502#true} #191#return; {3502#true} is VALID [2022-04-27 10:46:13,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {3502#true} call ULTIMATE.init(); {3511#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:13,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {3511#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3502#true} is VALID [2022-04-27 10:46:13,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {3502#true} assume true; {3502#true} is VALID [2022-04-27 10:46:13,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3502#true} {3502#true} #191#return; {3502#true} is VALID [2022-04-27 10:46:13,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {3502#true} call #t~ret10 := main(); {3502#true} is VALID [2022-04-27 10:46:13,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {3502#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; {3502#true} is VALID [2022-04-27 10:46:13,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {3502#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3507#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 10:46:13,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {3507#(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; {3508#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:13,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {3508#(and (= 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; {3508#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:13,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {3508#(and (= 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; {3508#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:13,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {3508#(and (= 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; {3508#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:13,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {3508#(and (= 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; {3509#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:13,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {3509#(and (<= main_~main__t~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; {3509#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:13,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {3509#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {3509#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:13,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {3509#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {3510#(not (= main_~__VERIFIER_assert__cond~19 0))} is VALID [2022-04-27 10:46:13,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {3510#(not (= main_~__VERIFIER_assert__cond~19 0))} assume 0 == ~__VERIFIER_assert__cond~19; {3503#false} is VALID [2022-04-27 10:46:13,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {3503#false} assume !false; {3503#false} is VALID [2022-04-27 10:46:13,241 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-27 10:46:13,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:13,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142714826] [2022-04-27 10:46:13,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142714826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:13,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:13,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:13,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790746288] [2022-04-27 10:46:13,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:13,242 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-27 10:46:13,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:13,243 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-27 10:46:13,255 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-27 10:46:13,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:13,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:13,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:13,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:13,255 INFO L87 Difference]: Start difference. First operand 51 states and 55 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-27 10:46:13,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:13,754 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-04-27 10:46:13,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:46:13,755 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-27 10:46:13,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:13,755 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-27 10:46:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-27 10:46:13,756 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-27 10:46:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-27 10:46:13,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 119 transitions. [2022-04-27 10:46:13,835 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-27 10:46:13,837 INFO L225 Difference]: With dead ends: 110 [2022-04-27 10:46:13,837 INFO L226 Difference]: Without dead ends: 108 [2022-04-27 10:46:13,837 INFO L412 NwaCegarLoop]: 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-27 10:46:13,838 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 81 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:13,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 233 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:46:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-27 10:46:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 56. [2022-04-27 10:46:13,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:13,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:13,865 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:13,866 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:13,868 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-04-27 10:46:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-04-27 10:46:13,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:13,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:13,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 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-27 10:46:13,868 INFO L87 Difference]: Start difference. First operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 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-27 10:46:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:13,870 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-04-27 10:46:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-04-27 10:46:13,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:13,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:13,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:13,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-27 10:46:13,872 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 17 [2022-04-27 10:46:13,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:13,872 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-27 10:46:13,872 INFO L496 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-27 10:46:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 10:46:13,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:46:13,873 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:13,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:13,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 10:46:13,873 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:13,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:13,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1696726294, now seen corresponding path program 1 times [2022-04-27 10:46:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:13,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806316860] [2022-04-27 10:46:13,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:13,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:13,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:13,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {3936#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3927#true} is VALID [2022-04-27 10:46:13,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {3927#true} assume true; {3927#true} is VALID [2022-04-27 10:46:13,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3927#true} {3927#true} #191#return; {3927#true} is VALID [2022-04-27 10:46:13,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {3927#true} call ULTIMATE.init(); {3936#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:14,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {3936#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3927#true} is VALID [2022-04-27 10:46:14,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {3927#true} assume true; {3927#true} is VALID [2022-04-27 10:46:14,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3927#true} {3927#true} #191#return; {3927#true} is VALID [2022-04-27 10:46:14,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {3927#true} call #t~ret10 := main(); {3927#true} is VALID [2022-04-27 10:46:14,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {3927#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; {3927#true} is VALID [2022-04-27 10:46:14,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {3927#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3932#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 10:46:14,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {3932#(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; {3933#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:14,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {3933#(and (= 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; {3933#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:14,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {3933#(and (= 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; {3933#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:14,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {3933#(and (= 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; {3933#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:14,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {3933#(and (= 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; {3934#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:14,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {3934#(and (<= main_~main__t~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; {3934#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:14,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {3934#(and (<= main_~main__t~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; {3934#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:14,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {3934#(and (<= main_~main__t~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; {3935#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-27 10:46:14,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {3935#(not (= main_~__VERIFIER_assert__cond~17 0))} assume 0 == ~__VERIFIER_assert__cond~17; {3928#false} is VALID [2022-04-27 10:46:14,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {3928#false} assume !false; {3928#false} is VALID [2022-04-27 10:46:14,005 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-27 10:46:14,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:14,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806316860] [2022-04-27 10:46:14,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806316860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:14,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:14,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:14,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184879719] [2022-04-27 10:46:14,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:14,006 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-27 10:46:14,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:14,006 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-27 10:46:14,019 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-27 10:46:14,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:14,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:14,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:14,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:14,019 INFO L87 Difference]: Start difference. First operand 56 states and 61 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-27 10:46:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:14,382 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-04-27 10:46:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:46:14,382 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-27 10:46:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:14,382 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-27 10:46:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2022-04-27 10:46:14,384 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-27 10:46:14,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2022-04-27 10:46:14,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 117 transitions. [2022-04-27 10:46:14,473 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-27 10:46:14,475 INFO L225 Difference]: With dead ends: 108 [2022-04-27 10:46:14,475 INFO L226 Difference]: Without dead ends: 106 [2022-04-27 10:46:14,475 INFO L412 NwaCegarLoop]: 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-27 10:46:14,476 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 77 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:14,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 168 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-27 10:46:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 58. [2022-04-27 10:46:14,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:14,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 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-27 10:46:14,490 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 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-27 10:46:14,490 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 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-27 10:46:14,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:14,492 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-04-27 10:46:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2022-04-27 10:46:14,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:14,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:14,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 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 106 states. [2022-04-27 10:46:14,493 INFO L87 Difference]: Start difference. First operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 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 106 states. [2022-04-27 10:46:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:14,495 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-04-27 10:46:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2022-04-27 10:46:14,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:14,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:14,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:14,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 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-27 10:46:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-04-27 10:46:14,497 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 17 [2022-04-27 10:46:14,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:14,497 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-04-27 10:46:14,497 INFO L496 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-27 10:46:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-04-27 10:46:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:46:14,497 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:14,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:14,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 10:46:14,498 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:14,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:14,498 INFO L85 PathProgramCache]: Analyzing trace with hash 160273451, now seen corresponding path program 1 times [2022-04-27 10:46:14,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:14,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869780834] [2022-04-27 10:46:14,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:14,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:14,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:14,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {4356#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4348#true} is VALID [2022-04-27 10:46:14,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {4348#true} assume true; {4348#true} is VALID [2022-04-27 10:46:14,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4348#true} {4348#true} #191#return; {4348#true} is VALID [2022-04-27 10:46:14,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {4348#true} call ULTIMATE.init(); {4356#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:14,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {4356#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4348#true} is VALID [2022-04-27 10:46:14,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {4348#true} assume true; {4348#true} is VALID [2022-04-27 10:46:14,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4348#true} {4348#true} #191#return; {4348#true} is VALID [2022-04-27 10:46:14,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {4348#true} call #t~ret10 := main(); {4348#true} is VALID [2022-04-27 10:46:14,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {4348#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; {4348#true} is VALID [2022-04-27 10:46:14,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {4348#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4353#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:14,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {4353#(= 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; {4353#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:14,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {4353#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_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; {4353#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:14,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {4353#(= 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; {4353#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:14,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {4353#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {4353#(= main_~main__t~0 0)} is VALID [2022-04-27 10:46:14,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {4353#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {4354#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:14,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {4354#(<= 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; {4354#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:14,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {4354#(<= 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; {4354#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:14,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {4354#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_4~0); {4354#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:46:14,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {4354#(<= 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; {4355#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-27 10:46:14,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {4355#(not (= main_~__VERIFIER_assert__cond~8 0))} assume 0 == ~__VERIFIER_assert__cond~8; {4349#false} is VALID [2022-04-27 10:46:14,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {4349#false} assume !false; {4349#false} is VALID [2022-04-27 10:46:14,558 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-27 10:46:14,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:14,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869780834] [2022-04-27 10:46:14,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869780834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:14,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:14,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:46:14,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968152973] [2022-04-27 10:46:14,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:14,559 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-27 10:46:14,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:14,560 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-27 10:46:14,576 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-27 10:46:14,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:46:14,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:14,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:46:14,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:46:14,577 INFO L87 Difference]: Start difference. First operand 58 states and 63 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-27 10:46:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:14,890 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-04-27 10:46:14,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:46:14,890 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-27 10:46:14,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:14,890 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-27 10:46:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-27 10:46:14,892 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-27 10:46:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-27 10:46:14,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-27 10:46:14,950 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-27 10:46:14,951 INFO L225 Difference]: With dead ends: 79 [2022-04-27 10:46:14,951 INFO L226 Difference]: Without dead ends: 77 [2022-04-27 10:46:14,951 INFO L412 NwaCegarLoop]: 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-27 10:46:14,952 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 65 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:14,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 108 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:14,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-27 10:46:14,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-04-27 10:46:14,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:14,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 56 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:14,976 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 56 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:14,976 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 56 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:14,978 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-04-27 10:46:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-04-27 10:46:14,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:14,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:14,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 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 77 states. [2022-04-27 10:46:14,979 INFO L87 Difference]: Start difference. First operand has 56 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 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 77 states. [2022-04-27 10:46:14,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:14,980 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-04-27 10:46:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-04-27 10:46:14,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:14,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:14,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:14,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-27 10:46:14,982 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 18 [2022-04-27 10:46:14,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:14,982 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-27 10:46:14,982 INFO L496 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-27 10:46:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 10:46:14,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:46:14,982 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:14,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:14,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 10:46:14,983 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:14,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:14,983 INFO L85 PathProgramCache]: Analyzing trace with hash 158908031, now seen corresponding path program 1 times [2022-04-27 10:46:14,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:14,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231166971] [2022-04-27 10:46:14,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:14,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:15,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:15,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {4682#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4673#true} is VALID [2022-04-27 10:46:15,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {4673#true} assume true; {4673#true} is VALID [2022-04-27 10:46:15,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4673#true} {4673#true} #191#return; {4673#true} is VALID [2022-04-27 10:46:15,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {4673#true} call ULTIMATE.init(); {4682#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:15,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {4682#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4673#true} is VALID [2022-04-27 10:46:15,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {4673#true} assume true; {4673#true} is VALID [2022-04-27 10:46:15,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4673#true} {4673#true} #191#return; {4673#true} is VALID [2022-04-27 10:46:15,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {4673#true} call #t~ret10 := main(); {4673#true} is VALID [2022-04-27 10:46:15,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {4673#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; {4673#true} is VALID [2022-04-27 10:46:15,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {4673#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4678#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 10:46:15,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {4678#(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; {4679#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {4679#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_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; {4679#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {4679#(and (= 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; {4679#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {4679#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {4679#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {4679#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {4680#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {4680#(and (<= main_~main__t~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; {4680#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {4680#(and (<= main_~main__t~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; {4680#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {4680#(and (<= main_~main__t~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; {4680#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {4680#(and (<= main_~main__t~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; {4681#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-27 10:46:15,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {4681#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {4674#false} is VALID [2022-04-27 10:46:15,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {4674#false} assume !false; {4674#false} is VALID [2022-04-27 10:46:15,091 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-27 10:46:15,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:15,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231166971] [2022-04-27 10:46:15,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231166971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:15,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:15,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:15,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551711519] [2022-04-27 10:46:15,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:15,092 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-27 10:46:15,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:15,093 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-27 10:46:15,104 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-27 10:46:15,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:15,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:15,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:15,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:15,105 INFO L87 Difference]: Start difference. First operand 56 states and 61 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-27 10:46:15,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:15,444 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-04-27 10:46:15,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:46:15,444 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-27 10:46:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:15,444 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-27 10:46:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-27 10:46:15,446 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-27 10:46:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-27 10:46:15,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 99 transitions. [2022-04-27 10:46:15,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:15,512 INFO L225 Difference]: With dead ends: 90 [2022-04-27 10:46:15,512 INFO L226 Difference]: Without dead ends: 88 [2022-04-27 10:46:15,513 INFO L412 NwaCegarLoop]: 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-27 10:46:15,513 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 61 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:15,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 134 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:15,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-27 10:46:15,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2022-04-27 10:46:15,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:15,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:15,532 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:15,532 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:15,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:15,533 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-04-27 10:46:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-04-27 10:46:15,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:15,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:15,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 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 88 states. [2022-04-27 10:46:15,534 INFO L87 Difference]: Start difference. First operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 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 88 states. [2022-04-27 10:46:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:15,536 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-04-27 10:46:15,536 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-04-27 10:46:15,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:15,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:15,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:15,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-04-27 10:46:15,537 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 18 [2022-04-27 10:46:15,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:15,538 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-04-27 10:46:15,538 INFO L496 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-27 10:46:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-04-27 10:46:15,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:46:15,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:15,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:15,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 10:46:15,539 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:15,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:15,539 INFO L85 PathProgramCache]: Analyzing trace with hash 206623281, now seen corresponding path program 1 times [2022-04-27 10:46:15,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:15,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286339388] [2022-04-27 10:46:15,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:15,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:15,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:15,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {5055#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5046#true} is VALID [2022-04-27 10:46:15,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {5046#true} assume true; {5046#true} is VALID [2022-04-27 10:46:15,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5046#true} {5046#true} #191#return; {5046#true} is VALID [2022-04-27 10:46:15,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {5046#true} call ULTIMATE.init(); {5055#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:15,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {5055#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5046#true} is VALID [2022-04-27 10:46:15,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {5046#true} assume true; {5046#true} is VALID [2022-04-27 10:46:15,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5046#true} {5046#true} #191#return; {5046#true} is VALID [2022-04-27 10:46:15,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {5046#true} call #t~ret10 := main(); {5046#true} is VALID [2022-04-27 10:46:15,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {5046#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; {5046#true} is VALID [2022-04-27 10:46:15,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {5046#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5051#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 10:46:15,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {5051#(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; {5052#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {5052#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_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; {5052#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {5052#(and (= 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; {5052#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {5052#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {5052#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {5052#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5053#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {5053#(and (<= main_~main__t~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; {5053#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {5053#(and (<= main_~main__t~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; {5053#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {5053#(and (<= main_~main__t~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; {5053#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:15,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {5053#(and (<= main_~main__t~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; {5054#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 10:46:15,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {5054#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {5047#false} is VALID [2022-04-27 10:46:15,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {5047#false} assume !false; {5047#false} is VALID [2022-04-27 10:46:15,633 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-27 10:46:15,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:15,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286339388] [2022-04-27 10:46:15,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286339388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:15,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:15,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:15,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081010897] [2022-04-27 10:46:15,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:15,634 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-27 10:46:15,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:15,635 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-27 10:46:15,647 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-27 10:46:15,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:15,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:15,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:15,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:15,648 INFO L87 Difference]: Start difference. First operand 62 states and 69 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-27 10:46:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:15,910 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-04-27 10:46:15,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:46:15,910 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-27 10:46:15,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:15,911 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-27 10:46:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-27 10:46:15,911 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-27 10:46:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-27 10:46:15,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-27 10:46:15,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:15,964 INFO L225 Difference]: With dead ends: 74 [2022-04-27 10:46:15,964 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 10:46:15,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:46:15,965 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:15,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 10:46:15,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-04-27 10:46:15,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:15,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 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-27 10:46:15,990 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 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-27 10:46:15,990 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 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-27 10:46:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:15,991 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-27 10:46:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-27 10:46:15,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:15,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:16,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 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 70 states. [2022-04-27 10:46:16,000 INFO L87 Difference]: Start difference. First operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 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 70 states. [2022-04-27 10:46:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:16,002 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-27 10:46:16,002 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-27 10:46:16,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:16,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:16,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:16,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 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-27 10:46:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-04-27 10:46:16,004 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 18 [2022-04-27 10:46:16,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:16,004 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-04-27 10:46:16,004 INFO L496 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-27 10:46:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-04-27 10:46:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:46:16,007 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:16,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:16,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 10:46:16,007 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:16,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash 673512821, now seen corresponding path program 1 times [2022-04-27 10:46:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:16,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748622550] [2022-04-27 10:46:16,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:16,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:16,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:16,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {5375#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5366#true} is VALID [2022-04-27 10:46:16,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {5366#true} assume true; {5366#true} is VALID [2022-04-27 10:46:16,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5366#true} {5366#true} #191#return; {5366#true} is VALID [2022-04-27 10:46:16,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {5366#true} call ULTIMATE.init(); {5375#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:16,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {5375#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5366#true} is VALID [2022-04-27 10:46:16,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {5366#true} assume true; {5366#true} is VALID [2022-04-27 10:46:16,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5366#true} {5366#true} #191#return; {5366#true} is VALID [2022-04-27 10:46:16,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {5366#true} call #t~ret10 := main(); {5366#true} is VALID [2022-04-27 10:46:16,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {5366#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; {5366#true} is VALID [2022-04-27 10:46:16,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {5366#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5371#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 10:46:16,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {5371#(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; {5372#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:16,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {5372#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_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; {5372#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:16,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {5372#(and (= 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; {5372#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:16,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {5372#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {5372#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:16,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {5372#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5373#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:16,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {5373#(and (<= main_~main__t~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; {5373#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:16,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {5373#(and (<= main_~main__t~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; {5373#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:16,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {5373#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_4~0); {5373#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:16,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {5373#(and (<= main_~main__t~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; {5373#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:46:16,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {5373#(and (<= main_~main__t~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; {5374#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-27 10:46:16,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {5374#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {5367#false} is VALID [2022-04-27 10:46:16,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {5367#false} assume !false; {5367#false} is VALID [2022-04-27 10:46:16,129 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-27 10:46:16,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:16,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748622550] [2022-04-27 10:46:16,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748622550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:16,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:16,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:16,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563463656] [2022-04-27 10:46:16,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:16,130 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-27 10:46:16,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:16,130 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-27 10:46:16,147 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-27 10:46:16,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:16,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:16,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:16,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:16,148 INFO L87 Difference]: Start difference. First operand 63 states and 70 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-27 10:46:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:16,508 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-27 10:46:16,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:46:16,508 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-27 10:46:16,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:16,508 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-27 10:46:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-04-27 10:46:16,509 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-27 10:46:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-04-27 10:46:16,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 100 transitions. [2022-04-27 10:46:16,570 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-27 10:46:16,575 INFO L225 Difference]: With dead ends: 91 [2022-04-27 10:46:16,575 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 10:46:16,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:46:16,576 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 51 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:16,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 199 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 10:46:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2022-04-27 10:46:16,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:16,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 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-27 10:46:16,600 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 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-27 10:46:16,600 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 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-27 10:46:16,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:16,601 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-04-27 10:46:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-04-27 10:46:16,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:16,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:16,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 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 89 states. [2022-04-27 10:46:16,602 INFO L87 Difference]: Start difference. First operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 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 89 states. [2022-04-27 10:46:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:16,603 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-04-27 10:46:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-04-27 10:46:16,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:16,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:16,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:16,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 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-27 10:46:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-04-27 10:46:16,606 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 19 [2022-04-27 10:46:16,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:16,606 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-04-27 10:46:16,606 INFO L496 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-27 10:46:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-04-27 10:46:16,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:46:16,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:16,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:16,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 10:46:16,607 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:16,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:16,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1908108286, now seen corresponding path program 1 times [2022-04-27 10:46:16,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:16,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359675396] [2022-04-27 10:46:16,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:16,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:16,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:16,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {5754#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5747#true} is VALID [2022-04-27 10:46:16,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {5747#true} assume true; {5747#true} is VALID [2022-04-27 10:46:16,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5747#true} {5747#true} #191#return; {5747#true} is VALID [2022-04-27 10:46:16,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {5747#true} call ULTIMATE.init(); {5754#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:16,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {5754#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5747#true} is VALID [2022-04-27 10:46:16,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {5747#true} assume true; {5747#true} is VALID [2022-04-27 10:46:16,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5747#true} {5747#true} #191#return; {5747#true} is VALID [2022-04-27 10:46:16,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {5747#true} call #t~ret10 := main(); {5747#true} is VALID [2022-04-27 10:46:16,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {5747#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; {5747#true} is VALID [2022-04-27 10:46:16,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {5747#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5752#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {5752#(<= 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; {5752#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {5752#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_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; {5752#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {5752#(<= 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; {5752#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {5752#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {5752#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {5752#(<= 0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5752#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {5752#(<= 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; {5752#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {5752#(<= 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; {5752#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {5752#(<= 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; {5752#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {5752#(<= 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; {5752#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {5752#(<= 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; {5752#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {5752#(<= 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; {5753#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-27 10:46:16,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {5753#(not (= main_~__VERIFIER_assert__cond~6 0))} assume 0 == ~__VERIFIER_assert__cond~6; {5748#false} is VALID [2022-04-27 10:46:16,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {5748#false} assume !false; {5748#false} is VALID [2022-04-27 10:46:16,674 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-27 10:46:16,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:16,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359675396] [2022-04-27 10:46:16,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359675396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:16,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:16,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:46:16,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610588170] [2022-04-27 10:46:16,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:16,675 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-27 10:46:16,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:16,676 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-27 10:46:16,690 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-27 10:46:16,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:46:16,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:16,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:46:16,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:46:16,691 INFO L87 Difference]: Start difference. First operand 66 states and 73 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-27 10:46:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:16,856 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-04-27 10:46:16,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:46:16,857 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-27 10:46:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:16,857 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-27 10:46:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-27 10:46:16,858 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-27 10:46:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-27 10:46:16,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-27 10:46:16,897 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-27 10:46:16,898 INFO L225 Difference]: With dead ends: 66 [2022-04-27 10:46:16,898 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 10:46:16,898 INFO L412 NwaCegarLoop]: 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-27 10:46:16,899 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:16,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 75 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:46:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 10:46:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-27 10:46:16,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:16,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 55 states have (on average 1.2363636363636363) 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-27 10:46:16,923 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 55 states have (on average 1.2363636363636363) 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-27 10:46:16,923 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 55 states have (on average 1.2363636363636363) 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-27 10:46:16,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:16,924 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-04-27 10:46:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-27 10:46:16,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:16,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:16,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 55 states have (on average 1.2363636363636363) 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 64 states. [2022-04-27 10:46:16,925 INFO L87 Difference]: Start difference. First operand has 64 states, 55 states have (on average 1.2363636363636363) 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 64 states. [2022-04-27 10:46:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:16,926 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-04-27 10:46:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-27 10:46:16,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:16,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:16,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:16,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2363636363636363) 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-27 10:46:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-04-27 10:46:16,928 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 20 [2022-04-27 10:46:16,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:16,928 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-04-27 10:46:16,928 INFO L496 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-27 10:46:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-27 10:46:16,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 10:46:16,929 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:16,929 INFO L195 NwaCegarLoop]: 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-27 10:46:16,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 10:46:16,929 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:16,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:16,929 INFO L85 PathProgramCache]: Analyzing trace with hash 978188398, now seen corresponding path program 1 times [2022-04-27 10:46:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:16,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037013881] [2022-04-27 10:46:16,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:16,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:16,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:16,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {6050#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6043#true} is VALID [2022-04-27 10:46:16,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {6043#true} assume true; {6043#true} is VALID [2022-04-27 10:46:16,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6043#true} {6043#true} #191#return; {6043#true} is VALID [2022-04-27 10:46:16,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {6043#true} call ULTIMATE.init(); {6050#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:16,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {6050#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6043#true} is VALID [2022-04-27 10:46:16,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {6043#true} assume true; {6043#true} is VALID [2022-04-27 10:46:16,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6043#true} {6043#true} #191#return; {6043#true} is VALID [2022-04-27 10:46:16,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {6043#true} call #t~ret10 := main(); {6043#true} is VALID [2022-04-27 10:46:16,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {6043#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; {6043#true} is VALID [2022-04-27 10:46:16,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {6043#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6043#true} is VALID [2022-04-27 10:46:16,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {6043#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; {6043#true} is VALID [2022-04-27 10:46:16,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {6043#true} assume !(0 == ~main____CPAchecker_TMP_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; {6043#true} is VALID [2022-04-27 10:46:16,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {6043#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; {6043#true} is VALID [2022-04-27 10:46:16,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {6043#true} assume !(0 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {6043#true} is VALID [2022-04-27 10:46:16,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {6043#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {6043#true} is VALID [2022-04-27 10:46:16,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {6043#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; {6043#true} is VALID [2022-04-27 10:46:16,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {6043#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; {6043#true} is VALID [2022-04-27 10:46:16,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {6043#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; {6043#true} is VALID [2022-04-27 10:46:16,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {6043#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; {6043#true} is VALID [2022-04-27 10:46:16,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {6043#true} assume !(0 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {6043#true} is VALID [2022-04-27 10:46:16,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {6043#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; {6048#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:16,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {6048#(<= 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; {6049#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-27 10:46:16,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {6049#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {6044#false} is VALID [2022-04-27 10:46:16,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {6044#false} assume !false; {6044#false} is VALID [2022-04-27 10:46:16,975 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-27 10:46:16,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:16,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037013881] [2022-04-27 10:46:16,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037013881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:16,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:16,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:46:16,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050037961] [2022-04-27 10:46:16,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:16,976 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-27 10:46:16,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:16,976 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-27 10:46:16,989 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-27 10:46:16,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:46:16,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:16,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:46:16,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:46:16,990 INFO L87 Difference]: Start difference. First operand 64 states and 71 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-27 10:46:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:17,164 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-04-27 10:46:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:46:17,164 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-27 10:46:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:17,165 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-27 10:46:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-27 10:46:17,166 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-27 10:46:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-27 10:46:17,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-27 10:46:17,207 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-27 10:46:17,207 INFO L225 Difference]: With dead ends: 64 [2022-04-27 10:46:17,208 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 10:46:17,208 INFO L412 NwaCegarLoop]: 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-27 10:46:17,208 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 101 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-27 10:46:17,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 101 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 10:46:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-27 10:46:17,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:17,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 52 states have (on average 1.2307692307692308) 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-27 10:46:17,236 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 52 states have (on average 1.2307692307692308) 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-27 10:46:17,236 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 52 states have (on average 1.2307692307692308) 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-27 10:46:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:17,237 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-04-27 10:46:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-27 10:46:17,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:17,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:17,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 52 states have (on average 1.2307692307692308) 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 60 states. [2022-04-27 10:46:17,238 INFO L87 Difference]: Start difference. First operand has 60 states, 52 states have (on average 1.2307692307692308) 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 60 states. [2022-04-27 10:46:17,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:17,239 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-04-27 10:46:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-27 10:46:17,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:17,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:17,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:17,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:17,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2307692307692308) 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-27 10:46:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-04-27 10:46:17,241 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 21 [2022-04-27 10:46:17,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:17,241 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-04-27 10:46:17,241 INFO L496 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-27 10:46:17,241 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-27 10:46:17,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:46:17,241 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:17,241 INFO L195 NwaCegarLoop]: 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-27 10:46:17,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 10:46:17,242 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:17,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash 272309526, now seen corresponding path program 1 times [2022-04-27 10:46:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:17,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647959780] [2022-04-27 10:46:17,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:17,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:17,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:17,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {6335#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6326#true} is VALID [2022-04-27 10:46:17,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {6326#true} assume true; {6326#true} is VALID [2022-04-27 10:46:17,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6326#true} {6326#true} #191#return; {6326#true} is VALID [2022-04-27 10:46:17,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {6326#true} call ULTIMATE.init(); {6335#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:17,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {6335#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6326#true} is VALID [2022-04-27 10:46:17,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {6326#true} assume true; {6326#true} is VALID [2022-04-27 10:46:17,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6326#true} {6326#true} #191#return; {6326#true} is VALID [2022-04-27 10:46:17,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {6326#true} call #t~ret10 := main(); {6326#true} is VALID [2022-04-27 10:46:17,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {6326#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; {6326#true} is VALID [2022-04-27 10:46:17,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {6326#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6326#true} is VALID [2022-04-27 10:46:17,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {6326#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; {6326#true} is VALID [2022-04-27 10:46:17,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {6326#true} assume !(0 == ~main____CPAchecker_TMP_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; {6326#true} is VALID [2022-04-27 10:46:17,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {6326#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; {6326#true} is VALID [2022-04-27 10:46:17,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {6326#true} assume !(0 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {6326#true} is VALID [2022-04-27 10:46:17,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {6326#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {6326#true} is VALID [2022-04-27 10:46:17,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {6326#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; {6331#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:17,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {6331#(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; {6331#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:17,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {6331#(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; {6331#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:17,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {6331#(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; {6332#(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-27 10:46:17,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {6332#(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; {6333#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:17,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {6333#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {6333#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:17,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {6333#(<= 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; {6333#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:17,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {6333#(<= 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; {6334#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-27 10:46:17,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {6334#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {6327#false} is VALID [2022-04-27 10:46:17,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {6327#false} assume !false; {6327#false} is VALID [2022-04-27 10:46:17,328 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-27 10:46:17,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:17,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647959780] [2022-04-27 10:46:17,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647959780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:17,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:17,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:17,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965416815] [2022-04-27 10:46:17,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:17,329 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-27 10:46:17,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:17,329 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-27 10:46:17,344 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-27 10:46:17,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:17,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:17,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:17,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:17,345 INFO L87 Difference]: Start difference. First operand 60 states and 67 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-27 10:46:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:17,685 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-27 10:46:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:46:17,686 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-27 10:46:17,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:17,686 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-27 10:46:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-27 10:46:17,687 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-27 10:46:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-27 10:46:17,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-27 10:46:17,739 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-27 10:46:17,740 INFO L225 Difference]: With dead ends: 75 [2022-04-27 10:46:17,741 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 10:46:17,741 INFO L412 NwaCegarLoop]: 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-27 10:46:17,741 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 84 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:17,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 67 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 10:46:17,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2022-04-27 10:46:17,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:17,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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-27 10:46:17,765 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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-27 10:46:17,765 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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-27 10:46:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:17,767 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-04-27 10:46:17,767 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-04-27 10:46:17,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:17,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:17,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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 73 states. [2022-04-27 10:46:17,767 INFO L87 Difference]: Start difference. First operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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 73 states. [2022-04-27 10:46:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:17,768 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-04-27 10:46:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-04-27 10:46:17,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:17,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:17,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:17,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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-27 10:46:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-04-27 10:46:17,770 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 22 [2022-04-27 10:46:17,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:17,770 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-04-27 10:46:17,770 INFO L496 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-27 10:46:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-04-27 10:46:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:46:17,771 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:17,771 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:17,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 10:46:17,771 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:17,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:17,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1682587452, now seen corresponding path program 1 times [2022-04-27 10:46:17,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:17,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3906603] [2022-04-27 10:46:17,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:17,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:17,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:17,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {6661#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6651#true} is VALID [2022-04-27 10:46:17,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 10:46:17,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6651#true} {6651#true} #191#return; {6651#true} is VALID [2022-04-27 10:46:17,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {6651#true} call ULTIMATE.init(); {6661#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:17,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {6661#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6651#true} is VALID [2022-04-27 10:46:17,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 10:46:17,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6651#true} {6651#true} #191#return; {6651#true} is VALID [2022-04-27 10:46:17,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {6651#true} call #t~ret10 := main(); {6651#true} is VALID [2022-04-27 10:46:17,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {6651#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; {6651#true} is VALID [2022-04-27 10:46:17,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {6651#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6651#true} is VALID [2022-04-27 10:46:17,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {6651#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; {6651#true} is VALID [2022-04-27 10:46:17,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {6651#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; {6651#true} is VALID [2022-04-27 10:46:17,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {6651#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; {6651#true} is VALID [2022-04-27 10:46:17,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {6651#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {6651#true} is VALID [2022-04-27 10:46:17,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {6651#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; {6651#true} is VALID [2022-04-27 10:46:17,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {6651#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; {6656#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:17,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {6656#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {6656#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:17,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {6656#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {6657#(or (and (= main_~__VERIFIER_assert__cond~19 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-27 10:46:17,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {6657#(or (and (= main_~__VERIFIER_assert__cond~19 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~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {6658#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:17,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {6658#(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; {6659#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:17,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {6659#(<= 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; {6659#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:17,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {6659#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {6659#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:17,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {6659#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {6660#(not (= main_~__VERIFIER_assert__cond~19 0))} is VALID [2022-04-27 10:46:17,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {6660#(not (= main_~__VERIFIER_assert__cond~19 0))} assume 0 == ~__VERIFIER_assert__cond~19; {6652#false} is VALID [2022-04-27 10:46:17,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {6652#false} assume !false; {6652#false} is VALID [2022-04-27 10:46:17,869 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-27 10:46:17,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:17,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3906603] [2022-04-27 10:46:17,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3906603] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:46:17,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858562835] [2022-04-27 10:46:17,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:17,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:46:17,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:46:17,875 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-27 10:46:17,880 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-27 10:46:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:17,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 10:46:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:17,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:46:18,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {6651#true} call ULTIMATE.init(); {6651#true} is VALID [2022-04-27 10:46:18,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {6651#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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6651#true} is VALID [2022-04-27 10:46:18,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 10:46:18,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6651#true} {6651#true} #191#return; {6651#true} is VALID [2022-04-27 10:46:18,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {6651#true} call #t~ret10 := main(); {6651#true} is VALID [2022-04-27 10:46:18,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {6651#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; {6651#true} is VALID [2022-04-27 10:46:18,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {6651#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6683#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} is VALID [2022-04-27 10:46:18,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {6683#(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; {6687#(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-27 10:46:18,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {6687#(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; {6687#(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-27 10:46:18,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {6687#(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; {6687#(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-27 10:46:18,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {6687#(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; {6687#(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-27 10:46:18,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {6687#(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; {6700#(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-27 10:46:18,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {6700#(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; {6704#(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-27 10:46:18,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {6704#(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_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {6704#(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-27 10:46:18,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {6704#(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~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {6704#(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-27 10:46:18,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {6704#(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~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {6704#(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-27 10:46:18,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {6704#(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; {6717#(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-27 10:46:18,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {6717#(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; {6717#(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-27 10:46:18,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {6717#(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_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {6717#(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-27 10:46:18,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {6717#(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~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {6727#(<= 1 main_~__VERIFIER_assert__cond~19)} is VALID [2022-04-27 10:46:18,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {6727#(<= 1 main_~__VERIFIER_assert__cond~19)} assume 0 == ~__VERIFIER_assert__cond~19; {6652#false} is VALID [2022-04-27 10:46:18,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {6652#false} assume !false; {6652#false} is VALID [2022-04-27 10:46:18,692 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-27 10:46:18,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:46:18,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {6652#false} assume !false; {6652#false} is VALID [2022-04-27 10:46:18,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {6727#(<= 1 main_~__VERIFIER_assert__cond~19)} assume 0 == ~__VERIFIER_assert__cond~19; {6652#false} is VALID [2022-04-27 10:46:18,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {6659#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {6727#(<= 1 main_~__VERIFIER_assert__cond~19)} is VALID [2022-04-27 10:46:18,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {6659#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {6659#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:18,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {6659#(<= 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; {6659#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:18,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {6658#(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; {6659#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:18,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {6658#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {6658#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:18,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {6658#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {6658#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:18,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {6658#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {6658#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:18,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {6659#(<= 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; {6658#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:18,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {6658#(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; {6659#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:18,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {6658#(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; {6658#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:18,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {6658#(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; {6658#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:18,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {6658#(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; {6658#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:18,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {6659#(<= 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; {6658#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:18,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {6651#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6659#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:18,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {6651#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; {6651#true} is VALID [2022-04-27 10:46:18,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {6651#true} call #t~ret10 := main(); {6651#true} is VALID [2022-04-27 10:46:18,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6651#true} {6651#true} #191#return; {6651#true} is VALID [2022-04-27 10:46:18,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 10:46:18,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {6651#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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6651#true} is VALID [2022-04-27 10:46:18,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {6651#true} call ULTIMATE.init(); {6651#true} is VALID [2022-04-27 10:46:18,899 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-27 10:46:18,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858562835] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:46:18,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:46:18,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-27 10:46:18,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116640738] [2022-04-27 10:46:18,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:46:18,901 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:46:18,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:18,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:18,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:18,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:46:18,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:18,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:46:18,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:46:18,935 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:19,705 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-04-27 10:46:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 10:46:19,706 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:46:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 115 transitions. [2022-04-27 10:46:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 115 transitions. [2022-04-27 10:46:19,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 115 transitions. [2022-04-27 10:46:19,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:19,792 INFO L225 Difference]: With dead ends: 102 [2022-04-27 10:46:19,792 INFO L226 Difference]: Without dead ends: 100 [2022-04-27 10:46:19,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-04-27 10:46:19,793 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 152 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:19,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 150 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:46:19,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-27 10:46:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 51. [2022-04-27 10:46:19,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:19,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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-27 10:46:19,835 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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-27 10:46:19,835 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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-27 10:46:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:19,836 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-04-27 10:46:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2022-04-27 10:46:19,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:19,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:19,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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 100 states. [2022-04-27 10:46:19,837 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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 100 states. [2022-04-27 10:46:19,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:19,839 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-04-27 10:46:19,839 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2022-04-27 10:46:19,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:19,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:19,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:19,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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-27 10:46:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-04-27 10:46:19,841 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2022-04-27 10:46:19,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:19,841 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-04-27 10:46:19,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:19,841 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-04-27 10:46:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:46:19,841 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:19,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:19,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 10:46:20,051 WARN L477 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-27 10:46:20,052 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:20,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1683018428, now seen corresponding path program 1 times [2022-04-27 10:46:20,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:20,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049695735] [2022-04-27 10:46:20,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:20,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:20,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {7211#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {7201#true} is VALID [2022-04-27 10:46:20,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {7201#true} assume true; {7201#true} is VALID [2022-04-27 10:46:20,127 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7201#true} {7201#true} #191#return; {7201#true} is VALID [2022-04-27 10:46:20,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {7201#true} call ULTIMATE.init(); {7211#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:20,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {7211#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {7201#true} is VALID [2022-04-27 10:46:20,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {7201#true} assume true; {7201#true} is VALID [2022-04-27 10:46:20,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7201#true} {7201#true} #191#return; {7201#true} is VALID [2022-04-27 10:46:20,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {7201#true} call #t~ret10 := main(); {7201#true} is VALID [2022-04-27 10:46:20,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {7201#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; {7201#true} is VALID [2022-04-27 10:46:20,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {7201#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7201#true} is VALID [2022-04-27 10:46:20,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {7201#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; {7201#true} is VALID [2022-04-27 10:46:20,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {7201#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; {7201#true} is VALID [2022-04-27 10:46:20,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {7201#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; {7201#true} is VALID [2022-04-27 10:46:20,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {7201#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {7201#true} is VALID [2022-04-27 10:46:20,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {7201#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; {7201#true} is VALID [2022-04-27 10:46:20,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {7201#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; {7206#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:20,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {7206#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {7206#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:20,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {7206#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {7207#(or (and (= main_~__VERIFIER_assert__cond~19 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-27 10:46:20,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {7207#(or (and (= main_~__VERIFIER_assert__cond~19 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~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {7208#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:20,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {7208#(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; {7209#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:20,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {7209#(<= 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; {7209#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:20,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {7209#(<= 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; {7209#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:20,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {7209#(<= 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; {7210#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-27 10:46:20,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {7210#(not (= main_~__VERIFIER_assert__cond~17 0))} assume 0 == ~__VERIFIER_assert__cond~17; {7202#false} is VALID [2022-04-27 10:46:20,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {7202#false} assume !false; {7202#false} is VALID [2022-04-27 10:46:20,132 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-27 10:46:20,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:20,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049695735] [2022-04-27 10:46:20,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049695735] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:46:20,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305920333] [2022-04-27 10:46:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:20,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:46:20,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:46:20,134 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-27 10:46:20,145 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-27 10:46:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:20,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 10:46:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:20,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:46:20,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {7201#true} call ULTIMATE.init(); {7201#true} is VALID [2022-04-27 10:46:20,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {7201#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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {7201#true} is VALID [2022-04-27 10:46:20,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {7201#true} assume true; {7201#true} is VALID [2022-04-27 10:46:20,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7201#true} {7201#true} #191#return; {7201#true} is VALID [2022-04-27 10:46:20,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {7201#true} call #t~ret10 := main(); {7201#true} is VALID [2022-04-27 10:46:20,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {7201#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; {7201#true} is VALID [2022-04-27 10:46:20,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {7201#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7233#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} is VALID [2022-04-27 10:46:20,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {7233#(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; {7237#(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-27 10:46:20,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {7237#(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; {7237#(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-27 10:46:20,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {7237#(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; {7237#(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-27 10:46:20,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {7237#(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; {7237#(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-27 10:46:20,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {7237#(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; {7250#(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-27 10:46:20,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {7250#(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; {7254#(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-27 10:46:20,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {7254#(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_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {7254#(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-27 10:46:20,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {7254#(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~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {7254#(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-27 10:46:20,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {7254#(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~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {7254#(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-27 10:46:20,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {7254#(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; {7267#(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-27 10:46:20,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {7267#(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; {7267#(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-27 10:46:20,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {7267#(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; {7267#(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-27 10:46:20,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {7267#(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; {7277#(<= 1 main_~__VERIFIER_assert__cond~17)} is VALID [2022-04-27 10:46:20,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {7277#(<= 1 main_~__VERIFIER_assert__cond~17)} assume 0 == ~__VERIFIER_assert__cond~17; {7202#false} is VALID [2022-04-27 10:46:20,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {7202#false} assume !false; {7202#false} is VALID [2022-04-27 10:46:20,798 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-27 10:46:20,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:46:20,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {7202#false} assume !false; {7202#false} is VALID [2022-04-27 10:46:20,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {7277#(<= 1 main_~__VERIFIER_assert__cond~17)} assume 0 == ~__VERIFIER_assert__cond~17; {7202#false} is VALID [2022-04-27 10:46:20,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {7209#(<= 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; {7277#(<= 1 main_~__VERIFIER_assert__cond~17)} is VALID [2022-04-27 10:46:20,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {7209#(<= 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; {7209#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:20,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {7209#(<= 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; {7209#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:20,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {7208#(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; {7209#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:20,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {7208#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {7208#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:20,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {7208#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {7208#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:20,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {7208#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {7208#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:20,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {7209#(<= 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; {7208#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:20,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {7208#(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; {7209#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:20,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {7208#(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; {7208#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:20,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {7208#(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; {7208#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:20,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {7208#(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; {7208#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:20,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {7209#(<= 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; {7208#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:20,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {7201#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7209#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:20,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {7201#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; {7201#true} is VALID [2022-04-27 10:46:20,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {7201#true} call #t~ret10 := main(); {7201#true} is VALID [2022-04-27 10:46:20,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7201#true} {7201#true} #191#return; {7201#true} is VALID [2022-04-27 10:46:20,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {7201#true} assume true; {7201#true} is VALID [2022-04-27 10:46:20,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {7201#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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {7201#true} is VALID [2022-04-27 10:46:20,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {7201#true} call ULTIMATE.init(); {7201#true} is VALID [2022-04-27 10:46:20,957 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-27 10:46:20,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305920333] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:46:20,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:46:20,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-27 10:46:20,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057680873] [2022-04-27 10:46:20,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:46:20,959 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:46:20,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:20,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:20,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:20,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:46:20,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:20,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:46:20,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:46:20,992 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:21,829 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2022-04-27 10:46:21,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 10:46:21,829 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:46:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 128 transitions. [2022-04-27 10:46:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 128 transitions. [2022-04-27 10:46:21,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 128 transitions. [2022-04-27 10:46:21,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:21,950 INFO L225 Difference]: With dead ends: 113 [2022-04-27 10:46:21,950 INFO L226 Difference]: Without dead ends: 111 [2022-04-27 10:46:21,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-04-27 10:46:21,951 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 317 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:21,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 106 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:46:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-27 10:46:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 44. [2022-04-27 10:46:21,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:21,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:21,980 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:21,981 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:21,982 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-27 10:46:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-27 10:46:21,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:21,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:21,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 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 111 states. [2022-04-27 10:46:21,983 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 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 111 states. [2022-04-27 10:46:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:21,985 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-27 10:46:21,985 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-27 10:46:21,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:21,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:21,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:21,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-27 10:46:21,987 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 22 [2022-04-27 10:46:21,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:21,987 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-27 10:46:21,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-27 10:46:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 10:46:21,988 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:21,988 INFO L195 NwaCegarLoop]: 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-27 10:46:22,012 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-27 10:46:22,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-27 10:46:22,204 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:22,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:22,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1184340980, now seen corresponding path program 1 times [2022-04-27 10:46:22,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:22,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813477114] [2022-04-27 10:46:22,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:22,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:22,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {7787#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {7777#true} is VALID [2022-04-27 10:46:22,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {7777#true} assume true; {7777#true} is VALID [2022-04-27 10:46:22,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7777#true} {7777#true} #191#return; {7777#true} is VALID [2022-04-27 10:46:22,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {7777#true} call ULTIMATE.init(); {7787#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:22,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {7787#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {7777#true} is VALID [2022-04-27 10:46:22,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {7777#true} assume true; {7777#true} is VALID [2022-04-27 10:46:22,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7777#true} {7777#true} #191#return; {7777#true} is VALID [2022-04-27 10:46:22,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {7777#true} call #t~ret10 := main(); {7777#true} is VALID [2022-04-27 10:46:22,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {7777#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; {7777#true} is VALID [2022-04-27 10:46:22,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {7777#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7777#true} is VALID [2022-04-27 10:46:22,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {7777#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; {7777#true} is VALID [2022-04-27 10:46:22,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {7777#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; {7777#true} is VALID [2022-04-27 10:46:22,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {7777#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; {7777#true} is VALID [2022-04-27 10:46:22,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {7777#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {7777#true} is VALID [2022-04-27 10:46:22,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {7777#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; {7777#true} is VALID [2022-04-27 10:46:22,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {7777#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; {7782#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:22,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {7782#(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; {7782#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:22,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {7782#(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; {7783#(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-27 10:46:22,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {7783#(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_259_0~0 := ~main____CPAchecker_TMP_0~1; {7784#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:22,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {7784#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {7785#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:22,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {7785#(<= 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; {7785#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:22,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {7785#(<= 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; {7785#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:22,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {7785#(<= 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; {7785#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:22,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {7785#(<= 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; {7786#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-27 10:46:22,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {7786#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {7778#false} is VALID [2022-04-27 10:46:22,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {7778#false} assume !false; {7778#false} is VALID [2022-04-27 10:46:22,289 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-27 10:46:22,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:22,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813477114] [2022-04-27 10:46:22,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813477114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:22,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:22,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:46:22,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113109544] [2022-04-27 10:46:22,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:22,290 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-27 10:46:22,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:22,291 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-27 10:46:22,306 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-27 10:46:22,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:46:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:22,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:46:22,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:46:22,307 INFO L87 Difference]: Start difference. First operand 44 states and 50 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-27 10:46:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:22,582 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-04-27 10:46:22,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:46:22,582 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-27 10:46:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:22,583 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-27 10:46:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-27 10:46:22,584 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-27 10:46:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-27 10:46:22,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2022-04-27 10:46:22,630 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-27 10:46:22,630 INFO L225 Difference]: With dead ends: 56 [2022-04-27 10:46:22,631 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 10:46:22,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:46:22,631 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:22,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 48 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 10:46:22,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2022-04-27 10:46:22,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:22,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:22,662 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:22,662 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:22,663 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-27 10:46:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-27 10:46:22,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:22,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:22,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 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 54 states. [2022-04-27 10:46:22,664 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 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 54 states. [2022-04-27 10:46:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:22,665 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-27 10:46:22,665 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-27 10:46:22,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:22,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:22,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:22,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-04-27 10:46:22,666 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2022-04-27 10:46:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:22,666 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-04-27 10:46:22,666 INFO L496 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-27 10:46:22,666 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-27 10:46:22,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 10:46:22,667 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:22,667 INFO L195 NwaCegarLoop]: 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-27 10:46:22,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 10:46:22,667 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 10:46:22,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:22,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1136625730, now seen corresponding path program 1 times [2022-04-27 10:46:22,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:22,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476174177] [2022-04-27 10:46:22,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:22,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:22,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:22,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {8034#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {8024#true} is VALID [2022-04-27 10:46:22,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {8024#true} assume true; {8024#true} is VALID [2022-04-27 10:46:22,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8024#true} {8024#true} #191#return; {8024#true} is VALID [2022-04-27 10:46:22,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {8024#true} call ULTIMATE.init(); {8034#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:22,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {8034#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {8024#true} is VALID [2022-04-27 10:46:22,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {8024#true} assume true; {8024#true} is VALID [2022-04-27 10:46:22,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8024#true} {8024#true} #191#return; {8024#true} is VALID [2022-04-27 10:46:22,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {8024#true} call #t~ret10 := main(); {8024#true} is VALID [2022-04-27 10:46:22,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {8024#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; {8024#true} is VALID [2022-04-27 10:46:22,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {8024#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {8024#true} is VALID [2022-04-27 10:46:22,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {8024#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; {8024#true} is VALID [2022-04-27 10:46:22,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {8024#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; {8024#true} is VALID [2022-04-27 10:46:22,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {8024#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; {8024#true} is VALID [2022-04-27 10:46:22,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {8024#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {8024#true} is VALID [2022-04-27 10:46:22,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {8024#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; {8024#true} is VALID [2022-04-27 10:46:22,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {8024#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; {8029#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:22,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {8029#(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; {8029#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:22,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {8029#(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; {8030#(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-27 10:46:22,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {8030#(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_259_0~0 := ~main____CPAchecker_TMP_0~1; {8031#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:46:22,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {8031#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8032#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:22,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {8032#(<= 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; {8032#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:22,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {8032#(<= 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; {8032#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:22,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {8032#(<= 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; {8032#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:46:22,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {8032#(<= 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; {8033#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 10:46:22,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {8033#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {8025#false} is VALID [2022-04-27 10:46:22,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {8025#false} assume !false; {8025#false} is VALID [2022-04-27 10:46:22,748 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-27 10:46:22,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:22,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476174177] [2022-04-27 10:46:22,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476174177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:22,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:22,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:46:22,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490897051] [2022-04-27 10:46:22,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:22,749 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-27 10:46:22,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:22,749 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-27 10:46:22,767 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-27 10:46:22,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:46:22,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:22,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:46:22,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:46:22,768 INFO L87 Difference]: Start difference. First operand 39 states and 44 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-27 10:46:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:22,984 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-27 10:46:22,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:46:22,985 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-27 10:46:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:22,985 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-27 10:46:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 10:46:22,986 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-27 10:46:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 10:46:22,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-27 10:46:23,019 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-27 10:46:23,019 INFO L225 Difference]: With dead ends: 39 [2022-04-27 10:46:23,019 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:46:23,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-27 10:46:23,020 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:23,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 43 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:46:23,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:46:23,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:23,021 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-27 10:46:23,021 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-27 10:46:23,021 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-27 10:46:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:23,021 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:46:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:46:23,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:23,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:23,022 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-27 10:46:23,022 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-27 10:46:23,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:23,022 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:46:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:46:23,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:23,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:23,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:23,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:23,022 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-27 10:46:23,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:46:23,023 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-27 10:46:23,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:23,023 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:46:23,023 INFO L496 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-27 10:46:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:46:23,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:23,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-04-27 10:46:23,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-04-27 10:46:23,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-04-27 10:46:23,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-04-27 10:46:23,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-04-27 10:46:23,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-04-27 10:46:23,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-04-27 10:46:23,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-04-27 10:46:23,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-04-27 10:46:23,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-04-27 10:46:23,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-04-27 10:46:23,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-04-27 10:46:23,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-04-27 10:46:23,027 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-04-27 10:46:23,027 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-04-27 10:46:23,027 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-04-27 10:46:23,027 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-04-27 10:46:23,027 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-04-27 10:46:23,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 10:46:23,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:50:01,204 WARN L232 SmtUtils]: Spent 3.64m on a formula simplification. DAG size of input: 90 DAG size of output: 91 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 10:50:10,556 WARN L232 SmtUtils]: Spent 9.34s on a formula simplification. DAG size of input: 87 DAG size of output: 46 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 10:51:21,524 WARN L232 SmtUtils]: Spent 1.16m on a formula simplification. DAG size of input: 76 DAG size of output: 75 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 10:51:22,099 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-27 10:51:22,100 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-27 10:51:22,100 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-27 10:51:22,100 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:51:22,100 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 10:51:22,100 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:51:22,100 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:51:22,100 INFO L899 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2022-04-27 10:51:22,100 INFO L899 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2022-04-27 10:51:22,100 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 15 402) no Hoare annotation was computed. [2022-04-27 10:51:22,100 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-04-27 10:51:22,100 INFO L899 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2022-04-27 10:51:22,100 INFO L899 garLoopResultBuilder]: For program point L366(line 366) no Hoare annotation was computed. [2022-04-27 10:51:22,101 INFO L899 garLoopResultBuilder]: For program point L333(line 333) no Hoare annotation was computed. [2022-04-27 10:51:22,101 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 242) no Hoare annotation was computed. [2022-04-27 10:51:22,101 INFO L899 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 278) no Hoare annotation was computed. [2022-04-27 10:51:22,101 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2022-04-27 10:51:22,101 INFO L899 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2022-04-27 10:51:22,101 INFO L899 garLoopResultBuilder]: For program point L309(line 309) no Hoare annotation was computed. [2022-04-27 10:51:22,101 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 401) no Hoare annotation was computed. [2022-04-27 10:51:22,101 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 391) no Hoare annotation was computed. [2022-04-27 10:51:22,101 INFO L899 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 333) no Hoare annotation was computed. [2022-04-27 10:51:22,101 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 94) no Hoare annotation was computed. [2022-04-27 10:51:22,102 INFO L895 garLoopResultBuilder]: At program point L384(lines 282 391) the Hoare annotation is: (let ((.cse1 (= main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse3 (<= 1 main_~main__t~0)) (and .cse3 .cse1))))) (or (and .cse2 (not (= main_~__VERIFIER_assert__cond~18 0))) (and .cse2 .cse1))))) (or (and .cse0 .cse1 (< 0 main_~main__tagbuf_len~0)) (and (<= 1 main_~__VERIFIER_assert__cond~19) .cse0 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)))))) [2022-04-27 10:51:22,102 INFO L895 garLoopResultBuilder]: At program point L351(lines 32 395) the Hoare annotation is: (let ((.cse0 (= main_~main__t~0 0))) (or (and .cse0 (< 0 main_~main__tagbuf_len~0)) (and (<= 1 main_~__VERIFIER_assert__cond~17) (let ((.cse1 (<= main_~main__t~0 1))) (let ((.cse2 (not (= main_~__VERIFIER_assert__cond~17 0))) (.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (or (not (= main_~__VERIFIER_assert__cond~13 0)) (and (<= 0 main_~main__tagbuf_len~0) .cse0)))) (or (and .cse6 (<= 1 main_~main__t~0)) (and .cse6 .cse0))))) (or (and .cse5 .cse0) (and .cse5 (not (= main_~__VERIFIER_assert__cond~16 0))))))) (or (and .cse1 .cse4 (not (<= main_~main__tagbuf_len~0 0))) (and .cse4 (not (= main_~__VERIFIER_assert__cond~19 0))))))) (or (and .cse1 .cse2 (< main_~main__t~0 main_~main__tagbuf_len~0) .cse3) (and (<= 1 main_~__VERIFIER_assert__cond~19) .cse2 .cse3 (not (<= main_~main__tagbuf_len~0 main_~main__t~0))))))))) [2022-04-27 10:51:22,102 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 196) no Hoare annotation was computed. [2022-04-27 10:51:22,102 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 385) no Hoare annotation was computed. [2022-04-27 10:51:22,102 INFO L899 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2022-04-27 10:51:22,102 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 352) no Hoare annotation was computed. [2022-04-27 10:51:22,102 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 203) no Hoare annotation was computed. [2022-04-27 10:51:22,102 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 15 402) no Hoare annotation was computed. [2022-04-27 10:51:22,102 INFO L899 garLoopResultBuilder]: For program point L236(line 236) no Hoare annotation was computed. [2022-04-27 10:51:22,103 INFO L899 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 309) no Hoare annotation was computed. [2022-04-27 10:51:22,103 INFO L895 garLoopResultBuilder]: At program point L195(lines 56 253) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-27 10:51:22,103 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2022-04-27 10:51:22,103 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 15 402) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-04-27 10:51:22,103 INFO L899 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-04-27 10:51:22,103 INFO L899 garLoopResultBuilder]: For program point L278(line 278) no Hoare annotation was computed. [2022-04-27 10:51:22,103 INFO L899 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2022-04-27 10:51:22,103 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 209) no Hoare annotation was computed. [2022-04-27 10:51:22,103 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2022-04-27 10:51:22,103 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 255) no Hoare annotation was computed. [2022-04-27 10:51:22,103 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 317) no Hoare annotation was computed. [2022-04-27 10:51:22,104 INFO L899 garLoopResultBuilder]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 366) no Hoare annotation was computed. [2022-04-27 10:51:22,104 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-04-27 10:51:22,104 INFO L899 garLoopResultBuilder]: For program point L378(line 378) no Hoare annotation was computed. [2022-04-27 10:51:22,104 INFO L899 garLoopResultBuilder]: For program point L345(line 345) no Hoare annotation was computed. [2022-04-27 10:51:22,104 INFO L899 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 176) no Hoare annotation was computed. [2022-04-27 10:51:22,104 INFO L899 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2022-04-27 10:51:22,104 INFO L899 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 345) no Hoare annotation was computed. [2022-04-27 10:51:22,104 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 395) no Hoare annotation was computed. [2022-04-27 10:51:22,104 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 390) no Hoare annotation was computed. [2022-04-27 10:51:22,104 INFO L899 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2022-04-27 10:51:22,104 INFO L899 garLoopResultBuilder]: For program point L222(lines 222 244) no Hoare annotation was computed. [2022-04-27 10:51:22,104 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 396) no Hoare annotation was computed. [2022-04-27 10:51:22,104 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 92) no Hoare annotation was computed. [2022-04-27 10:51:22,105 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 162) no Hoare annotation was computed. [2022-04-27 10:51:22,105 INFO L899 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 236) no Hoare annotation was computed. [2022-04-27 10:51:22,105 INFO L899 garLoopResultBuilder]: For program point L297(line 297) no Hoare annotation was computed. [2022-04-27 10:51:22,105 INFO L899 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 72) no Hoare annotation was computed. [2022-04-27 10:51:22,105 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 201) no Hoare annotation was computed. [2022-04-27 10:51:22,105 INFO L902 garLoopResultBuilder]: At program point L314(lines 32 395) the Hoare annotation is: true [2022-04-27 10:51:22,105 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 250) no Hoare annotation was computed. [2022-04-27 10:51:22,105 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 253) no Hoare annotation was computed. [2022-04-27 10:51:22,105 INFO L899 garLoopResultBuilder]: For program point L174(lines 174 198) no Hoare annotation was computed. [2022-04-27 10:51:22,105 INFO L899 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2022-04-27 10:51:22,105 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 387) no Hoare annotation was computed. [2022-04-27 10:51:22,105 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 354) no Hoare annotation was computed. [2022-04-27 10:51:22,105 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 393) no Hoare annotation was computed. [2022-04-27 10:51:22,106 INFO L899 garLoopResultBuilder]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 378) no Hoare annotation was computed. [2022-04-27 10:51:22,106 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 200) no Hoare annotation was computed. [2022-04-27 10:51:22,106 INFO L899 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2022-04-27 10:51:22,106 INFO L899 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 126) no Hoare annotation was computed. [2022-04-27 10:51:22,106 INFO L895 garLoopResultBuilder]: At program point L249(lines 101 251) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-27 10:51:22,106 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-04-27 10:51:22,106 INFO L899 garLoopResultBuilder]: For program point L307(lines 307 315) no Hoare annotation was computed. [2022-04-27 10:51:22,106 INFO L899 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 297) no Hoare annotation was computed. [2022-04-27 10:51:22,106 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-04-27 10:51:22,106 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 251) no Hoare annotation was computed. [2022-04-27 10:51:22,106 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 389) no Hoare annotation was computed. [2022-04-27 10:51:22,106 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:51:22,107 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:51:22,107 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:51:22,107 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:51:22,107 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:51:22,107 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:51:22,107 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:51:22,109 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:51:22,111 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:51:22,114 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:51:22,114 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:51:22,115 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:51:22,115 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 10:51:22,115 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:51:22,115 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:51:22,115 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:51:22,115 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:51:22,115 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L276 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L276 has no Hoare annotation [2022-04-27 10:51:22,116 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 10:51:22,117 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 10:51:22,120 WARN L170 areAnnotationChecker]: L278 has no Hoare annotation [2022-04-27 10:51:22,120 WARN L170 areAnnotationChecker]: L278 has no Hoare annotation [2022-04-27 10:51:22,120 WARN L170 areAnnotationChecker]: L288 has no Hoare annotation [2022-04-27 10:51:22,120 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-27 10:51:22,120 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-04-27 10:51:22,120 WARN L170 areAnnotationChecker]: L288 has no Hoare annotation [2022-04-27 10:51:22,120 WARN L170 areAnnotationChecker]: L288 has no Hoare annotation [2022-04-27 10:51:22,120 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-27 10:51:22,120 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-27 10:51:22,120 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-04-27 10:51:22,120 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-04-27 10:51:22,120 WARN L170 areAnnotationChecker]: L295 has no Hoare annotation [2022-04-27 10:51:22,120 WARN L170 areAnnotationChecker]: L295 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L324 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L324 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L215 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L215 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L297 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L297 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L307 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L307 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L331 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L331 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-04-27 10:51:22,121 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L174 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L309 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L309 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L343 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L343 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L376 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L376 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-27 10:51:22,122 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L174 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L174 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L345 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L345 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L378 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L378 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L176 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L176 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2022-04-27 10:51:22,123 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2022-04-27 10:51:22,124 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2022-04-27 10:51:22,124 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2022-04-27 10:51:22,124 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-04-27 10:51:22,124 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-04-27 10:51:22,124 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-04-27 10:51:22,124 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-04-27 10:51:22,124 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-04-27 10:51:22,124 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-04-27 10:51:22,124 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2022-04-27 10:51:22,124 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2022-04-27 10:51:22,124 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2022-04-27 10:51:22,124 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2022-04-27 10:51:22,124 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:51:22,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:51:22 BoogieIcfgContainer [2022-04-27 10:51:22,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:51:22,137 INFO L158 Benchmark]: Toolchain (without parser) took 315616.85ms. Allocated memory was 182.5MB in the beginning and 584.1MB in the end (delta: 401.6MB). Free memory was 125.3MB in the beginning and 407.4MB in the end (delta: -282.1MB). Peak memory consumption was 326.5MB. Max. memory is 8.0GB. [2022-04-27 10:51:22,137 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory was 142.1MB in the beginning and 142.0MB in the end (delta: 80.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:51:22,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.58ms. Allocated memory was 182.5MB in the beginning and 232.8MB in the end (delta: 50.3MB). Free memory was 125.1MB in the beginning and 201.2MB in the end (delta: -76.1MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. [2022-04-27 10:51:22,137 INFO L158 Benchmark]: Boogie Preprocessor took 61.23ms. Allocated memory is still 232.8MB. Free memory was 201.2MB in the beginning and 199.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:51:22,138 INFO L158 Benchmark]: RCFGBuilder took 449.17ms. Allocated memory is still 232.8MB. Free memory was 199.1MB in the beginning and 180.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-04-27 10:51:22,138 INFO L158 Benchmark]: TraceAbstraction took 314775.04ms. Allocated memory was 232.8MB in the beginning and 584.1MB in the end (delta: 351.3MB). Free memory was 180.3MB in the beginning and 407.4MB in the end (delta: -227.1MB). Peak memory consumption was 331.2MB. Max. memory is 8.0GB. [2022-04-27 10:51:22,139 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.11ms. Allocated memory is still 182.5MB. Free memory was 142.1MB in the beginning and 142.0MB in the end (delta: 80.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 326.58ms. Allocated memory was 182.5MB in the beginning and 232.8MB in the end (delta: 50.3MB). Free memory was 125.1MB in the beginning and 201.2MB in the end (delta: -76.1MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.23ms. Allocated memory is still 232.8MB. Free memory was 201.2MB in the beginning and 199.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 449.17ms. Allocated memory is still 232.8MB. Free memory was 199.1MB in the beginning and 180.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 314775.04ms. Allocated memory was 232.8MB in the beginning and 584.1MB in the end (delta: 351.3MB). Free memory was 180.3MB in the beginning and 407.4MB in the end (delta: -227.1MB). Peak memory consumption was 331.2MB. 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: 52]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 72]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 84]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 126]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 142]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 154]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 176]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 188]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 224]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 236]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 278]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 297]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 309]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 345]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 366]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 378]: 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, 87 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 314.7s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 299.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1735 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1735 mSDsluCounter, 3023 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1930 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3570 IncrementalHoareTripleChecker+Invalid, 3784 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 1093 mSDtfsCounter, 3570 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 147 SyntacticMatches, 10 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 508 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 519 HoareAnnotationTreeSize, 9 FomulaSimplifications, 3331877 FormulaSimplificationTreeSizeReduction, 298.5s HoareSimplificationTime, 9 FomulaSimplificationsInter, 11210759 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 473 ConstructedInterpolants, 0 QuantifiedInterpolants, 1950 SizeOfPredicates, 6 NumberOfNonLiveVariables, 301 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 InterpolantCoveringCapability, 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 18 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (main__t == 0 && 0 < main__tagbuf_len) || (1 <= __VERIFIER_assert__cond && ((((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && main__t < main__tagbuf_len) && (((main__t <= 1 && (((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && main__t == 0) || ((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= 0)) || ((((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && main__t == 0) || ((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)))) || (((1 <= __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && (((main__t <= 1 && (((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && main__t == 0) || ((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= 0)) || ((((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && main__t == 0) || ((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= main__t)))) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 1 <= main__t - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0)) && main__t == 0) && 0 < main__tagbuf_len) || ((1 <= __VERIFIER_assert__cond && ((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0))) && !(main__tagbuf_len <= main__t)) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len RESULT: Ultimate proved your program to be correct! [2022-04-27 10:51:22,171 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...