/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:50:39,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:50:39,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:50:39,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:50:39,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:50:39,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:50:39,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:50:39,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:50:39,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:50:39,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:50:39,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:50:39,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:50:39,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:50:39,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:50:39,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:50:39,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:50:39,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:50:39,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:50:39,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:50:39,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:50:39,988 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:50:39,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:50:39,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:50:39,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:50:39,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:50:40,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:50:40,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:50:40,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:50:40,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:50:40,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:50:40,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:50:40,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:50:40,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:50:40,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:50:40,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:50:40,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:50:40,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:50:40,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:50:40,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:50:40,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:50:40,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:50:40,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:50:40,010 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:50:40,021 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:50:40,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:50:40,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:50:40,022 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:50:40,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:50:40,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:50:40,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:50:40,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:50:40,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:50:40,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:50:40,022 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:50:40,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:50:40,023 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:50:40,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:50:40,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:50:40,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:50:40,025 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:50:40,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:50:40,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:50:40,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:50:40,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:50:40,025 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:50:40,025 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:50:40,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:50:40,025 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:50:40,026 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 03:50:40,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:50:40,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:50:40,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:50:40,217 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:50:40,217 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:50:40,218 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2022-04-08 03:50:40,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca789f47f/2b5f0fc0d5f64e51a7921df686faeed1/FLAG0dd236b9d [2022-04-08 03:50:40,636 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:50:40,637 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2022-04-08 03:50:40,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca789f47f/2b5f0fc0d5f64e51a7921df686faeed1/FLAG0dd236b9d [2022-04-08 03:50:40,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca789f47f/2b5f0fc0d5f64e51a7921df686faeed1 [2022-04-08 03:50:40,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:50:40,666 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:50:40,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:50:40,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:50:40,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:50:40,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:50:40" (1/1) ... [2022-04-08 03:50:40,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78453599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:40, skipping insertion in model container [2022-04-08 03:50:40,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:50:40" (1/1) ... [2022-04-08 03:50:40,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:50:40,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:50:40,828 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/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2022-04-08 03:50:40,831 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/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2022-04-08 03:50:40,833 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/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2022-04-08 03:50:40,833 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/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2022-04-08 03:50:40,834 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/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2022-04-08 03:50:40,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2022-04-08 03:50:40,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2022-04-08 03:50:40,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2022-04-08 03:50:40,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2022-04-08 03:50:40,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2022-04-08 03:50:40,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2022-04-08 03:50:40,846 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/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2022-04-08 03:50:40,847 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/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2022-04-08 03:50:40,848 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/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2022-04-08 03:50:40,849 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/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2022-04-08 03:50:40,850 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/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2022-04-08 03:50:40,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:50:40,874 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:50:40,885 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/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2022-04-08 03:50:40,886 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/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2022-04-08 03:50:40,887 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/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2022-04-08 03:50:40,888 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/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2022-04-08 03:50:40,889 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/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2022-04-08 03:50:40,889 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/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2022-04-08 03:50:40,891 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/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2022-04-08 03:50:40,902 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/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2022-04-08 03:50:40,903 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/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2022-04-08 03:50:40,904 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/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2022-04-08 03:50:40,905 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/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2022-04-08 03:50:40,906 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/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2022-04-08 03:50:40,907 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/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2022-04-08 03:50:40,908 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/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2022-04-08 03:50:40,909 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/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2022-04-08 03:50:40,910 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/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2022-04-08 03:50:40,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:50:40,923 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:50:40,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:40 WrapperNode [2022-04-08 03:50:40,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:50:40,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:50:40,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:50:40,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:50:40,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:40" (1/1) ... [2022-04-08 03:50:40,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:40" (1/1) ... [2022-04-08 03:50:40,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:40" (1/1) ... [2022-04-08 03:50:40,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:40" (1/1) ... [2022-04-08 03:50:40,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:40" (1/1) ... [2022-04-08 03:50:40,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:40" (1/1) ... [2022-04-08 03:50:40,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:40" (1/1) ... [2022-04-08 03:50:40,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:50:40,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:50:40,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:50:40,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:50:40,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:40" (1/1) ... [2022-04-08 03:50:40,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:50:40,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:50:41,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 03:50:41,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 03:50:41,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:50:41,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:50:41,027 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:50:41,027 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 03:50:41,027 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:50:41,027 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:50:41,027 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:50:41,027 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:50:41,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:50:41,027 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 03:50:41,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:50:41,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:50:41,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:50:41,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:50:41,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:50:41,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:50:41,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:50:41,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:50:41,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:50:41,075 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:50:41,076 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:50:41,289 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:50:41,296 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:50:41,296 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-08 03:50:41,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:50:41 BoogieIcfgContainer [2022-04-08 03:50:41,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:50:41,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:50:41,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:50:41,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:50:41,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:50:40" (1/3) ... [2022-04-08 03:50:41,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9e827a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:50:41, skipping insertion in model container [2022-04-08 03:50:41,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:40" (2/3) ... [2022-04-08 03:50:41,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9e827a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:50:41, skipping insertion in model container [2022-04-08 03:50:41,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:50:41" (3/3) ... [2022-04-08 03:50:41,310 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2022-04-08 03:50:41,314 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:50:41,314 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-04-08 03:50:41,344 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:50:41,349 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 03:50:41,349 INFO L341 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-04-08 03:50:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 60 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:50:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 03:50:41,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:41,381 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:41,382 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:41,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:41,392 INFO L85 PathProgramCache]: Analyzing trace with hash -189701311, now seen corresponding path program 1 times [2022-04-08 03:50:41,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:41,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [891970221] [2022-04-08 03:50:41,407 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:41,408 INFO L85 PathProgramCache]: Analyzing trace with hash -189701311, now seen corresponding path program 2 times [2022-04-08 03:50:41,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:41,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166440850] [2022-04-08 03:50:41,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:41,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:41,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:41,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {74#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {68#true} is VALID [2022-04-08 03:50:41,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {68#true} assume true; {68#true} is VALID [2022-04-08 03:50:41,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68#true} {68#true} #149#return; {68#true} is VALID [2022-04-08 03:50:41,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {74#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:41,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {74#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {68#true} is VALID [2022-04-08 03:50:41,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2022-04-08 03:50:41,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #149#return; {68#true} is VALID [2022-04-08 03:50:41,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {68#true} call #t~ret7 := main(); {68#true} is VALID [2022-04-08 03:50:41,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {68#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {68#true} is VALID [2022-04-08 03:50:41,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {68#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {68#true} is VALID [2022-04-08 03:50:41,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {68#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {68#true} is VALID [2022-04-08 03:50:41,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {68#true} assume ~main__i~0 < ~main__len~0; {68#true} is VALID [2022-04-08 03:50:41,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#true} assume ~main__j~0 < ~main__limit~0; {68#true} is VALID [2022-04-08 03:50:41,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#true} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {73#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-08 03:50:41,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {73#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {69#false} is VALID [2022-04-08 03:50:41,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {69#false} assume !false; {69#false} is VALID [2022-04-08 03:50:41,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:41,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:41,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166440850] [2022-04-08 03:50:41,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166440850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:41,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:41,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:50:41,610 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:41,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [891970221] [2022-04-08 03:50:41,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [891970221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:41,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:41,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:50:41,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153303879] [2022-04-08 03:50:41,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:41,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 03:50:41,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:41,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:41,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:41,637 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:50:41,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:41,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:50:41,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:50:41,658 INFO L87 Difference]: Start difference. First operand has 65 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 60 states have internal predecessors, (82), 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 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:41,938 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2022-04-08 03:50:41,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:50:41,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 03:50:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-04-08 03:50:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-04-08 03:50:41,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 118 transitions. [2022-04-08 03:50:42,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:42,078 INFO L225 Difference]: With dead ends: 90 [2022-04-08 03:50:42,080 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 03:50:42,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:50:42,084 INFO L913 BasicCegarLoop]: 89 mSDtfsCounter, 117 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:42,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 100 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:50:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 03:50:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2022-04-08 03:50:42,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:42,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 59 states, 41 states have (on average 1.4634146341463414) 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-08 03:50:42,112 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 59 states, 41 states have (on average 1.4634146341463414) 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-08 03:50:42,114 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 59 states, 41 states have (on average 1.4634146341463414) 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-08 03:50:42,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:42,119 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-08 03:50:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-04-08 03:50:42,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:42,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:42,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 41 states have (on average 1.4634146341463414) 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 76 states. [2022-04-08 03:50:42,122 INFO L87 Difference]: Start difference. First operand has 59 states, 41 states have (on average 1.4634146341463414) 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 76 states. [2022-04-08 03:50:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:42,128 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-08 03:50:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-04-08 03:50:42,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:42,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:42,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:42,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.4634146341463414) 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-08 03:50:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-08 03:50:42,140 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2022-04-08 03:50:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:42,141 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-08 03:50:42,141 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:42,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2022-04-08 03:50:42,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-08 03:50:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 03:50:42,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:42,199 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:42,199 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:50:42,199 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1582601500, now seen corresponding path program 1 times [2022-04-08 03:50:42,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:42,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [828488445] [2022-04-08 03:50:42,204 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:42,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1582601500, now seen corresponding path program 2 times [2022-04-08 03:50:42,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:42,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961385298] [2022-04-08 03:50:42,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:42,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:42,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:42,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {537#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {530#true} is VALID [2022-04-08 03:50:42,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#true} assume true; {530#true} is VALID [2022-04-08 03:50:42,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {530#true} {530#true} #149#return; {530#true} is VALID [2022-04-08 03:50:42,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {537#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:42,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {537#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {530#true} is VALID [2022-04-08 03:50:42,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {530#true} assume true; {530#true} is VALID [2022-04-08 03:50:42,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {530#true} {530#true} #149#return; {530#true} is VALID [2022-04-08 03:50:42,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {530#true} call #t~ret7 := main(); {530#true} is VALID [2022-04-08 03:50:42,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {530#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {530#true} is VALID [2022-04-08 03:50:42,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {530#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {530#true} is VALID [2022-04-08 03:50:42,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {530#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {535#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-08 03:50:42,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {535#(not (<= main_~main__len~0 main_~main__i~0))} assume ~main__i~0 < ~main__len~0; {535#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-08 03:50:42,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {535#(not (<= main_~main__len~0 main_~main__i~0))} assume ~main__j~0 < ~main__limit~0; {535#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-08 03:50:42,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {535#(not (<= main_~main__len~0 main_~main__i~0))} assume !(1 + ~main__i~0 < ~main__len~0); {535#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-08 03:50:42,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {535#(not (<= main_~main__len~0 main_~main__i~0))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {536#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-08 03:50:42,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#(not (= main_~__VERIFIER_assert__cond~2 0))} assume 0 == ~__VERIFIER_assert__cond~2; {531#false} is VALID [2022-04-08 03:50:42,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#false} assume !false; {531#false} is VALID [2022-04-08 03:50:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:42,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:42,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961385298] [2022-04-08 03:50:42,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961385298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:42,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:42,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:50:42,300 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:42,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [828488445] [2022-04-08 03:50:42,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [828488445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:42,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:42,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:50:42,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883601405] [2022-04-08 03:50:42,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:42,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 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 14 [2022-04-08 03:50:42,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:42,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:42,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:42,314 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:50:42,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:42,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:50:42,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:50:42,315 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:42,669 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2022-04-08 03:50:42,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:50:42,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 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 14 [2022-04-08 03:50:42,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2022-04-08 03:50:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2022-04-08 03:50:42,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 168 transitions. [2022-04-08 03:50:42,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:42,805 INFO L225 Difference]: With dead ends: 153 [2022-04-08 03:50:42,805 INFO L226 Difference]: Without dead ends: 101 [2022-04-08 03:50:42,806 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:50:42,807 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 137 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:42,807 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 99 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:50:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-08 03:50:42,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2022-04-08 03:50:42,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:42,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:42,834 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:42,835 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:42,837 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-04-08 03:50:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2022-04-08 03:50:42,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:42,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:42,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 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 101 states. [2022-04-08 03:50:42,838 INFO L87 Difference]: Start difference. First operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 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 101 states. [2022-04-08 03:50:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:42,841 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-04-08 03:50:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2022-04-08 03:50:42,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:42,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:42,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:42,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-04-08 03:50:42,843 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2022-04-08 03:50:42,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:42,843 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-04-08 03:50:42,843 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:42,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 62 transitions. [2022-04-08 03:50:42,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-08 03:50:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 03:50:42,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:42,919 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:42,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:50:42,919 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:42,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:42,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1585770269, now seen corresponding path program 1 times [2022-04-08 03:50:42,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:42,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [910527848] [2022-04-08 03:50:42,920 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:42,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1585770269, now seen corresponding path program 2 times [2022-04-08 03:50:42,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:42,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399456248] [2022-04-08 03:50:42,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:42,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:42,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:42,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {1177#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {1170#true} is VALID [2022-04-08 03:50:42,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {1170#true} assume true; {1170#true} is VALID [2022-04-08 03:50:42,971 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1170#true} {1170#true} #149#return; {1170#true} is VALID [2022-04-08 03:50:42,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1177#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:42,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {1177#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {1170#true} is VALID [2022-04-08 03:50:42,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {1170#true} assume true; {1170#true} is VALID [2022-04-08 03:50:42,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1170#true} {1170#true} #149#return; {1170#true} is VALID [2022-04-08 03:50:42,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {1170#true} call #t~ret7 := main(); {1170#true} is VALID [2022-04-08 03:50:42,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {1170#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {1170#true} is VALID [2022-04-08 03:50:42,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {1170#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {1175#(<= 0 main_~main__i~0)} is VALID [2022-04-08 03:50:42,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {1175#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1175#(<= 0 main_~main__i~0)} is VALID [2022-04-08 03:50:42,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {1175#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0; {1175#(<= 0 main_~main__i~0)} is VALID [2022-04-08 03:50:42,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {1175#(<= 0 main_~main__i~0)} assume ~main__j~0 < ~main__limit~0; {1175#(<= 0 main_~main__i~0)} is VALID [2022-04-08 03:50:42,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {1175#(<= 0 main_~main__i~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1175#(<= 0 main_~main__i~0)} is VALID [2022-04-08 03:50:42,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {1175#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1176#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-08 03:50:42,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {1176#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {1171#false} is VALID [2022-04-08 03:50:42,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2022-04-08 03:50:42,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-08 03:50:42,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:42,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399456248] [2022-04-08 03:50:42,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399456248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:42,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:42,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:50:42,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:42,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [910527848] [2022-04-08 03:50:42,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [910527848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:42,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:42,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:50:42,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543358108] [2022-04-08 03:50:42,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:42,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 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 14 [2022-04-08 03:50:42,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:42,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:42,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:42,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:50:42,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:42,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:50:42,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:50:42,985 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:43,215 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-08 03:50:43,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:50:43,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 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 14 [2022-04-08 03:50:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-04-08 03:50:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-04-08 03:50:43,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2022-04-08 03:50:43,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:43,279 INFO L225 Difference]: With dead ends: 75 [2022-04-08 03:50:43,279 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 03:50:43,279 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:50:43,280 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 144 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:43,280 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 66 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:50:43,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 03:50:43,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2022-04-08 03:50:43,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:43,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,325 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,325 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:43,327 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-08 03:50:43,327 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-08 03:50:43,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:43,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:43,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-08 03:50:43,329 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-08 03:50:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:43,331 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-08 03:50:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-08 03:50:43,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:43,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:43,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:43,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-08 03:50:43,336 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2022-04-08 03:50:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:43,336 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-08 03:50:43,336 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2022-04-08 03:50:43,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-08 03:50:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 03:50:43,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:43,401 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:43,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 03:50:43,401 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:43,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:43,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1816003151, now seen corresponding path program 1 times [2022-04-08 03:50:43,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:43,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1077932480] [2022-04-08 03:50:43,403 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:43,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1816003151, now seen corresponding path program 2 times [2022-04-08 03:50:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:43,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013765728] [2022-04-08 03:50:43,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:43,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:43,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {1599#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {1592#true} is VALID [2022-04-08 03:50:43,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {1592#true} assume true; {1592#true} is VALID [2022-04-08 03:50:43,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1592#true} {1592#true} #149#return; {1592#true} is VALID [2022-04-08 03:50:43,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {1592#true} call ULTIMATE.init(); {1599#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:43,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {1599#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {1592#true} is VALID [2022-04-08 03:50:43,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {1592#true} assume true; {1592#true} is VALID [2022-04-08 03:50:43,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1592#true} {1592#true} #149#return; {1592#true} is VALID [2022-04-08 03:50:43,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {1592#true} call #t~ret7 := main(); {1592#true} is VALID [2022-04-08 03:50:43,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {1592#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {1592#true} is VALID [2022-04-08 03:50:43,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {1592#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {1597#(<= 0 main_~main__i~0)} is VALID [2022-04-08 03:50:43,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {1597#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1597#(<= 0 main_~main__i~0)} is VALID [2022-04-08 03:50:43,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {1597#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0; {1597#(<= 0 main_~main__i~0)} is VALID [2022-04-08 03:50:43,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {1597#(<= 0 main_~main__i~0)} assume ~main__j~0 < ~main__limit~0; {1597#(<= 0 main_~main__i~0)} is VALID [2022-04-08 03:50:43,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {1597#(<= 0 main_~main__i~0)} assume !(1 + ~main__i~0 < ~main__len~0); {1597#(<= 0 main_~main__i~0)} is VALID [2022-04-08 03:50:43,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {1597#(<= 0 main_~main__i~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1597#(<= 0 main_~main__i~0)} is VALID [2022-04-08 03:50:43,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {1597#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1598#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-08 03:50:43,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {1598#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {1593#false} is VALID [2022-04-08 03:50:43,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {1593#false} assume !false; {1593#false} is VALID [2022-04-08 03:50:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:43,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:43,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013765728] [2022-04-08 03:50:43,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013765728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:43,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:43,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:50:43,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:43,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1077932480] [2022-04-08 03:50:43,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1077932480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:43,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:43,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:50:43,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478961136] [2022-04-08 03:50:43,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:43,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 03:50:43,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:43,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:43,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:50:43,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:43,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:50:43,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:50:43,483 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:43,694 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-08 03:50:43,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:50:43,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 03:50:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-04-08 03:50:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-04-08 03:50:43,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 102 transitions. [2022-04-08 03:50:43,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:43,751 INFO L225 Difference]: With dead ends: 96 [2022-04-08 03:50:43,751 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 03:50:43,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:50:43,752 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 139 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:43,752 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 84 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:50:43,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 03:50:43,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2022-04-08 03:50:43,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:43,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,791 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,792 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:43,795 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-08 03:50:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-08 03:50:43,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:43,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:43,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-08 03:50:43,796 INFO L87 Difference]: Start difference. First operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-08 03:50:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:43,798 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-08 03:50:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-08 03:50:43,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:43,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:43,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:43,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-08 03:50:43,800 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2022-04-08 03:50:43,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:43,800 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-08 03:50:43,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 58 transitions. [2022-04-08 03:50:43,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-08 03:50:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 03:50:43,893 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:43,893 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:43,894 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 03:50:43,894 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:43,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash -461519734, now seen corresponding path program 1 times [2022-04-08 03:50:43,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:43,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1217828717] [2022-04-08 03:50:43,894 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:43,895 INFO L85 PathProgramCache]: Analyzing trace with hash -461519734, now seen corresponding path program 2 times [2022-04-08 03:50:43,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:43,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579385706] [2022-04-08 03:50:43,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:43,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:43,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:43,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {2102#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {2094#true} is VALID [2022-04-08 03:50:43,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {2094#true} assume true; {2094#true} is VALID [2022-04-08 03:50:43,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2094#true} {2094#true} #149#return; {2094#true} is VALID [2022-04-08 03:50:43,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {2094#true} call ULTIMATE.init(); {2102#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:43,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {2102#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {2094#true} is VALID [2022-04-08 03:50:43,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {2094#true} assume true; {2094#true} is VALID [2022-04-08 03:50:43,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2094#true} {2094#true} #149#return; {2094#true} is VALID [2022-04-08 03:50:43,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {2094#true} call #t~ret7 := main(); {2094#true} is VALID [2022-04-08 03:50:43,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {2094#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {2094#true} is VALID [2022-04-08 03:50:43,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {2094#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {2099#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:43,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {2099#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2099#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:43,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {2099#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {2099#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:43,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {2099#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:43,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(1 + ~main__i~0 < ~main__len~0); {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:43,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:43,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:43,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~3);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2101#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-08 03:50:43,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {2101#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {2095#false} is VALID [2022-04-08 03:50:43,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {2095#false} assume !false; {2095#false} is VALID [2022-04-08 03:50:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:43,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:43,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579385706] [2022-04-08 03:50:43,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579385706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:43,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:43,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:50:43,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:43,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1217828717] [2022-04-08 03:50:43,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1217828717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:43,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:43,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:50:43,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432194563] [2022-04-08 03:50:43,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:43,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 03:50:43,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:43,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:43,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:43,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:50:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:43,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:50:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:50:43,962 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:44,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:44,342 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-04-08 03:50:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:50:44,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 03:50:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-08 03:50:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-08 03:50:44,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-08 03:50:44,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:44,432 INFO L225 Difference]: With dead ends: 95 [2022-04-08 03:50:44,432 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 03:50:44,432 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:50:44,433 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 159 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:44,434 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 97 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:50:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 03:50:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2022-04-08 03:50:44,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:44,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:44,528 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:44,528 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:44,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:44,530 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-08 03:50:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-04-08 03:50:44,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:44,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:44,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-08 03:50:44,531 INFO L87 Difference]: Start difference. First operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-08 03:50:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:44,532 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-08 03:50:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-04-08 03:50:44,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:44,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:44,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:44,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:44,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-08 03:50:44,534 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2022-04-08 03:50:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:44,534 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-08 03:50:44,534 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:44,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-08 03:50:44,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-08 03:50:44,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 03:50:44,607 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:44,607 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:44,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 03:50:44,608 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:44,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:44,608 INFO L85 PathProgramCache]: Analyzing trace with hash 788286019, now seen corresponding path program 1 times [2022-04-08 03:50:44,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:44,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [759571088] [2022-04-08 03:50:44,608 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:44,608 INFO L85 PathProgramCache]: Analyzing trace with hash 788286019, now seen corresponding path program 2 times [2022-04-08 03:50:44,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:44,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809174034] [2022-04-08 03:50:44,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:44,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:44,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:44,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {2600#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {2593#true} is VALID [2022-04-08 03:50:44,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {2593#true} assume true; {2593#true} is VALID [2022-04-08 03:50:44,678 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2593#true} {2593#true} #149#return; {2593#true} is VALID [2022-04-08 03:50:44,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {2593#true} call ULTIMATE.init(); {2600#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:44,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {2600#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {2593#true} is VALID [2022-04-08 03:50:44,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {2593#true} assume true; {2593#true} is VALID [2022-04-08 03:50:44,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2593#true} {2593#true} #149#return; {2593#true} is VALID [2022-04-08 03:50:44,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {2593#true} call #t~ret7 := main(); {2593#true} is VALID [2022-04-08 03:50:44,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {2593#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {2593#true} is VALID [2022-04-08 03:50:44,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {2593#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {2593#true} is VALID [2022-04-08 03:50:44,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {2593#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2598#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-08 03:50:44,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {2598#(not (<= main_~main__len~0 main_~main__i~0))} assume ~main__i~0 < ~main__len~0; {2598#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-08 03:50:44,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {2598#(not (<= main_~main__len~0 main_~main__i~0))} assume ~main__j~0 < ~main__limit~0; {2598#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-08 03:50:44,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {2598#(not (<= main_~main__len~0 main_~main__i~0))} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2598#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-08 03:50:44,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {2598#(not (<= main_~main__len~0 main_~main__i~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2598#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-08 03:50:44,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {2598#(not (<= main_~main__len~0 main_~main__i~0))} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {2598#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-08 03:50:44,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {2598#(not (<= main_~main__len~0 main_~main__i~0))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {2599#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-08 03:50:44,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {2599#(not (= main_~__VERIFIER_assert__cond~6 0))} assume 0 == ~__VERIFIER_assert__cond~6; {2594#false} is VALID [2022-04-08 03:50:44,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {2594#false} assume !false; {2594#false} is VALID [2022-04-08 03:50:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:44,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:44,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809174034] [2022-04-08 03:50:44,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809174034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:44,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:44,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:50:44,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:44,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [759571088] [2022-04-08 03:50:44,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [759571088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:44,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:44,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:50:44,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029038304] [2022-04-08 03:50:44,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:44,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 03:50:44,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:44,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:44,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:44,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:50:44,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:44,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:50:44,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:50:44,707 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:44,971 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-04-08 03:50:44,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:50:44,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 03:50:44,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-04-08 03:50:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-04-08 03:50:44,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2022-04-08 03:50:45,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:45,115 INFO L225 Difference]: With dead ends: 69 [2022-04-08 03:50:45,115 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 03:50:45,116 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:50:45,116 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 109 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:45,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 66 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:50:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 03:50:45,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2022-04-08 03:50:45,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:45,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:45,185 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:45,185 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:45,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:45,186 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-08 03:50:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-08 03:50:45,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:45,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:45,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-08 03:50:45,187 INFO L87 Difference]: Start difference. First operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-08 03:50:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:45,188 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-08 03:50:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-08 03:50:45,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:45,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:45,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:45,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-08 03:50:45,190 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2022-04-08 03:50:45,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:45,190 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-08 03:50:45,190 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:45,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-08 03:50:45,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:45,261 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-08 03:50:45,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 03:50:45,262 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:45,262 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:45,262 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 03:50:45,263 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:45,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:45,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1422206761, now seen corresponding path program 1 times [2022-04-08 03:50:45,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:45,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [393943748] [2022-04-08 03:50:45,265 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:45,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1422206761, now seen corresponding path program 2 times [2022-04-08 03:50:45,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:45,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484062386] [2022-04-08 03:50:45,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:45,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:45,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:45,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {2988#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {2981#true} is VALID [2022-04-08 03:50:45,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {2981#true} assume true; {2981#true} is VALID [2022-04-08 03:50:45,348 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2981#true} {2981#true} #149#return; {2981#true} is VALID [2022-04-08 03:50:45,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {2981#true} call ULTIMATE.init(); {2988#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:45,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {2988#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {2981#true} is VALID [2022-04-08 03:50:45,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {2981#true} assume true; {2981#true} is VALID [2022-04-08 03:50:45,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2981#true} {2981#true} #149#return; {2981#true} is VALID [2022-04-08 03:50:45,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {2981#true} call #t~ret7 := main(); {2981#true} is VALID [2022-04-08 03:50:45,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {2981#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {2981#true} is VALID [2022-04-08 03:50:45,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {2981#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {2981#true} is VALID [2022-04-08 03:50:45,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {2981#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2986#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:45,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {2986#(<= 0 main_~main__j~0)} assume ~main__i~0 < ~main__len~0; {2986#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:45,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {2986#(<= 0 main_~main__j~0)} assume ~main__j~0 < ~main__limit~0; {2986#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:45,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {2986#(<= 0 main_~main__j~0)} assume !(1 + ~main__i~0 < ~main__len~0); {2986#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:45,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {2986#(<= 0 main_~main__j~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2986#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:45,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {2986#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2986#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:45,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {2986#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~3);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2986#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:45,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {2986#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {2987#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-08 03:50:45,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {2987#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {2982#false} is VALID [2022-04-08 03:50:45,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {2982#false} assume !false; {2982#false} is VALID [2022-04-08 03:50:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:45,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:45,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484062386] [2022-04-08 03:50:45,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484062386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:45,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:45,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:50:45,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:45,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [393943748] [2022-04-08 03:50:45,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [393943748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:45,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:45,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:50:45,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319367165] [2022-04-08 03:50:45,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:45,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 03:50:45,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:45,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:45,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:45,375 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:50:45,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:45,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:50:45,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:50:45,376 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:45,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:45,850 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-04-08 03:50:45,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:50:45,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 03:50:45,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:45,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:45,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-04-08 03:50:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-04-08 03:50:45,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 97 transitions. [2022-04-08 03:50:45,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:45,951 INFO L225 Difference]: With dead ends: 91 [2022-04-08 03:50:45,951 INFO L226 Difference]: Without dead ends: 89 [2022-04-08 03:50:45,951 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:50:45,952 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 116 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:45,952 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 81 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:50:45,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-08 03:50:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2022-04-08 03:50:46,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:46,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:46,058 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:46,059 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:46,060 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-08 03:50:46,060 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-08 03:50:46,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:46,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:46,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-08 03:50:46,061 INFO L87 Difference]: Start difference. First operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-08 03:50:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:46,062 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-08 03:50:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-08 03:50:46,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:46,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:46,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:46,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-04-08 03:50:46,064 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2022-04-08 03:50:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:46,064 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-04-08 03:50:46,064 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:46,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 52 transitions. [2022-04-08 03:50:46,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:46,277 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-08 03:50:46,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 03:50:46,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:46,277 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:46,277 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 03:50:46,277 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:46,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:46,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1332934067, now seen corresponding path program 1 times [2022-04-08 03:50:46,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:46,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1607569599] [2022-04-08 03:50:46,279 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:46,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1332934067, now seen corresponding path program 2 times [2022-04-08 03:50:46,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:46,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918801976] [2022-04-08 03:50:46,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:46,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:46,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:46,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {3459#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {3451#true} is VALID [2022-04-08 03:50:46,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-08 03:50:46,403 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3451#true} {3451#true} #149#return; {3451#true} is VALID [2022-04-08 03:50:46,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {3451#true} call ULTIMATE.init(); {3459#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:46,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {3459#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {3451#true} is VALID [2022-04-08 03:50:46,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-08 03:50:46,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3451#true} {3451#true} #149#return; {3451#true} is VALID [2022-04-08 03:50:46,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {3451#true} call #t~ret7 := main(); {3451#true} is VALID [2022-04-08 03:50:46,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {3451#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {3451#true} is VALID [2022-04-08 03:50:46,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {3451#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {3451#true} is VALID [2022-04-08 03:50:46,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {3451#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3451#true} is VALID [2022-04-08 03:50:46,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {3451#true} assume ~main__i~0 < ~main__len~0; {3451#true} is VALID [2022-04-08 03:50:46,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {3451#true} assume ~main__j~0 < ~main__limit~0; {3451#true} is VALID [2022-04-08 03:50:46,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {3451#true} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3451#true} is VALID [2022-04-08 03:50:46,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {3451#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3456#(or (and (not (<= 0 main_~main__i~0)) (= main_~__VERIFIER_assert__cond~1 0)) (and (= main_~__VERIFIER_assert__cond~1 1) (<= 0 main_~main__i~0)))} is VALID [2022-04-08 03:50:46,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {3456#(or (and (not (<= 0 main_~main__i~0)) (= main_~__VERIFIER_assert__cond~1 0)) (and (= main_~__VERIFIER_assert__cond~1 1) (<= 0 main_~main__i~0)))} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {3457#(<= 0 main_~main__i~0)} is VALID [2022-04-08 03:50:46,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {3457#(<= 0 main_~main__i~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3457#(<= 0 main_~main__i~0)} is VALID [2022-04-08 03:50:46,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {3457#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3458#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-08 03:50:46,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {3458#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {3452#false} is VALID [2022-04-08 03:50:46,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {3452#false} assume !false; {3452#false} is VALID [2022-04-08 03:50:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:46,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:46,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918801976] [2022-04-08 03:50:46,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918801976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:46,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:46,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:50:46,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:46,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1607569599] [2022-04-08 03:50:46,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1607569599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:46,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:46,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:50:46,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405659674] [2022-04-08 03:50:46,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:46,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 03:50:46,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:46,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:46,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:46,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:50:46,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:46,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:50:46,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:50:46,419 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:46,916 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-04-08 03:50:46,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:50:46,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 03:50:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-04-08 03:50:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-04-08 03:50:46,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2022-04-08 03:50:47,030 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-08 03:50:47,039 INFO L225 Difference]: With dead ends: 73 [2022-04-08 03:50:47,040 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 03:50:47,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 03:50:47,040 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 153 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:47,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 59 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:50:47,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 03:50:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2022-04-08 03:50:47,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:47,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 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-08 03:50:47,143 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 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-08 03:50:47,144 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 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-08 03:50:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:47,160 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2022-04-08 03:50:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-04-08 03:50:47,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:47,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:47,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 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 71 states. [2022-04-08 03:50:47,161 INFO L87 Difference]: Start difference. First operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 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 71 states. [2022-04-08 03:50:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:47,162 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2022-04-08 03:50:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-04-08 03:50:47,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:47,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:47,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:47,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 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-08 03:50:47,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-08 03:50:47,163 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2022-04-08 03:50:47,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:47,164 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-08 03:50:47,164 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:47,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 50 transitions. [2022-04-08 03:50:47,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-08 03:50:47,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 03:50:47,242 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:47,242 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:47,242 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 03:50:47,242 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:47,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:47,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1628720009, now seen corresponding path program 1 times [2022-04-08 03:50:47,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:47,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1885184081] [2022-04-08 03:50:47,244 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:47,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1628720009, now seen corresponding path program 2 times [2022-04-08 03:50:47,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:47,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514658831] [2022-04-08 03:50:47,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:47,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:47,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {3859#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {3851#true} is VALID [2022-04-08 03:50:47,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-08 03:50:47,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3851#true} {3851#true} #149#return; {3851#true} is VALID [2022-04-08 03:50:47,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {3851#true} call ULTIMATE.init(); {3859#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:47,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {3859#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {3851#true} is VALID [2022-04-08 03:50:47,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-08 03:50:47,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3851#true} {3851#true} #149#return; {3851#true} is VALID [2022-04-08 03:50:47,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {3851#true} call #t~ret7 := main(); {3851#true} is VALID [2022-04-08 03:50:47,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {3851#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {3851#true} is VALID [2022-04-08 03:50:47,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {3851#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {3856#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:47,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {3856#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3856#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:47,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {3856#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {3856#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:47,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {3856#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:47,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:47,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:47,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:47,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:47,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:47,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {3858#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-08 03:50:47,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {3858#(not (= main_~__VERIFIER_assert__cond~8 0))} assume 0 == ~__VERIFIER_assert__cond~8; {3852#false} is VALID [2022-04-08 03:50:47,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {3852#false} assume !false; {3852#false} is VALID [2022-04-08 03:50:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:47,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:47,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514658831] [2022-04-08 03:50:47,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514658831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:47,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:47,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:50:47,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:47,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1885184081] [2022-04-08 03:50:47,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1885184081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:47,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:47,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:50:47,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070725459] [2022-04-08 03:50:47,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:47,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 03:50:47,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:47,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:47,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:47,386 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:50:47,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:47,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:50:47,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:50:47,387 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:47,691 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-08 03:50:47,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:50:47,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 03:50:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-08 03:50:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-08 03:50:47,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-08 03:50:47,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:47,756 INFO L225 Difference]: With dead ends: 61 [2022-04-08 03:50:47,756 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 03:50:47,757 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:50:47,757 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 123 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:47,757 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 66 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:50:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 03:50:47,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2022-04-08 03:50:47,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:47,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:47,823 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:47,823 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:47,824 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-08 03:50:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-08 03:50:47,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:47,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:47,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 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 59 states. [2022-04-08 03:50:47,825 INFO L87 Difference]: Start difference. First operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 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 59 states. [2022-04-08 03:50:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:47,826 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-08 03:50:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-08 03:50:47,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:47,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:47,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:47,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:47,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-08 03:50:47,827 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2022-04-08 03:50:47,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:47,827 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-08 03:50:47,827 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:47,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 48 transitions. [2022-04-08 03:50:47,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-08 03:50:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 03:50:47,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:47,904 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:47,904 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 03:50:47,905 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:47,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:47,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1049284141, now seen corresponding path program 1 times [2022-04-08 03:50:47,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:47,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1500691857] [2022-04-08 03:50:47,905 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:47,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1049284141, now seen corresponding path program 2 times [2022-04-08 03:50:47,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:47,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290538031] [2022-04-08 03:50:47,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:47,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:47,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:47,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {4205#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {4198#true} is VALID [2022-04-08 03:50:47,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {4198#true} assume true; {4198#true} is VALID [2022-04-08 03:50:47,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4198#true} {4198#true} #149#return; {4198#true} is VALID [2022-04-08 03:50:47,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {4198#true} call ULTIMATE.init(); {4205#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:47,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {4205#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {4198#true} is VALID [2022-04-08 03:50:47,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {4198#true} assume true; {4198#true} is VALID [2022-04-08 03:50:47,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4198#true} {4198#true} #149#return; {4198#true} is VALID [2022-04-08 03:50:47,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {4198#true} call #t~ret7 := main(); {4198#true} is VALID [2022-04-08 03:50:47,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {4198#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {4198#true} is VALID [2022-04-08 03:50:47,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {4198#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {4198#true} is VALID [2022-04-08 03:50:47,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {4198#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:47,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {4203#(<= 0 main_~main__j~0)} assume ~main__i~0 < ~main__len~0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:47,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {4203#(<= 0 main_~main__j~0)} assume ~main__j~0 < ~main__limit~0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:47,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {4203#(<= 0 main_~main__j~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:47,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {4203#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:47,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {4203#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:47,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {4203#(<= 0 main_~main__j~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:47,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {4203#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:47,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {4203#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-08 03:50:47,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {4203#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4204#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-08 03:50:47,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {4204#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {4199#false} is VALID [2022-04-08 03:50:47,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {4199#false} assume !false; {4199#false} is VALID [2022-04-08 03:50:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:47,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:47,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290538031] [2022-04-08 03:50:47,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290538031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:47,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:47,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:50:47,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:47,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1500691857] [2022-04-08 03:50:47,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1500691857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:47,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:47,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:50:47,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190668015] [2022-04-08 03:50:47,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:47,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 03:50:47,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:47,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:47,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:47,958 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:50:47,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:47,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:50:47,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:50:47,959 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:48,170 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-08 03:50:48,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:50:48,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 03:50:48,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 03:50:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 03:50:48,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 03:50:48,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:48,231 INFO L225 Difference]: With dead ends: 61 [2022-04-08 03:50:48,231 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 03:50:48,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:50:48,232 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 94 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:48,233 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 57 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:50:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 03:50:48,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2022-04-08 03:50:48,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:48,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:48,293 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:48,294 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:48,295 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-08 03:50:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-08 03:50:48,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:48,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:48,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 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 59 states. [2022-04-08 03:50:48,296 INFO L87 Difference]: Start difference. First operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 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 59 states. [2022-04-08 03:50:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:48,297 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-08 03:50:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-08 03:50:48,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:48,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:48,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:48,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-08 03:50:48,298 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2022-04-08 03:50:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:48,298 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-08 03:50:48,298 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:48,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 46 transitions. [2022-04-08 03:50:48,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-08 03:50:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 03:50:48,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:48,378 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:48,378 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 03:50:48,379 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:48,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:48,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1831933135, now seen corresponding path program 1 times [2022-04-08 03:50:48,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:48,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [122290888] [2022-04-08 03:50:48,380 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:48,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1831933135, now seen corresponding path program 2 times [2022-04-08 03:50:48,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:48,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228269946] [2022-04-08 03:50:48,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:48,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:48,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:48,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {4543#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {4536#true} is VALID [2022-04-08 03:50:48,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {4536#true} assume true; {4536#true} is VALID [2022-04-08 03:50:48,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4536#true} {4536#true} #149#return; {4536#true} is VALID [2022-04-08 03:50:48,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {4536#true} call ULTIMATE.init(); {4543#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:48,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {4543#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {4536#true} is VALID [2022-04-08 03:50:48,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {4536#true} assume true; {4536#true} is VALID [2022-04-08 03:50:48,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4536#true} {4536#true} #149#return; {4536#true} is VALID [2022-04-08 03:50:48,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {4536#true} call #t~ret7 := main(); {4536#true} is VALID [2022-04-08 03:50:48,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {4536#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {4536#true} is VALID [2022-04-08 03:50:48,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {4536#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {4536#true} is VALID [2022-04-08 03:50:48,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {4536#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4536#true} is VALID [2022-04-08 03:50:48,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {4536#true} assume ~main__i~0 < ~main__len~0; {4536#true} is VALID [2022-04-08 03:50:48,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {4536#true} assume ~main__j~0 < ~main__limit~0; {4536#true} is VALID [2022-04-08 03:50:48,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {4536#true} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-08 03:50:48,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-08 03:50:48,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-08 03:50:48,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-08 03:50:48,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-08 03:50:48,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-08 03:50:48,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-08 03:50:48,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4542#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-08 03:50:48,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {4542#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {4537#false} is VALID [2022-04-08 03:50:48,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {4537#false} assume !false; {4537#false} is VALID [2022-04-08 03:50:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:48,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:48,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228269946] [2022-04-08 03:50:48,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228269946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:48,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:48,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:50:48,444 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:48,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [122290888] [2022-04-08 03:50:48,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [122290888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:48,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:48,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:50:48,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056718148] [2022-04-08 03:50:48,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:48,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 03:50:48,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:48,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:48,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:48,457 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:50:48,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:48,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:50:48,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:50:48,457 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:48,755 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-04-08 03:50:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:50:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 03:50:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-08 03:50:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-08 03:50:48,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-08 03:50:48,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:48,916 INFO L225 Difference]: With dead ends: 69 [2022-04-08 03:50:48,916 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 03:50:48,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:50:48,916 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 77 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:48,917 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 70 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:50:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 03:50:48,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2022-04-08 03:50:48,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:48,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 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-08 03:50:48,991 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 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-08 03:50:48,991 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 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-08 03:50:48,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:48,992 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-08 03:50:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-08 03:50:48,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:48,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:48,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 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 67 states. [2022-04-08 03:50:48,992 INFO L87 Difference]: Start difference. First operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 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 67 states. [2022-04-08 03:50:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:48,993 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-08 03:50:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-08 03:50:48,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:48,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:48,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:48,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 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-08 03:50:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-08 03:50:48,994 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2022-04-08 03:50:48,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:48,994 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-08 03:50:48,994 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:48,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 44 transitions. [2022-04-08 03:50:49,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:49,160 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-08 03:50:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 03:50:49,160 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:49,160 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:49,160 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 03:50:49,161 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:49,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:49,161 INFO L85 PathProgramCache]: Analyzing trace with hash 955355481, now seen corresponding path program 1 times [2022-04-08 03:50:49,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:49,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [859648659] [2022-04-08 03:50:49,161 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:49,161 INFO L85 PathProgramCache]: Analyzing trace with hash 955355481, now seen corresponding path program 2 times [2022-04-08 03:50:49,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:49,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972213396] [2022-04-08 03:50:49,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:49,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:49,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:49,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {4913#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {4905#true} is VALID [2022-04-08 03:50:49,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {4905#true} assume true; {4905#true} is VALID [2022-04-08 03:50:49,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4905#true} {4905#true} #149#return; {4905#true} is VALID [2022-04-08 03:50:49,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {4905#true} call ULTIMATE.init(); {4913#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:49,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {4913#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {4905#true} is VALID [2022-04-08 03:50:49,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {4905#true} assume true; {4905#true} is VALID [2022-04-08 03:50:49,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4905#true} {4905#true} #149#return; {4905#true} is VALID [2022-04-08 03:50:49,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {4905#true} call #t~ret7 := main(); {4905#true} is VALID [2022-04-08 03:50:49,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {4905#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {4905#true} is VALID [2022-04-08 03:50:49,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {4905#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-08 03:50:49,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {4910#(= main_~main__i~0 0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-08 03:50:49,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {4910#(= main_~main__i~0 0)} assume ~main__i~0 < ~main__len~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-08 03:50:49,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {4910#(= main_~main__i~0 0)} assume ~main__j~0 < ~main__limit~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-08 03:50:49,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {4910#(= main_~main__i~0 0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-08 03:50:49,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {4910#(= main_~main__i~0 0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-08 03:50:49,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {4910#(= main_~main__i~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {4910#(= main_~main__i~0 0)} is VALID [2022-04-08 03:50:49,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {4910#(= main_~main__i~0 0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-08 03:50:49,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {4910#(= main_~main__i~0 0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-08 03:50:49,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {4910#(= main_~main__i~0 0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-08 03:50:49,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {4910#(= main_~main__i~0 0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-08 03:50:49,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {4910#(= main_~main__i~0 0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4911#(<= 1 main_~main__i~0)} is VALID [2022-04-08 03:50:49,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {4911#(<= 1 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {4912#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-08 03:50:49,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {4912#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {4906#false} is VALID [2022-04-08 03:50:49,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {4906#false} assume !false; {4906#false} is VALID [2022-04-08 03:50:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:49,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:49,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972213396] [2022-04-08 03:50:49,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972213396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:49,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:49,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:50:49,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:49,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [859648659] [2022-04-08 03:50:49,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [859648659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:49,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:49,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:50:49,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157998975] [2022-04-08 03:50:49,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:49,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 03:50:49,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:49,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:49,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:49,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:50:49,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:49,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:50:49,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:50:49,227 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:49,834 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-04-08 03:50:49,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:50:49,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 03:50:49,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-08 03:50:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-08 03:50:49,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2022-04-08 03:50:49,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:49,906 INFO L225 Difference]: With dead ends: 74 [2022-04-08 03:50:49,906 INFO L226 Difference]: Without dead ends: 72 [2022-04-08 03:50:49,906 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-08 03:50:49,906 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 118 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:49,907 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 59 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:50:49,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-08 03:50:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2022-04-08 03:50:49,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:49,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:49,986 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:49,987 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:49,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:49,988 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-08 03:50:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-04-08 03:50:49,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:49,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:49,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-08 03:50:49,999 INFO L87 Difference]: Start difference. First operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-08 03:50:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:50,009 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-08 03:50:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-04-08 03:50:50,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:50,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:50,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:50,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-08 03:50:50,011 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2022-04-08 03:50:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:50,011 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-08 03:50:50,011 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:50,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2022-04-08 03:50:50,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-08 03:50:50,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 03:50:50,222 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:50,222 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:50,222 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 03:50:50,222 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:50,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:50,222 INFO L85 PathProgramCache]: Analyzing trace with hash -448748011, now seen corresponding path program 1 times [2022-04-08 03:50:50,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:50,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2070312400] [2022-04-08 03:50:50,223 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:50,223 INFO L85 PathProgramCache]: Analyzing trace with hash -448748011, now seen corresponding path program 2 times [2022-04-08 03:50:50,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:50,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103185152] [2022-04-08 03:50:50,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:50,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:50,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:50,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {5299#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {5290#true} is VALID [2022-04-08 03:50:50,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {5290#true} assume true; {5290#true} is VALID [2022-04-08 03:50:50,348 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5290#true} {5290#true} #149#return; {5290#true} is VALID [2022-04-08 03:50:50,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {5290#true} call ULTIMATE.init(); {5299#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:50,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {5299#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {5290#true} is VALID [2022-04-08 03:50:50,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {5290#true} assume true; {5290#true} is VALID [2022-04-08 03:50:50,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5290#true} {5290#true} #149#return; {5290#true} is VALID [2022-04-08 03:50:50,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {5290#true} call #t~ret7 := main(); {5290#true} is VALID [2022-04-08 03:50:50,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {5290#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {5290#true} is VALID [2022-04-08 03:50:50,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {5290#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {5295#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:50,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {5295#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {5295#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:50,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {5295#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {5295#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:50,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {5295#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:50,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:50,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:50,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:50,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:50,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:50,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:50,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:50,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {5297#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:50,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {5297#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {5297#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:50,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {5297#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {5298#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-08 03:50:50,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {5298#(not (= main_~__VERIFIER_assert__cond~12 0))} assume 0 == ~__VERIFIER_assert__cond~12; {5291#false} is VALID [2022-04-08 03:50:50,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {5291#false} assume !false; {5291#false} is VALID [2022-04-08 03:50:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:50,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:50,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103185152] [2022-04-08 03:50:50,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103185152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:50,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:50,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:50:50,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:50,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2070312400] [2022-04-08 03:50:50,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2070312400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:50,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:50,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:50:50,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610801364] [2022-04-08 03:50:50,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:50,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 03:50:50,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:50,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:50,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:50,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:50:50,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:50,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:50:50,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:50:50,389 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:50,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:50,829 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-08 03:50:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:50:50,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 03:50:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-08 03:50:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-08 03:50:50,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2022-04-08 03:50:50,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:50,891 INFO L225 Difference]: With dead ends: 62 [2022-04-08 03:50:50,891 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 03:50:50,891 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:50:50,892 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 108 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:50,892 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 68 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:50:50,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 03:50:50,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2022-04-08 03:50:50,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:50,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:50,990 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:50,990 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:50,991 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 03:50:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 03:50:50,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:50,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:50,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 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-08 03:50:50,992 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 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-08 03:50:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:50,993 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 03:50:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 03:50:50,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:50,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:50,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:50,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-08 03:50:50,994 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2022-04-08 03:50:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:50,994 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-08 03:50:50,998 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:50,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 40 transitions. [2022-04-08 03:50:51,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-08 03:50:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 03:50:51,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:51,075 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:51,075 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 03:50:51,075 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:51,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:51,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1026283297, now seen corresponding path program 1 times [2022-04-08 03:50:51,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:51,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [947431815] [2022-04-08 03:50:51,079 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1026283297, now seen corresponding path program 2 times [2022-04-08 03:50:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:51,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946160510] [2022-04-08 03:50:51,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:51,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:51,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {5638#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {5630#true} is VALID [2022-04-08 03:50:51,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {5630#true} assume true; {5630#true} is VALID [2022-04-08 03:50:51,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5630#true} {5630#true} #149#return; {5630#true} is VALID [2022-04-08 03:50:51,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {5630#true} call ULTIMATE.init(); {5638#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:51,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {5638#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {5630#true} is VALID [2022-04-08 03:50:51,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {5630#true} assume true; {5630#true} is VALID [2022-04-08 03:50:51,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5630#true} {5630#true} #149#return; {5630#true} is VALID [2022-04-08 03:50:51,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {5630#true} call #t~ret7 := main(); {5630#true} is VALID [2022-04-08 03:50:51,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {5630#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {5630#true} is VALID [2022-04-08 03:50:51,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {5630#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {5630#true} is VALID [2022-04-08 03:50:51,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {5630#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:51,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {5635#(= main_~main__j~0 0)} assume ~main__i~0 < ~main__len~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:51,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {5635#(= main_~main__j~0 0)} assume ~main__j~0 < ~main__limit~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:51,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {5635#(= main_~main__j~0 0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:51,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {5635#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:51,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {5635#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {5635#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:51,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {5635#(= main_~main__j~0 0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:51,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {5635#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:51,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {5635#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:51,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {5635#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:51,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {5635#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {5636#(<= 1 main_~main__j~0)} is VALID [2022-04-08 03:50:51,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {5636#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {5636#(<= 1 main_~main__j~0)} is VALID [2022-04-08 03:50:51,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {5636#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {5636#(<= 1 main_~main__j~0)} is VALID [2022-04-08 03:50:51,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {5636#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {5637#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-08 03:50:51,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {5637#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {5631#false} is VALID [2022-04-08 03:50:51,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {5631#false} assume !false; {5631#false} is VALID [2022-04-08 03:50:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:51,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:51,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946160510] [2022-04-08 03:50:51,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946160510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:51,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:51,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:50:51,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:51,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [947431815] [2022-04-08 03:50:51,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [947431815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:51,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:51,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:50:51,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660161762] [2022-04-08 03:50:51,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:51,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 03:50:51,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:51,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:51,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:51,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:50:51,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:51,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:50:51,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:50:51,174 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:51,820 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-04-08 03:50:51,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:50:51,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 03:50:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-08 03:50:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-08 03:50:51,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-08 03:50:51,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:51,926 INFO L225 Difference]: With dead ends: 87 [2022-04-08 03:50:51,926 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 03:50:51,926 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:50:51,927 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 116 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:51,927 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 77 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:50:51,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 03:50:51,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2022-04-08 03:50:51,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:51,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:51,980 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:51,991 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:51,992 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-08 03:50:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-04-08 03:50:51,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:51,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:51,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 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 85 states. [2022-04-08 03:50:51,993 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 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 85 states. [2022-04-08 03:50:51,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:51,994 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-08 03:50:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-04-08 03:50:51,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:51,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:51,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:51,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-08 03:50:51,995 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2022-04-08 03:50:51,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:51,995 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-08 03:50:51,995 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:51,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-08 03:50:52,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:52,078 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 03:50:52,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 03:50:52,078 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:52,078 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:52,078 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 03:50:52,079 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:52,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:52,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1750007973, now seen corresponding path program 1 times [2022-04-08 03:50:52,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:52,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [344919874] [2022-04-08 03:50:52,079 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:52,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1750007973, now seen corresponding path program 2 times [2022-04-08 03:50:52,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:52,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645788635] [2022-04-08 03:50:52,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:52,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:52,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:52,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {6070#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {6061#true} is VALID [2022-04-08 03:50:52,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {6061#true} assume true; {6061#true} is VALID [2022-04-08 03:50:52,127 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6061#true} {6061#true} #149#return; {6061#true} is VALID [2022-04-08 03:50:52,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {6061#true} call ULTIMATE.init(); {6070#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:52,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {6070#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {6061#true} is VALID [2022-04-08 03:50:52,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {6061#true} assume true; {6061#true} is VALID [2022-04-08 03:50:52,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6061#true} {6061#true} #149#return; {6061#true} is VALID [2022-04-08 03:50:52,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {6061#true} call #t~ret7 := main(); {6061#true} is VALID [2022-04-08 03:50:52,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {6061#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {6061#true} is VALID [2022-04-08 03:50:52,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {6061#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {6066#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:52,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {6066#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {6066#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:52,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {6066#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {6066#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:52,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {6066#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:52,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:52,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:52,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:52,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:52,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:52,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:52,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:52,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:52,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:52,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:52,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-08 03:50:52,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~13);~main____CPAchecker_TMP_3~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_4~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {6069#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-08 03:50:52,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {6069#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {6062#false} is VALID [2022-04-08 03:50:52,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {6062#false} assume !false; {6062#false} is VALID [2022-04-08 03:50:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:52,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:52,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645788635] [2022-04-08 03:50:52,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645788635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:52,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:52,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:50:52,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:52,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [344919874] [2022-04-08 03:50:52,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [344919874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:52,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:52,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:50:52,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38467745] [2022-04-08 03:50:52,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:52,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 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 24 [2022-04-08 03:50:52,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:52,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:52,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:52,151 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:50:52,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:52,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:50:52,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:50:52,151 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:52,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:52,580 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 03:50:52,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:50:52,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 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 24 [2022-04-08 03:50:52,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:52,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-08 03:50:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-08 03:50:52,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2022-04-08 03:50:52,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:52,644 INFO L225 Difference]: With dead ends: 60 [2022-04-08 03:50:52,644 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 03:50:52,646 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:50:52,647 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 93 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:52,647 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 63 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:50:52,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 03:50:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2022-04-08 03:50:52,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:52,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:52,722 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:52,722 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:52,723 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-08 03:50:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-08 03:50:52,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:52,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:52,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 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 58 states. [2022-04-08 03:50:52,724 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 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 58 states. [2022-04-08 03:50:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:52,724 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-08 03:50:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-08 03:50:52,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:52,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:52,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:52,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-08 03:50:52,725 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2022-04-08 03:50:52,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:52,725 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-08 03:50:52,725 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:52,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-08 03:50:52,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:52,814 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-08 03:50:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 03:50:52,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:52,815 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:52,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 03:50:52,815 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:50:52,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:52,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1584330853, now seen corresponding path program 1 times [2022-04-08 03:50:52,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:52,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1397498791] [2022-04-08 03:50:52,815 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:52,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1584330853, now seen corresponding path program 2 times [2022-04-08 03:50:52,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:52,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293952089] [2022-04-08 03:50:52,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:52,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:52,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:52,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {6394#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {6385#true} is VALID [2022-04-08 03:50:52,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {6385#true} assume true; {6385#true} is VALID [2022-04-08 03:50:52,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6385#true} {6385#true} #149#return; {6385#true} is VALID [2022-04-08 03:50:52,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {6385#true} call ULTIMATE.init(); {6394#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:52,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {6394#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {6385#true} is VALID [2022-04-08 03:50:52,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {6385#true} assume true; {6385#true} is VALID [2022-04-08 03:50:52,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6385#true} {6385#true} #149#return; {6385#true} is VALID [2022-04-08 03:50:52,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {6385#true} call #t~ret7 := main(); {6385#true} is VALID [2022-04-08 03:50:52,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {6385#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {6385#true} is VALID [2022-04-08 03:50:52,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {6385#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {6385#true} is VALID [2022-04-08 03:50:52,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {6385#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:52,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {6390#(= main_~main__j~0 0)} assume ~main__i~0 < ~main__len~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:52,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {6390#(= main_~main__j~0 0)} assume ~main__j~0 < ~main__limit~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:52,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {6390#(= main_~main__j~0 0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:52,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {6390#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:52,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {6390#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {6390#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:52,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {6390#(= main_~main__j~0 0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:52,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {6390#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:52,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {6390#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:52,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {6390#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-08 03:50:52,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {6390#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6391#(<= 1 main_~main__j~0)} is VALID [2022-04-08 03:50:52,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {6391#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {6391#(<= 1 main_~main__j~0)} is VALID [2022-04-08 03:50:52,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {6391#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {6391#(<= 1 main_~main__j~0)} is VALID [2022-04-08 03:50:52,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {6391#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {6391#(<= 1 main_~main__j~0)} is VALID [2022-04-08 03:50:52,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {6391#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~13);~main____CPAchecker_TMP_3~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_4~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {6392#(<= 2 main_~main__j~0)} is VALID [2022-04-08 03:50:52,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {6392#(<= 2 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {6393#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-08 03:50:52,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {6393#(not (= main_~__VERIFIER_assert__cond~15 0))} assume 0 == ~__VERIFIER_assert__cond~15; {6386#false} is VALID [2022-04-08 03:50:52,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {6386#false} assume !false; {6386#false} is VALID [2022-04-08 03:50:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:52,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:52,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293952089] [2022-04-08 03:50:52,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293952089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:52,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:52,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:50:52,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:52,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1397498791] [2022-04-08 03:50:52,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1397498791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:52,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:52,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:50:52,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411703812] [2022-04-08 03:50:52,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:52,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 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 25 [2022-04-08 03:50:52,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:52,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:52,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:52,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:50:52,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:52,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:50:52,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:50:52,895 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:54,088 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2022-04-08 03:50:54,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:50:54,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 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 25 [2022-04-08 03:50:54,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-08 03:50:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-08 03:50:54,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2022-04-08 03:50:54,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:54,200 INFO L225 Difference]: With dead ends: 125 [2022-04-08 03:50:54,200 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 03:50:54,201 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:50:54,201 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 145 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:54,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 86 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:50:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 03:50:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 03:50:54,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:54,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:50:54,202 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:50:54,202 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:50:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:54,202 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:50:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:50:54,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:54,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:54,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 03:50:54,202 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 03:50:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:54,202 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:50:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:50:54,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:54,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:54,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:54,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:54,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:50:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 03:50:54,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-04-08 03:50:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:54,203 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 03:50:54,203 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:54,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 03:50:54,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:50:54,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:54,205 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-04-08 03:50:54,205 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-04-08 03:50:54,206 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-04-08 03:50:54,206 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-04-08 03:50:54,206 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-04-08 03:50:54,206 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-04-08 03:50:54,206 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-04-08 03:50:54,206 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-04-08 03:50:54,206 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-04-08 03:50:54,206 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-04-08 03:50:54,206 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-04-08 03:50:54,206 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-04-08 03:50:54,206 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-04-08 03:50:54,206 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-04-08 03:50:54,206 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-04-08 03:50:54,206 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-04-08 03:50:54,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 03:50:54,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 03:51:14,092 WARN L232 SmtUtils]: Spent 19.88s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 03:51:33,694 WARN L232 SmtUtils]: Spent 19.60s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 03:52:31,291 WARN L232 SmtUtils]: Spent 56.97s on a formula simplification that was a NOOP. DAG size: 138 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 03:58:40,461 WARN L232 SmtUtils]: Spent 6.15m on a formula simplification that was a NOOP. DAG size: 143 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 03:58:51,978 WARN L232 SmtUtils]: Spent 10.08s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 03:59:23,960 WARN L232 SmtUtils]: Spent 30.50s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 03:59:29,081 WARN L232 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 04:00:27,346 WARN L232 SmtUtils]: Spent 55.67s on a formula simplification that was a NOOP. DAG size: 139 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 04:02:01,862 WARN L232 SmtUtils]: Spent 1.56m on a formula simplification that was a NOOP. DAG size: 140 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 04:05:08,492 WARN L232 SmtUtils]: Spent 3.11m on a formula simplification that was a NOOP. DAG size: 144 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)