/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 19:13:33,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 19:13:33,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 19:13:33,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 19:13:33,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 19:13:33,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 19:13:33,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 19:13:33,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 19:13:33,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 19:13:33,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 19:13:33,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 19:13:33,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 19:13:33,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 19:13:33,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 19:13:33,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 19:13:33,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 19:13:33,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 19:13:33,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 19:13:33,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 19:13:33,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 19:13:33,797 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 19:13:33,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 19:13:33,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 19:13:33,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 19:13:33,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 19:13:33,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 19:13:33,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 19:13:33,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 19:13:33,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 19:13:33,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 19:13:33,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 19:13:33,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 19:13:33,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 19:13:33,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 19:13:33,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 19:13:33,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 19:13:33,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 19:13:33,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 19:13:33,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 19:13:33,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 19:13:33,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 19:13:33,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 19:13:33,813 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 19:13:33,826 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 19:13:33,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 19:13:33,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 19:13:33,827 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 19:13:33,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 19:13:33,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 19:13:33,827 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 19:13:33,827 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 19:13:33,827 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 19:13:33,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 19:13:33,828 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 19:13:33,828 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 19:13:33,828 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 19:13:33,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 19:13:33,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 19:13:33,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 19:13:33,829 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 19:13:33,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 19:13:33,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:13:33,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 19:13:33,829 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 19:13:33,830 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 19:13:33,830 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-14 19:13:34,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 19:13:34,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 19:13:34,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 19:13:34,068 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 19:13:34,068 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 19:13:34,069 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-14 19:13:34,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/368eb1992/8e4a6bf6bb2542a79a6a09583113b849/FLAGc26f5490a [2022-04-14 19:13:34,513 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 19:13:34,514 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2022-04-14 19:13:34,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/368eb1992/8e4a6bf6bb2542a79a6a09583113b849/FLAGc26f5490a [2022-04-14 19:13:34,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/368eb1992/8e4a6bf6bb2542a79a6a09583113b849 [2022-04-14 19:13:34,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 19:13:34,547 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 19:13:34,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 19:13:34,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 19:13:34,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 19:13:34,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:13:34" (1/1) ... [2022-04-14 19:13:34,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487803b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:13:34, skipping insertion in model container [2022-04-14 19:13:34,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:13:34" (1/1) ... [2022-04-14 19:13:34,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 19:13:34,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 19:13:34,748 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-14 19:13:34,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2022-04-14 19:13:34,761 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2022-04-14 19:13:34,763 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2022-04-14 19:13:34,763 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2022-04-14 19:13:34,764 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-14 19:13:34,766 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2022-04-14 19:13:34,767 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2022-04-14 19:13:34,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2022-04-14 19:13:34,769 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2022-04-14 19:13:34,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2022-04-14 19:13:34,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2022-04-14 19:13:34,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2022-04-14 19:13:34,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2022-04-14 19:13:34,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2022-04-14 19:13:34,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2022-04-14 19:13:34,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:13:34,784 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 19:13:34,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2022-04-14 19:13:34,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2022-04-14 19:13:34,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2022-04-14 19:13:34,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2022-04-14 19:13:34,813 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-14 19:13:34,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2022-04-14 19:13:34,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2022-04-14 19:13:34,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2022-04-14 19:13:34,819 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-14 19:13:34,820 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-14 19:13:34,821 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-14 19:13:34,822 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-14 19:13:34,822 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-14 19:13:34,823 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-14 19:13:34,824 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-14 19:13:34,825 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-14 19:13:34,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:13:34,846 INFO L208 MainTranslator]: Completed translation [2022-04-14 19:13:34,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:13:34 WrapperNode [2022-04-14 19:13:34,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 19:13:34,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 19:13:34,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 19:13:34,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 19:13:34,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:13:34" (1/1) ... [2022-04-14 19:13:34,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:13:34" (1/1) ... [2022-04-14 19:13:34,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:13:34" (1/1) ... [2022-04-14 19:13:34,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:13:34" (1/1) ... [2022-04-14 19:13:34,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:13:34" (1/1) ... [2022-04-14 19:13:34,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:13:34" (1/1) ... [2022-04-14 19:13:34,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:13:34" (1/1) ... [2022-04-14 19:13:34,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 19:13:34,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 19:13:34,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 19:13:34,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 19:13:34,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:13:34" (1/1) ... [2022-04-14 19:13:34,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:13:34,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:13:34,916 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-14 19:13:34,919 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-14 19:13:34,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 19:13:34,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 19:13:34,945 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 19:13:34,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 19:13:34,945 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 19:13:34,945 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 19:13:34,945 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 19:13:34,945 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 19:13:34,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 19:13:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 19:13:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 19:13:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 19:13:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 19:13:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 19:13:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 19:13:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 19:13:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 19:13:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 19:13:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 19:13:35,005 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 19:13:35,006 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 19:13:35,241 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 19:13:35,246 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 19:13:35,246 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-14 19:13:35,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:13:35 BoogieIcfgContainer [2022-04-14 19:13:35,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 19:13:35,248 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 19:13:35,249 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 19:13:35,253 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 19:13:35,255 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:13:35" (1/1) ... [2022-04-14 19:13:35,257 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 19:13:35,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:13:35 BasicIcfg [2022-04-14 19:13:35,310 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 19:13:35,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 19:13:35,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 19:13:35,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 19:13:35,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 07:13:34" (1/4) ... [2022-04-14 19:13:35,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42677683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:13:35, skipping insertion in model container [2022-04-14 19:13:35,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:13:34" (2/4) ... [2022-04-14 19:13:35,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42677683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:13:35, skipping insertion in model container [2022-04-14 19:13:35,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:13:35" (3/4) ... [2022-04-14 19:13:35,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42677683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:13:35, skipping insertion in model container [2022-04-14 19:13:35,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:13:35" (4/4) ... [2022-04-14 19:13:35,317 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.cJordan [2022-04-14 19:13:35,321 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 19:13:35,321 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-04-14 19:13:35,356 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 19:13:35,362 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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-14 19:13:35,363 INFO L341 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-04-14 19:13:35,381 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-14 19:13:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-14 19:13:35,386 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:35,387 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:13:35,388 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-14 19:13:35,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:35,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2053356655, now seen corresponding path program 1 times [2022-04-14 19:13:35,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:35,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660286217] [2022-04-14 19:13:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:35,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:35,631 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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {68#true} is VALID [2022-04-14 19:13:35,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {68#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68#true} is VALID [2022-04-14 19:13:35,632 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68#true} {68#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68#true} is VALID [2022-04-14 19:13:35,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {68#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {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-14 19:13:35,635 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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {68#true} is VALID [2022-04-14 19:13:35,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {68#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68#true} is VALID [2022-04-14 19:13:35,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68#true} is VALID [2022-04-14 19:13:35,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {68#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68#true} is VALID [2022-04-14 19:13:35,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {68#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {68#true} is VALID [2022-04-14 19:13:35,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {68#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {68#true} is VALID [2022-04-14 19:13:35,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {68#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {68#true} is VALID [2022-04-14 19:13:35,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {68#true} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {68#true} is VALID [2022-04-14 19:13:35,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#true} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {68#true} is VALID [2022-04-14 19:13:35,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#true} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {73#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-14 19:13:35,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {73#(not (= main_~__VERIFIER_assert__cond~0 0))} [169] L45-->L47: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {69#false} is VALID [2022-04-14 19:13:35,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {69#false} [172] L47-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69#false} is VALID [2022-04-14 19:13:35,641 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-14 19:13:35,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:35,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660286217] [2022-04-14 19:13:35,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660286217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:35,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:35,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 19:13:35,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396023439] [2022-04-14 19:13:35,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:35,648 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-14 19:13:35,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:35,652 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-14 19:13:35,673 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-14 19:13:35,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 19:13:35,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:35,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 19:13:35,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 19:13:35,695 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-14 19:13:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:35,942 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-14 19:13:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 19:13:35,942 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-14 19:13:35,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:35,943 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-14 19:13:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-04-14 19:13:35,950 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-14 19:13:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-04-14 19:13:35,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 113 transitions. [2022-04-14 19:13:36,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:13:36,056 INFO L225 Difference]: With dead ends: 84 [2022-04-14 19:13:36,057 INFO L226 Difference]: Without dead ends: 76 [2022-04-14 19:13:36,058 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-14 19:13:36,062 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-14 19:13:36,068 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-14 19:13:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-14 19:13:36,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2022-04-14 19:13:36,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:36,098 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-14 19:13:36,099 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-14 19:13:36,101 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-14 19:13:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:36,107 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-14 19:13:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-04-14 19:13:36,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:36,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:36,109 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-14 19:13:36,110 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-14 19:13:36,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:36,120 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-14 19:13:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-04-14 19:13:36,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:36,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:36,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:36,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:36,121 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-14 19:13:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-14 19:13:36,127 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2022-04-14 19:13:36,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:36,127 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-14 19:13:36,128 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-14 19:13:36,128 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-14 19:13:36,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-14 19:13:36,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:36,128 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:13:36,129 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 19:13:36,129 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-14 19:13:36,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:36,131 INFO L85 PathProgramCache]: Analyzing trace with hash 770454336, now seen corresponding path program 1 times [2022-04-14 19:13:36,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:36,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67864891] [2022-04-14 19:13:36,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:36,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:36,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:36,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {382#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {375#true} is VALID [2022-04-14 19:13:36,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {375#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#true} is VALID [2022-04-14 19:13:36,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#true} is VALID [2022-04-14 19:13:36,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {375#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#(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-14 19:13:36,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {375#true} is VALID [2022-04-14 19:13:36,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {375#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#true} is VALID [2022-04-14 19:13:36,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {375#true} {375#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#true} is VALID [2022-04-14 19:13:36,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {375#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#true} is VALID [2022-04-14 19:13:36,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {375#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {375#true} is VALID [2022-04-14 19:13:36,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {380#(<= 0 main_~main__i~0)} is VALID [2022-04-14 19:13:36,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {380#(<= 0 main_~main__i~0)} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {380#(<= 0 main_~main__i~0)} is VALID [2022-04-14 19:13:36,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {380#(<= 0 main_~main__i~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {380#(<= 0 main_~main__i~0)} is VALID [2022-04-14 19:13:36,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {380#(<= 0 main_~main__i~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {380#(<= 0 main_~main__i~0)} is VALID [2022-04-14 19:13:36,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {380#(<= 0 main_~main__i~0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {380#(<= 0 main_~main__i~0)} is VALID [2022-04-14 19:13:36,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {380#(<= 0 main_~main__i~0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {381#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-14 19:13:36,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {381#(not (= main_~__VERIFIER_assert__cond~1 0))} [174] L57-->L59: Formula: (= v_main_~__VERIFIER_assert__cond~1_3 0) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} AuxVars[] AssignedVars[] {376#false} is VALID [2022-04-14 19:13:36,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {376#false} [178] L59-->mainErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376#false} is VALID [2022-04-14 19:13:36,235 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-14 19:13:36,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:36,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67864891] [2022-04-14 19:13:36,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67864891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:36,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:36,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 19:13:36,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999611365] [2022-04-14 19:13:36,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:36,237 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-14 19:13:36,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:36,237 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-14 19:13:36,248 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-14 19:13:36,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 19:13:36,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:36,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 19:13:36,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 19:13:36,249 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-14 19:13:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:36,416 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-14 19:13:36,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 19:13:36,417 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-14 19:13:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:36,417 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-14 19:13:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-04-14 19:13:36,421 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-14 19:13:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-04-14 19:13:36,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 83 transitions. [2022-04-14 19:13:36,511 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-14 19:13:36,516 INFO L225 Difference]: With dead ends: 75 [2022-04-14 19:13:36,516 INFO L226 Difference]: Without dead ends: 75 [2022-04-14 19:13:36,517 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-14 19:13:36,519 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 150 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 19:13:36,523 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 70 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 19:13:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-14 19:13:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2022-04-14 19:13:36,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:36,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:13:36,531 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:13:36,531 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:13:36,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:36,533 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-14 19:13:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-14 19:13:36,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:36,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:36,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-14 19:13:36,534 INFO L87 Difference]: Start difference. First operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-14 19:13:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:36,536 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-14 19:13:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-14 19:13:36,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:36,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:36,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:36,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:13:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-04-14 19:13:36,538 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 14 [2022-04-14 19:13:36,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:36,538 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-04-14 19:13:36,538 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-14 19:13:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-14 19:13:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-14 19:13:36,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:36,539 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:13:36,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 19:13:36,539 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-14 19:13:36,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:36,540 INFO L85 PathProgramCache]: Analyzing trace with hash 770485154, now seen corresponding path program 1 times [2022-04-14 19:13:36,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:36,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618405863] [2022-04-14 19:13:36,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:36,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:36,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:36,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {678#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {671#true} is VALID [2022-04-14 19:13:36,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {671#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-14 19:13:36,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {671#true} {671#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-14 19:13:36,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {671#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {678#(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-14 19:13:36,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {678#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {671#true} is VALID [2022-04-14 19:13:36,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {671#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-14 19:13:36,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {671#true} {671#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-14 19:13:36,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {671#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-14 19:13:36,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {671#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {671#true} is VALID [2022-04-14 19:13:36,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {671#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {671#true} is VALID [2022-04-14 19:13:36,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {671#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {676#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-14 19:13:36,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {676#(not (<= main_~main__len~0 main_~main__i~0))} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {676#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-14 19:13:36,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {676#(not (<= main_~main__len~0 main_~main__i~0))} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {676#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-14 19:13:36,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {676#(not (<= main_~main__len~0 main_~main__i~0))} [168] L38-->L293: Formula: (not (< (+ v_main_~main__i~0_1 1) v_main_~main__len~0_1)) InVars {main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} OutVars{main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[] {676#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-14 19:13:36,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {676#(not (<= main_~main__len~0 main_~main__i~0))} [171] L293-->L74: Formula: (and (= v_main_~__tmp_3~0_1 (ite (< v_main_~main__i~0_10 v_main_~main__len~0_9) 1 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__len~0=v_main_~main__len~0_9, main_~main__i~0=v_main_~main__i~0_10} OutVars{main_~main__len~0=v_main_~main__len~0_9, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__i~0=v_main_~main__i~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {677#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-14 19:13:36,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {677#(not (= main_~__VERIFIER_assert__cond~2 0))} [176] L74-->L76: Formula: (= v_main_~__VERIFIER_assert__cond~2_3 0) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_3} OutVars{main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_3} AuxVars[] AssignedVars[] {672#false} is VALID [2022-04-14 19:13:36,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {672#false} [182] L76-->mainErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#false} is VALID [2022-04-14 19:13:36,593 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-14 19:13:36,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:36,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618405863] [2022-04-14 19:13:36,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618405863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:36,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:36,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 19:13:36,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400291341] [2022-04-14 19:13:36,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:36,594 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-14 19:13:36,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:36,594 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-14 19:13:36,605 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-14 19:13:36,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 19:13:36,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:36,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 19:13:36,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 19:13:36,606 INFO L87 Difference]: Start difference. First operand 57 states and 61 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-14 19:13:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:36,848 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-04-14 19:13:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:13:36,848 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-14 19:13:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:36,849 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-14 19:13:36,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-04-14 19:13:36,850 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-14 19:13:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-04-14 19:13:36,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 108 transitions. [2022-04-14 19:13:36,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:13:36,939 INFO L225 Difference]: With dead ends: 97 [2022-04-14 19:13:36,939 INFO L226 Difference]: Without dead ends: 97 [2022-04-14 19:13:36,939 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-14 19:13:36,940 INFO L913 BasicCegarLoop]: 83 mSDtfsCounter, 131 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:13:36,940 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 95 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 19:13:36,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-14 19:13:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2022-04-14 19:13:36,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:36,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 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-14 19:13:36,943 INFO L74 IsIncluded]: Start isIncluded. First operand 97 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-14 19:13:36,943 INFO L87 Difference]: Start difference. First operand 97 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-14 19:13:36,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:36,946 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-04-14 19:13:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-04-14 19:13:36,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:36,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:36,947 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 97 states. [2022-04-14 19:13:36,947 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 97 states. [2022-04-14 19:13:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:36,949 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-04-14 19:13:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-04-14 19:13:36,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:36,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:36,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:36,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:36,950 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-14 19:13:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-14 19:13:36,952 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2022-04-14 19:13:36,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:36,952 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-14 19:13:36,952 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-14 19:13:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-14 19:13:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-14 19:13:36,953 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:36,953 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:13:36,953 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 19:13:36,953 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-14 19:13:36,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:36,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1884762791, now seen corresponding path program 1 times [2022-04-14 19:13:36,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:36,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168630149] [2022-04-14 19:13:36,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:36,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:37,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:37,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {1041#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {1034#true} is VALID [2022-04-14 19:13:37,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {1034#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#true} is VALID [2022-04-14 19:13:37,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1034#true} {1034#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#true} is VALID [2022-04-14 19:13:37,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {1034#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1041#(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-14 19:13:37,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {1041#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {1034#true} is VALID [2022-04-14 19:13:37,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {1034#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#true} is VALID [2022-04-14 19:13:37,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1034#true} {1034#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#true} is VALID [2022-04-14 19:13:37,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {1034#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#true} is VALID [2022-04-14 19:13:37,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {1034#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {1034#true} is VALID [2022-04-14 19:13:37,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {1034#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {1039#(<= 0 main_~main__i~0)} is VALID [2022-04-14 19:13:37,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {1039#(<= 0 main_~main__i~0)} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {1039#(<= 0 main_~main__i~0)} is VALID [2022-04-14 19:13:37,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {1039#(<= 0 main_~main__i~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {1039#(<= 0 main_~main__i~0)} is VALID [2022-04-14 19:13:37,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {1039#(<= 0 main_~main__i~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {1039#(<= 0 main_~main__i~0)} is VALID [2022-04-14 19:13:37,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {1039#(<= 0 main_~main__i~0)} [168] L38-->L293: Formula: (not (< (+ v_main_~main__i~0_1 1) v_main_~main__len~0_1)) InVars {main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} OutVars{main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[] {1039#(<= 0 main_~main__i~0)} is VALID [2022-04-14 19:13:37,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {1039#(<= 0 main_~main__i~0)} [171] L293-->L74: Formula: (and (= v_main_~__tmp_3~0_1 (ite (< v_main_~main__i~0_10 v_main_~main__len~0_9) 1 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__len~0=v_main_~main__len~0_9, main_~main__i~0=v_main_~main__i~0_10} OutVars{main_~main__len~0=v_main_~main__len~0_9, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__i~0=v_main_~main__i~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {1039#(<= 0 main_~main__i~0)} is VALID [2022-04-14 19:13:37,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {1039#(<= 0 main_~main__i~0)} [177] L74-->L86: Formula: (and (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__i~0_11) 1 0)) (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__i~0=v_main_~main__i~0_11} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__i~0=v_main_~main__i~0_11} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {1040#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-14 19:13:37,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {1040#(not (= main_~__VERIFIER_assert__cond~3 0))} [184] L86-->L88: Formula: (= v_main_~__VERIFIER_assert__cond~3_3 0) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_3} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_3} AuxVars[] AssignedVars[] {1035#false} is VALID [2022-04-14 19:13:37,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {1035#false} [188] L88-->mainErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1035#false} is VALID [2022-04-14 19:13:37,016 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-14 19:13:37,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:37,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168630149] [2022-04-14 19:13:37,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168630149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:37,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:37,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 19:13:37,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568316162] [2022-04-14 19:13:37,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:37,017 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-14 19:13:37,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:37,017 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-14 19:13:37,025 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-14 19:13:37,026 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 19:13:37,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:37,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 19:13:37,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 19:13:37,026 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-14 19:13:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:37,225 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-14 19:13:37,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 19:13:37,225 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-14 19:13:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:37,225 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-14 19:13:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-04-14 19:13:37,227 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-14 19:13:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-04-14 19:13:37,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 101 transitions. [2022-04-14 19:13:37,310 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-14 19:13:37,311 INFO L225 Difference]: With dead ends: 94 [2022-04-14 19:13:37,312 INFO L226 Difference]: Without dead ends: 94 [2022-04-14 19:13:37,312 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-14 19:13:37,312 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 139 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:13:37,313 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.1s Time] [2022-04-14 19:13:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-14 19:13:37,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2022-04-14 19:13:37,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:37,315 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-14 19:13:37,316 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-14 19:13:37,316 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-14 19:13:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:37,317 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-14 19:13:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-14 19:13:37,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:37,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:37,318 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-14 19:13:37,318 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-14 19:13:37,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:37,320 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-14 19:13:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-14 19:13:37,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:37,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:37,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:37,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:37,321 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-14 19:13:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-14 19:13:37,322 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2022-04-14 19:13:37,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:37,322 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-14 19:13:37,322 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-14 19:13:37,322 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-14 19:13:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-14 19:13:37,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:37,323 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:13:37,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 19:13:37,323 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-14 19:13:37,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:37,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1672280616, now seen corresponding path program 1 times [2022-04-14 19:13:37,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:37,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376189176] [2022-04-14 19:13:37,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:37,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:37,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:37,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {1391#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {1384#true} is VALID [2022-04-14 19:13:37,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {1384#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1384#true} is VALID [2022-04-14 19:13:37,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1384#true} {1384#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1384#true} is VALID [2022-04-14 19:13:37,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {1384#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1391#(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-14 19:13:37,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {1391#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {1384#true} is VALID [2022-04-14 19:13:37,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {1384#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1384#true} is VALID [2022-04-14 19:13:37,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1384#true} {1384#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1384#true} is VALID [2022-04-14 19:13:37,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {1384#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1384#true} is VALID [2022-04-14 19:13:37,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {1384#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {1384#true} is VALID [2022-04-14 19:13:37,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {1384#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {1384#true} is VALID [2022-04-14 19:13:37,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {1384#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {1389#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-14 19:13:37,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {1389#(not (<= main_~main__len~0 main_~main__i~0))} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {1389#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-14 19:13:37,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {1389#(not (<= main_~main__len~0 main_~main__i~0))} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {1389#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-14 19:13:37,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {1389#(not (<= main_~main__len~0 main_~main__i~0))} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {1389#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-14 19:13:37,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {1389#(not (<= main_~main__len~0 main_~main__i~0))} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {1389#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-14 19:13:37,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {1389#(not (<= main_~main__len~0 main_~main__i~0))} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {1389#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-14 19:13:37,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {1389#(not (<= main_~main__len~0 main_~main__i~0))} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {1390#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-14 19:13:37,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {1390#(not (= main_~__VERIFIER_assert__cond~6 0))} [186] L139-->L141: Formula: (= v_main_~__VERIFIER_assert__cond~6_3 0) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} OutVars{main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} AuxVars[] AssignedVars[] {1385#false} is VALID [2022-04-14 19:13:37,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {1385#false} [192] L141-->mainErr6ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1385#false} is VALID [2022-04-14 19:13:37,375 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-14 19:13:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:37,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376189176] [2022-04-14 19:13:37,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376189176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:37,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:37,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 19:13:37,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918511208] [2022-04-14 19:13:37,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:37,375 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-14 19:13:37,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:37,376 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-14 19:13:37,384 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-14 19:13:37,384 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 19:13:37,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:37,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 19:13:37,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 19:13:37,385 INFO L87 Difference]: Start difference. First operand 54 states and 58 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-14 19:13:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:37,539 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-04-14 19:13:37,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:13:37,539 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-14 19:13:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:37,540 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-14 19:13:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-14 19:13:37,541 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-14 19:13:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-14 19:13:37,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-14 19:13:37,605 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-14 19:13:37,607 INFO L225 Difference]: With dead ends: 71 [2022-04-14 19:13:37,607 INFO L226 Difference]: Without dead ends: 71 [2022-04-14 19:13:37,608 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-14 19:13:37,608 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 115 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 19:13:37,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 70 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 19:13:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-14 19:13:37,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2022-04-14 19:13:37,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:37,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 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-14 19:13:37,611 INFO L74 IsIncluded]: Start isIncluded. First operand 71 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-14 19:13:37,611 INFO L87 Difference]: Start difference. First operand 71 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-14 19:13:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:37,612 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-04-14 19:13:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-04-14 19:13:37,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:37,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:37,613 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 71 states. [2022-04-14 19:13:37,613 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 71 states. [2022-04-14 19:13:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:37,614 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-04-14 19:13:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-04-14 19:13:37,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:37,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:37,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:37,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:37,615 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-14 19:13:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-14 19:13:37,616 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2022-04-14 19:13:37,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:37,616 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-14 19:13:37,616 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-14 19:13:37,616 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-14 19:13:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-14 19:13:37,616 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:37,616 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:13:37,616 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-14 19:13:37,617 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-14 19:13:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:37,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1701896842, now seen corresponding path program 1 times [2022-04-14 19:13:37,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:37,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534264343] [2022-04-14 19:13:37,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:37,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:37,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:37,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {1673#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {1665#true} is VALID [2022-04-14 19:13:37,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1665#true} is VALID [2022-04-14 19:13:37,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1665#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1665#true} is VALID [2022-04-14 19:13:37,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {1665#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1673#(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-14 19:13:37,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {1673#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {1665#true} is VALID [2022-04-14 19:13:37,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {1665#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1665#true} is VALID [2022-04-14 19:13:37,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1665#true} {1665#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1665#true} is VALID [2022-04-14 19:13:37,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {1665#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1665#true} is VALID [2022-04-14 19:13:37,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {1665#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {1665#true} is VALID [2022-04-14 19:13:37,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {1665#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {1670#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:37,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {1670#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {1670#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:37,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {1670#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {1670#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:37,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {1670#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {1671#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:37,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {1671#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [168] L38-->L293: Formula: (not (< (+ v_main_~main__i~0_1 1) v_main_~main__len~0_1)) InVars {main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} OutVars{main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[] {1671#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:37,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {1671#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [171] L293-->L74: Formula: (and (= v_main_~__tmp_3~0_1 (ite (< v_main_~main__i~0_10 v_main_~main__len~0_9) 1 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__len~0=v_main_~main__len~0_9, main_~main__i~0=v_main_~main__i~0_10} OutVars{main_~main__len~0=v_main_~main__len~0_9, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__i~0=v_main_~main__i~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {1671#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:37,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {1671#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [177] L74-->L86: Formula: (and (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__i~0_11) 1 0)) (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__i~0=v_main_~main__i~0_11} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__i~0=v_main_~main__i~0_11} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {1671#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:37,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {1671#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [185] L86-->L98: Formula: (and (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1) (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__j~0_7 v_main_~main__bufsize~0_6) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~3_4 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_6, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~main__j~0=v_main_~main__j~0_7} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_6, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__j~0=v_main_~main__j~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {1672#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-14 19:13:37,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {1672#(not (= main_~__VERIFIER_assert__cond~4 0))} [190] L98-->L100: Formula: (= v_main_~__VERIFIER_assert__cond~4_3 0) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} OutVars{main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} AuxVars[] AssignedVars[] {1666#false} is VALID [2022-04-14 19:13:37,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {1666#false} [196] L100-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1666#false} is VALID [2022-04-14 19:13:37,671 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-14 19:13:37,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:37,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534264343] [2022-04-14 19:13:37,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534264343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:37,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:37,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 19:13:37,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395378518] [2022-04-14 19:13:37,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:37,671 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-14 19:13:37,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:37,672 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-14 19:13:37,681 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-14 19:13:37,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:13:37,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:37,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:13:37,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 19:13:37,682 INFO L87 Difference]: Start difference. First operand 52 states and 56 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-14 19:13:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:37,987 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-14 19:13:37,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 19:13:37,987 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-14 19:13:37,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:37,988 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-14 19:13:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-04-14 19:13:37,989 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-14 19:13:37,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-04-14 19:13:37,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 96 transitions. [2022-04-14 19:13:38,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:13:38,068 INFO L225 Difference]: With dead ends: 89 [2022-04-14 19:13:38,068 INFO L226 Difference]: Without dead ends: 89 [2022-04-14 19:13:38,068 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-04-14 19:13:38,069 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 151 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:13:38,069 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 93 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 19:13:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-14 19:13:38,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2022-04-14 19:13:38,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:38,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 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-14 19:13:38,071 INFO L74 IsIncluded]: Start isIncluded. First operand 89 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-14 19:13:38,072 INFO L87 Difference]: Start difference. First operand 89 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-14 19:13:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:38,073 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-14 19:13:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-14 19:13:38,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:38,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:38,073 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 89 states. [2022-04-14 19:13:38,074 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 89 states. [2022-04-14 19:13:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:38,075 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-14 19:13:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-14 19:13:38,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:38,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:38,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:38,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:38,076 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-14 19:13:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-14 19:13:38,076 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2022-04-14 19:13:38,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:38,077 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-14 19:13:38,077 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-14 19:13:38,077 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-14 19:13:38,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 19:13:38,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:38,077 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:13:38,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-14 19:13:38,077 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-14 19:13:38,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:38,078 INFO L85 PathProgramCache]: Analyzing trace with hash 301092767, now seen corresponding path program 1 times [2022-04-14 19:13:38,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:38,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203305523] [2022-04-14 19:13:38,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:38,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:38,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:38,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {2009#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {2001#true} is VALID [2022-04-14 19:13:38,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {2001#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2001#true} is VALID [2022-04-14 19:13:38,150 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2001#true} {2001#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2001#true} is VALID [2022-04-14 19:13:38,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {2001#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#(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-14 19:13:38,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {2009#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {2001#true} is VALID [2022-04-14 19:13:38,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {2001#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2001#true} is VALID [2022-04-14 19:13:38,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2001#true} {2001#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2001#true} is VALID [2022-04-14 19:13:38,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {2001#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2001#true} is VALID [2022-04-14 19:13:38,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {2001#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {2001#true} is VALID [2022-04-14 19:13:38,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {2001#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {2001#true} is VALID [2022-04-14 19:13:38,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {2001#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {2001#true} is VALID [2022-04-14 19:13:38,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {2001#true} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {2001#true} is VALID [2022-04-14 19:13:38,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {2001#true} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {2001#true} is VALID [2022-04-14 19:13:38,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {2001#true} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {2001#true} is VALID [2022-04-14 19:13:38,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {2001#true} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {2006#(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-14 19:13:38,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {2006#(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)))} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {2007#(<= 0 main_~main__i~0)} is VALID [2022-04-14 19:13:38,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {2007#(<= 0 main_~main__i~0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {2007#(<= 0 main_~main__i~0)} is VALID [2022-04-14 19:13:38,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {2007#(<= 0 main_~main__i~0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {2008#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-14 19:13:38,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {2008#(not (= main_~__VERIFIER_assert__cond~7 0))} [194] L151-->L153: Formula: (= v_main_~__VERIFIER_assert__cond~7_3 0) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_3} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_3} AuxVars[] AssignedVars[] {2002#false} is VALID [2022-04-14 19:13:38,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {2002#false} [200] L153-->mainErr7ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2002#false} is VALID [2022-04-14 19:13:38,156 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-14 19:13:38,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:38,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203305523] [2022-04-14 19:13:38,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203305523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:38,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:38,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 19:13:38,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107553244] [2022-04-14 19:13:38,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:38,157 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-14 19:13:38,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:38,157 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-14 19:13:38,167 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-14 19:13:38,167 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:13:38,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:38,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:13:38,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 19:13:38,168 INFO L87 Difference]: Start difference. First operand 50 states and 54 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-14 19:13:38,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:38,444 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-04-14 19:13:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:13:38,445 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-14 19:13:38,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:38,445 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-14 19:13:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-04-14 19:13:38,446 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-14 19:13:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-04-14 19:13:38,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 86 transitions. [2022-04-14 19:13:38,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:13:38,508 INFO L225 Difference]: With dead ends: 77 [2022-04-14 19:13:38,508 INFO L226 Difference]: Without dead ends: 77 [2022-04-14 19:13:38,508 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-14 19:13:38,508 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 161 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:13:38,509 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 65 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 19:13:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-14 19:13:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 48. [2022-04-14 19:13:38,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:38,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 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-14 19:13:38,511 INFO L74 IsIncluded]: Start isIncluded. First operand 77 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-14 19:13:38,511 INFO L87 Difference]: Start difference. First operand 77 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-14 19:13:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:38,512 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-04-14 19:13:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2022-04-14 19:13:38,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:38,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:38,513 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 77 states. [2022-04-14 19:13:38,513 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 77 states. [2022-04-14 19:13:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:38,514 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-04-14 19:13:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2022-04-14 19:13:38,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:38,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:38,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:38,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:38,515 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-14 19:13:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-04-14 19:13:38,515 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2022-04-14 19:13:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:38,516 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-04-14 19:13:38,516 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-14 19:13:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-14 19:13:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 19:13:38,516 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:38,516 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:13:38,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-14 19:13:38,516 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-14 19:13:38,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:38,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1219195777, now seen corresponding path program 1 times [2022-04-14 19:13:38,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:38,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991770731] [2022-04-14 19:13:38,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:38,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:38,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:38,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {2307#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {2300#true} is VALID [2022-04-14 19:13:38,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {2300#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2300#true} is VALID [2022-04-14 19:13:38,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2300#true} {2300#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2300#true} is VALID [2022-04-14 19:13:38,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {2300#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2307#(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-14 19:13:38,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {2307#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {2300#true} is VALID [2022-04-14 19:13:38,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {2300#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2300#true} is VALID [2022-04-14 19:13:38,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2300#true} {2300#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2300#true} is VALID [2022-04-14 19:13:38,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {2300#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2300#true} is VALID [2022-04-14 19:13:38,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {2300#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {2300#true} is VALID [2022-04-14 19:13:38,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {2300#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {2300#true} is VALID [2022-04-14 19:13:38,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {2300#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {2305#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:38,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {2305#(<= 0 main_~main__j~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {2305#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:38,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {2305#(<= 0 main_~main__j~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {2305#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:38,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {2305#(<= 0 main_~main__j~0)} [168] L38-->L293: Formula: (not (< (+ v_main_~main__i~0_1 1) v_main_~main__len~0_1)) InVars {main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} OutVars{main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[] {2305#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:38,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {2305#(<= 0 main_~main__j~0)} [171] L293-->L74: Formula: (and (= v_main_~__tmp_3~0_1 (ite (< v_main_~main__i~0_10 v_main_~main__len~0_9) 1 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__len~0=v_main_~main__len~0_9, main_~main__i~0=v_main_~main__i~0_10} OutVars{main_~main__len~0=v_main_~main__len~0_9, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__i~0=v_main_~main__i~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {2305#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:38,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {2305#(<= 0 main_~main__j~0)} [177] L74-->L86: Formula: (and (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__i~0_11) 1 0)) (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__i~0=v_main_~main__i~0_11} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__i~0=v_main_~main__i~0_11} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {2305#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:38,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {2305#(<= 0 main_~main__j~0)} [185] L86-->L98: Formula: (and (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1) (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__j~0_7 v_main_~main__bufsize~0_6) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~3_4 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_6, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~main__j~0=v_main_~main__j~0_7} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_6, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__j~0=v_main_~main__j~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {2305#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:38,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {2305#(<= 0 main_~main__j~0)} [191] L98-->L110: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1) (= (ite (<= 0 v_main_~main__j~0_8) 1 0) v_main_~__tmp_6~0_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__j~0=v_main_~main__j~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__j~0=v_main_~main__j~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {2306#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-14 19:13:38,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {2306#(not (= main_~__VERIFIER_assert__cond~5 0))} [198] L110-->L112: Formula: (= v_main_~__VERIFIER_assert__cond~5_3 0) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_3} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_3} AuxVars[] AssignedVars[] {2301#false} is VALID [2022-04-14 19:13:38,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {2301#false} [204] L112-->mainErr5ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2301#false} is VALID [2022-04-14 19:13:38,560 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-14 19:13:38,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:38,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991770731] [2022-04-14 19:13:38,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991770731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:38,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:38,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 19:13:38,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024236097] [2022-04-14 19:13:38,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:38,561 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-14 19:13:38,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:38,562 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-14 19:13:38,571 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-14 19:13:38,571 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 19:13:38,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:38,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 19:13:38,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 19:13:38,572 INFO L87 Difference]: Start difference. First operand 48 states and 52 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-14 19:13:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:38,751 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-04-14 19:13:38,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 19:13:38,752 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-14 19:13:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:38,752 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-14 19:13:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-04-14 19:13:38,753 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-14 19:13:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-04-14 19:13:38,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 92 transitions. [2022-04-14 19:13:38,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:13:38,819 INFO L225 Difference]: With dead ends: 85 [2022-04-14 19:13:38,819 INFO L226 Difference]: Without dead ends: 85 [2022-04-14 19:13:38,819 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-14 19:13:38,819 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 110 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:13:38,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 77 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 19:13:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-14 19:13:38,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2022-04-14 19:13:38,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:38,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 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-14 19:13:38,821 INFO L74 IsIncluded]: Start isIncluded. First operand 85 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-14 19:13:38,821 INFO L87 Difference]: Start difference. First operand 85 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-14 19:13:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:38,823 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-04-14 19:13:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-04-14 19:13:38,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:38,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:38,823 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 85 states. [2022-04-14 19:13:38,823 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 85 states. [2022-04-14 19:13:38,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:38,825 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-04-14 19:13:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-04-14 19:13:38,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:38,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:38,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:38,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:38,825 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-14 19:13:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-14 19:13:38,826 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2022-04-14 19:13:38,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:38,826 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-14 19:13:38,826 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-14 19:13:38,826 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-14 19:13:38,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 19:13:38,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:38,827 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-14 19:13:38,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-14 19:13:38,827 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-14 19:13:38,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:38,827 INFO L85 PathProgramCache]: Analyzing trace with hash 743942414, now seen corresponding path program 1 times [2022-04-14 19:13:38,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:38,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508840001] [2022-04-14 19:13:38,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:38,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:38,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:38,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {2623#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {2615#true} is VALID [2022-04-14 19:13:38,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {2615#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2615#true} is VALID [2022-04-14 19:13:38,877 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2615#true} {2615#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2615#true} is VALID [2022-04-14 19:13:38,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {2615#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2623#(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-14 19:13:38,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {2623#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {2615#true} is VALID [2022-04-14 19:13:38,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {2615#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2615#true} is VALID [2022-04-14 19:13:38,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2615#true} is VALID [2022-04-14 19:13:38,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {2615#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2615#true} is VALID [2022-04-14 19:13:38,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {2615#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {2615#true} is VALID [2022-04-14 19:13:38,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {2615#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {2620#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:38,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {2620#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {2620#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:38,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {2620#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {2620#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:38,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {2620#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:38,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:38,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:38,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:38,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:38,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:38,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {2622#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-14 19:13:38,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {2622#(not (= main_~__VERIFIER_assert__cond~8 0))} [202] L163-->L165: Formula: (= v_main_~__VERIFIER_assert__cond~8_3 0) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_3} OutVars{main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_3} AuxVars[] AssignedVars[] {2616#false} is VALID [2022-04-14 19:13:38,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {2616#false} [206] L165-->mainErr8ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2616#false} is VALID [2022-04-14 19:13:38,882 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-14 19:13:38,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:38,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508840001] [2022-04-14 19:13:38,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508840001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:38,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:38,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 19:13:38,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510597300] [2022-04-14 19:13:38,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:38,883 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-14 19:13:38,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:38,884 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-14 19:13:38,893 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-14 19:13:38,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:13:38,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:38,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:13:38,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 19:13:38,894 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-14 19:13:39,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:39,086 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-14 19:13:39,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 19:13:39,087 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-14 19:13:39,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:39,087 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-14 19:13:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-14 19:13:39,088 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-14 19:13:39,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-14 19:13:39,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2022-04-14 19:13:39,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:13:39,151 INFO L225 Difference]: With dead ends: 59 [2022-04-14 19:13:39,151 INFO L226 Difference]: Without dead ends: 59 [2022-04-14 19:13:39,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-04-14 19:13:39,151 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-14 19:13:39,152 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-14 19:13:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-14 19:13:39,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2022-04-14 19:13:39,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:39,153 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-14 19:13:39,153 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-14 19:13:39,154 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-14 19:13:39,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:39,155 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-14 19:13:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-14 19:13:39,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:39,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:39,155 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-14 19:13:39,155 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-14 19:13:39,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:39,156 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-14 19:13:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-14 19:13:39,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:39,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:39,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:39,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:39,157 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-14 19:13:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-14 19:13:39,157 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2022-04-14 19:13:39,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:39,158 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-14 19:13:39,158 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-14 19:13:39,158 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-14 19:13:39,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-14 19:13:39,158 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:39,158 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-14 19:13:39,158 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-14 19:13:39,158 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-14 19:13:39,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:39,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1587379587, now seen corresponding path program 1 times [2022-04-14 19:13:39,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:39,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763001498] [2022-04-14 19:13:39,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:39,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:39,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:39,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {2862#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {2855#true} is VALID [2022-04-14 19:13:39,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {2855#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2855#true} is VALID [2022-04-14 19:13:39,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2855#true} {2855#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2855#true} is VALID [2022-04-14 19:13:39,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {2855#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2862#(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-14 19:13:39,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {2862#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {2855#true} is VALID [2022-04-14 19:13:39,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {2855#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2855#true} is VALID [2022-04-14 19:13:39,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2855#true} {2855#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2855#true} is VALID [2022-04-14 19:13:39,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {2855#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2855#true} is VALID [2022-04-14 19:13:39,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {2855#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {2855#true} is VALID [2022-04-14 19:13:39,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {2855#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {2855#true} is VALID [2022-04-14 19:13:39,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {2855#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:39,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {2860#(<= 0 main_~main__j~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:39,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {2860#(<= 0 main_~main__j~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:39,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {2860#(<= 0 main_~main__j~0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:39,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {2860#(<= 0 main_~main__j~0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:39,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {2860#(<= 0 main_~main__j~0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:39,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {2860#(<= 0 main_~main__j~0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:39,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {2860#(<= 0 main_~main__j~0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:39,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {2860#(<= 0 main_~main__j~0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-14 19:13:39,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {2860#(<= 0 main_~main__j~0)} [203] L163-->L175: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__j~0_12) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {2861#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-14 19:13:39,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {2861#(not (= main_~__VERIFIER_assert__cond~9 0))} [208] L175-->L177: Formula: (= v_main_~__VERIFIER_assert__cond~9_3 0) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_3} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_3} AuxVars[] AssignedVars[] {2856#false} is VALID [2022-04-14 19:13:39,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {2856#false} [210] L177-->mainErr9ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2856#false} is VALID [2022-04-14 19:13:39,210 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-14 19:13:39,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:39,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763001498] [2022-04-14 19:13:39,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763001498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:39,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:39,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 19:13:39,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045533883] [2022-04-14 19:13:39,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:39,211 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-14 19:13:39,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:39,211 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-14 19:13:39,221 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-14 19:13:39,221 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 19:13:39,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:39,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 19:13:39,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 19:13:39,222 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-14 19:13:39,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:39,364 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-14 19:13:39,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 19:13:39,364 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-14 19:13:39,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:39,364 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-14 19:13:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-14 19:13:39,365 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-14 19:13:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-14 19:13:39,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-14 19:13:39,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:13:39,418 INFO L225 Difference]: With dead ends: 59 [2022-04-14 19:13:39,418 INFO L226 Difference]: Without dead ends: 59 [2022-04-14 19:13:39,418 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-14 19:13:39,418 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-14 19:13:39,419 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-14 19:13:39,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-14 19:13:39,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2022-04-14 19:13:39,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:39,420 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-14 19:13:39,420 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-14 19:13:39,421 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-14 19:13:39,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:39,423 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-14 19:13:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-14 19:13:39,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:39,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:39,424 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-14 19:13:39,424 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-14 19:13:39,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:39,425 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-14 19:13:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-14 19:13:39,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:39,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:39,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:39,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:39,425 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-14 19:13:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-14 19:13:39,426 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2022-04-14 19:13:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:39,426 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-14 19:13:39,426 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-14 19:13:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-14 19:13:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 19:13:39,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:39,426 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-14 19:13:39,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-14 19:13:39,427 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-14 19:13:39,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1964128178, now seen corresponding path program 1 times [2022-04-14 19:13:39,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:39,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345742238] [2022-04-14 19:13:39,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:39,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:39,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:39,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {3095#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3088#true} is VALID [2022-04-14 19:13:39,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {3088#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3088#true} is VALID [2022-04-14 19:13:39,470 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3088#true} {3088#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3088#true} is VALID [2022-04-14 19:13:39,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {3088#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3095#(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-14 19:13:39,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {3095#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3088#true} is VALID [2022-04-14 19:13:39,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {3088#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3088#true} is VALID [2022-04-14 19:13:39,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3088#true} {3088#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3088#true} is VALID [2022-04-14 19:13:39,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {3088#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3088#true} is VALID [2022-04-14 19:13:39,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {3088#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {3088#true} is VALID [2022-04-14 19:13:39,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {3088#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {3088#true} is VALID [2022-04-14 19:13:39,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {3088#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {3088#true} is VALID [2022-04-14 19:13:39,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {3088#true} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {3088#true} is VALID [2022-04-14 19:13:39,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {3088#true} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {3088#true} is VALID [2022-04-14 19:13:39,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {3088#true} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-14 19:13:39,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-14 19:13:39,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-14 19:13:39,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-14 19:13:39,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-14 19:13:39,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-14 19:13:39,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} [203] L163-->L175: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__j~0_12) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-14 19:13:39,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} [209] L175-->L191: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__i~0_17) (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (+ v_main_~main__i~0_17 1) v_main_~main__i~0_16) (= (ite (< v_main_~main__i~0_16 v_main_~main__len~0_11) 1 0) v_main_~__tmp_11~0_1) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__j~0_14) (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) (= (+ v_main_~main__j~0_14 1) v_main_~main__j~0_13)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main__j~0=v_main_~main__j~0_14, main_~main__i~0=v_main_~main__i~0_17} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__j~0=v_main_~main__j~0_13, main_~__tmp_11~0=v_main_~__tmp_11~0_1, main_~main__i~0=v_main_~main__i~0_16} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~__VERIFIER_assert__cond~10, main_~main____CPAchecker_TMP_1~0, main_~main__j~0, main_~__tmp_11~0, main_~main__i~0] {3094#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-14 19:13:39,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {3094#(not (= main_~__VERIFIER_assert__cond~10 0))} [212] L191-->L193: Formula: (= v_main_~__VERIFIER_assert__cond~10_3 0) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} OutVars{main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} AuxVars[] AssignedVars[] {3089#false} is VALID [2022-04-14 19:13:39,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {3089#false} [214] L193-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3089#false} is VALID [2022-04-14 19:13:39,475 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-14 19:13:39,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:39,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345742238] [2022-04-14 19:13:39,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345742238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:39,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:39,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 19:13:39,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391011419] [2022-04-14 19:13:39,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:39,476 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-14 19:13:39,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:39,476 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-14 19:13:39,487 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-14 19:13:39,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 19:13:39,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:39,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 19:13:39,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 19:13:39,488 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-14 19:13:39,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:39,664 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-14 19:13:39,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:13:39,664 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-14 19:13:39,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:39,664 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-14 19:13:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-14 19:13:39,665 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-14 19:13:39,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-14 19:13:39,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-14 19:13:39,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:13:39,720 INFO L225 Difference]: With dead ends: 67 [2022-04-14 19:13:39,720 INFO L226 Difference]: Without dead ends: 67 [2022-04-14 19:13:39,720 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-14 19:13:39,721 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-14 19:13:39,721 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-14 19:13:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-14 19:13:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2022-04-14 19:13:39,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:39,723 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-14 19:13:39,723 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-14 19:13:39,723 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-14 19:13:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:39,724 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-14 19:13:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-14 19:13:39,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:39,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:39,724 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-14 19:13:39,724 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-14 19:13:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:39,725 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-14 19:13:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-14 19:13:39,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:39,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:39,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:39,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:39,726 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-14 19:13:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-14 19:13:39,726 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2022-04-14 19:13:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:39,726 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-14 19:13:39,726 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-14 19:13:39,727 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-14 19:13:39,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 19:13:39,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:39,727 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-14 19:13:39,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-14 19:13:39,727 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-14 19:13:39,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:39,727 INFO L85 PathProgramCache]: Analyzing trace with hash 758432615, now seen corresponding path program 1 times [2022-04-14 19:13:39,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:39,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789699103] [2022-04-14 19:13:39,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:39,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:39,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:39,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {3354#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3346#true} is VALID [2022-04-14 19:13:39,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {3346#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3346#true} is VALID [2022-04-14 19:13:39,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3346#true} {3346#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3346#true} is VALID [2022-04-14 19:13:39,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {3346#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3354#(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-14 19:13:39,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {3354#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3346#true} is VALID [2022-04-14 19:13:39,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {3346#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3346#true} is VALID [2022-04-14 19:13:39,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3346#true} {3346#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3346#true} is VALID [2022-04-14 19:13:39,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {3346#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3346#true} is VALID [2022-04-14 19:13:39,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {3346#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {3346#true} is VALID [2022-04-14 19:13:39,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {3346#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {3351#(= main_~main__i~0 0)} is VALID [2022-04-14 19:13:39,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {3351#(= main_~main__i~0 0)} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {3351#(= main_~main__i~0 0)} is VALID [2022-04-14 19:13:39,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {3351#(= main_~main__i~0 0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {3351#(= main_~main__i~0 0)} is VALID [2022-04-14 19:13:39,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {3351#(= main_~main__i~0 0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {3351#(= main_~main__i~0 0)} is VALID [2022-04-14 19:13:39,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {3351#(= main_~main__i~0 0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {3351#(= main_~main__i~0 0)} is VALID [2022-04-14 19:13:39,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {3351#(= main_~main__i~0 0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3351#(= main_~main__i~0 0)} is VALID [2022-04-14 19:13:39,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {3351#(= main_~main__i~0 0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {3351#(= main_~main__i~0 0)} is VALID [2022-04-14 19:13:39,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {3351#(= main_~main__i~0 0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {3351#(= main_~main__i~0 0)} is VALID [2022-04-14 19:13:39,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {3351#(= main_~main__i~0 0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {3351#(= main_~main__i~0 0)} is VALID [2022-04-14 19:13:39,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {3351#(= main_~main__i~0 0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {3351#(= main_~main__i~0 0)} is VALID [2022-04-14 19:13:39,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {3351#(= main_~main__i~0 0)} [203] L163-->L175: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__j~0_12) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {3351#(= main_~main__i~0 0)} is VALID [2022-04-14 19:13:39,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {3351#(= main_~main__i~0 0)} [209] L175-->L191: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__i~0_17) (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (+ v_main_~main__i~0_17 1) v_main_~main__i~0_16) (= (ite (< v_main_~main__i~0_16 v_main_~main__len~0_11) 1 0) v_main_~__tmp_11~0_1) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__j~0_14) (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) (= (+ v_main_~main__j~0_14 1) v_main_~main__j~0_13)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main__j~0=v_main_~main__j~0_14, main_~main__i~0=v_main_~main__i~0_17} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__j~0=v_main_~main__j~0_13, main_~__tmp_11~0=v_main_~__tmp_11~0_1, main_~main__i~0=v_main_~main__i~0_16} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~__VERIFIER_assert__cond~10, main_~main____CPAchecker_TMP_1~0, main_~main__j~0, main_~__tmp_11~0, main_~main__i~0] {3352#(<= 1 main_~main__i~0)} is VALID [2022-04-14 19:13:39,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {3352#(<= 1 main_~main__i~0)} [213] L191-->L203: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__i~0_18) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {3353#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-14 19:13:39,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#(not (= main_~__VERIFIER_assert__cond~11 0))} [216] L203-->L205: Formula: (= v_main_~__VERIFIER_assert__cond~11_3 0) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} AuxVars[] AssignedVars[] {3347#false} is VALID [2022-04-14 19:13:39,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {3347#false} [218] L205-->mainErr11ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3347#false} is VALID [2022-04-14 19:13:39,783 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-14 19:13:39,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:39,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789699103] [2022-04-14 19:13:39,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789699103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:39,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:39,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 19:13:39,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701338988] [2022-04-14 19:13:39,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:39,783 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-14 19:13:39,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:39,784 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-14 19:13:39,795 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-14 19:13:39,795 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:13:39,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:39,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:13:39,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 19:13:39,796 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-14 19:13:40,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:40,063 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-14 19:13:40,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:13:40,064 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-14 19:13:40,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:40,064 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-14 19:13:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-14 19:13:40,065 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-14 19:13:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-14 19:13:40,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-14 19:13:40,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:13:40,149 INFO L225 Difference]: With dead ends: 72 [2022-04-14 19:13:40,149 INFO L226 Difference]: Without dead ends: 72 [2022-04-14 19:13:40,150 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-14 19:13:40,150 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-14 19:13:40,150 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-14 19:13:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-14 19:13:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2022-04-14 19:13:40,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:40,152 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-14 19:13:40,152 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-14 19:13:40,152 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-14 19:13:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:40,153 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-14 19:13:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-04-14 19:13:40,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:40,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:40,154 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-14 19:13:40,154 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-14 19:13:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:40,155 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-14 19:13:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-04-14 19:13:40,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:40,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:40,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:40,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:40,155 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-14 19:13:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-14 19:13:40,156 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2022-04-14 19:13:40,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:40,156 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-14 19:13:40,156 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-14 19:13:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-14 19:13:40,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 19:13:40,156 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:40,157 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-14 19:13:40,157 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-14 19:13:40,157 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-14 19:13:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2036575830, now seen corresponding path program 1 times [2022-04-14 19:13:40,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:40,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078043486] [2022-04-14 19:13:40,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:40,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:40,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:40,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {3626#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3617#true} is VALID [2022-04-14 19:13:40,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {3617#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3617#true} is VALID [2022-04-14 19:13:40,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3617#true} {3617#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3617#true} is VALID [2022-04-14 19:13:40,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {3617#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3626#(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-14 19:13:40,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {3626#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3617#true} is VALID [2022-04-14 19:13:40,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {3617#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3617#true} is VALID [2022-04-14 19:13:40,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3617#true} {3617#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3617#true} is VALID [2022-04-14 19:13:40,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {3617#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3617#true} is VALID [2022-04-14 19:13:40,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {3617#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {3617#true} is VALID [2022-04-14 19:13:40,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {3617#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {3622#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:40,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {3622#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {3622#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:40,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {3622#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {3622#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:40,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {3622#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:40,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:40,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:40,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:40,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:40,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:40,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:40,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [203] L163-->L175: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__j~0_12) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:40,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [209] L175-->L191: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__i~0_17) (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (+ v_main_~main__i~0_17 1) v_main_~main__i~0_16) (= (ite (< v_main_~main__i~0_16 v_main_~main__len~0_11) 1 0) v_main_~__tmp_11~0_1) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__j~0_14) (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) (= (+ v_main_~main__j~0_14 1) v_main_~main__j~0_13)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main__j~0=v_main_~main__j~0_14, main_~main__i~0=v_main_~main__i~0_17} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__j~0=v_main_~main__j~0_13, main_~__tmp_11~0=v_main_~__tmp_11~0_1, main_~main__i~0=v_main_~main__i~0_16} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~__VERIFIER_assert__cond~10, main_~main____CPAchecker_TMP_1~0, main_~main__j~0, main_~__tmp_11~0, main_~main__i~0] {3624#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:40,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {3624#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} [213] L191-->L203: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__i~0_18) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {3624#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:40,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {3624#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} [217] L203-->L215: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~__tmp_13~0_1 (ite (< v_main_~main__j~0_15 v_main_~main__bufsize~0_8) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~11_4 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main__j~0=v_main_~main__j~0_15} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main__j~0=v_main_~main__j~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {3625#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-14 19:13:40,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {3625#(not (= main_~__VERIFIER_assert__cond~12 0))} [220] L215-->L217: Formula: (= v_main_~__VERIFIER_assert__cond~12_3 0) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3} OutVars{main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3} AuxVars[] AssignedVars[] {3618#false} is VALID [2022-04-14 19:13:40,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {3618#false} [222] L217-->mainErr12ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3618#false} is VALID [2022-04-14 19:13:40,211 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-14 19:13:40,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:40,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078043486] [2022-04-14 19:13:40,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078043486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:40,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:40,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-14 19:13:40,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743667662] [2022-04-14 19:13:40,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:40,212 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-14 19:13:40,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:40,212 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-14 19:13:40,224 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-14 19:13:40,224 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 19:13:40,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:40,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 19:13:40,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-14 19:13:40,225 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-14 19:13:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:40,458 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-14 19:13:40,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 19:13:40,458 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-14 19:13:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:40,459 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-14 19:13:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-14 19:13:40,460 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-14 19:13:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-14 19:13:40,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 71 transitions. [2022-04-14 19:13:40,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:13:40,529 INFO L225 Difference]: With dead ends: 60 [2022-04-14 19:13:40,529 INFO L226 Difference]: Without dead ends: 60 [2022-04-14 19:13:40,529 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-14 19:13:40,530 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 114 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:13:40,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 63 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 19:13:40,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-14 19:13:40,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2022-04-14 19:13:40,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:40,531 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-14 19:13:40,531 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-14 19:13:40,531 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-14 19:13:40,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:40,532 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-14 19:13:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-14 19:13:40,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:40,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:40,533 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-14 19:13:40,533 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-14 19:13:40,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:40,533 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-14 19:13:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-14 19:13:40,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:40,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:40,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:40,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:40,534 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-14 19:13:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-14 19:13:40,534 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2022-04-14 19:13:40,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:40,535 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-14 19:13:40,535 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-14 19:13:40,535 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-14 19:13:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 19:13:40,535 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:40,535 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-14 19:13:40,535 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-14 19:13:40,535 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-14 19:13:40,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:40,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1290657461, now seen corresponding path program 1 times [2022-04-14 19:13:40,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:40,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234612011] [2022-04-14 19:13:40,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:40,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:40,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:40,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {3865#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3857#true} is VALID [2022-04-14 19:13:40,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {3857#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3857#true} is VALID [2022-04-14 19:13:40,574 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3857#true} {3857#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3857#true} is VALID [2022-04-14 19:13:40,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {3857#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3865#(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-14 19:13:40,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {3865#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3857#true} is VALID [2022-04-14 19:13:40,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {3857#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3857#true} is VALID [2022-04-14 19:13:40,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3857#true} {3857#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3857#true} is VALID [2022-04-14 19:13:40,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {3857#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3857#true} is VALID [2022-04-14 19:13:40,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {3857#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {3857#true} is VALID [2022-04-14 19:13:40,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {3857#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {3857#true} is VALID [2022-04-14 19:13:40,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {3857#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {3862#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:40,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {3862#(= main_~main__j~0 0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {3862#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:40,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {3862#(= main_~main__j~0 0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {3862#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:40,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {3862#(= main_~main__j~0 0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {3862#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:40,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {3862#(= main_~main__j~0 0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3862#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:40,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {3862#(= main_~main__j~0 0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {3862#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:40,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {3862#(= main_~main__j~0 0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {3862#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:40,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {3862#(= main_~main__j~0 0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {3862#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:40,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {3862#(= main_~main__j~0 0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {3862#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:40,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {3862#(= main_~main__j~0 0)} [203] L163-->L175: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__j~0_12) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {3862#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:40,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {3862#(= main_~main__j~0 0)} [209] L175-->L191: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__i~0_17) (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (+ v_main_~main__i~0_17 1) v_main_~main__i~0_16) (= (ite (< v_main_~main__i~0_16 v_main_~main__len~0_11) 1 0) v_main_~__tmp_11~0_1) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__j~0_14) (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) (= (+ v_main_~main__j~0_14 1) v_main_~main__j~0_13)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main__j~0=v_main_~main__j~0_14, main_~main__i~0=v_main_~main__i~0_17} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__j~0=v_main_~main__j~0_13, main_~__tmp_11~0=v_main_~__tmp_11~0_1, main_~main__i~0=v_main_~main__i~0_16} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~__VERIFIER_assert__cond~10, main_~main____CPAchecker_TMP_1~0, main_~main__j~0, main_~__tmp_11~0, main_~main__i~0] {3863#(<= 1 main_~main__j~0)} is VALID [2022-04-14 19:13:40,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {3863#(<= 1 main_~main__j~0)} [213] L191-->L203: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__i~0_18) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {3863#(<= 1 main_~main__j~0)} is VALID [2022-04-14 19:13:40,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {3863#(<= 1 main_~main__j~0)} [217] L203-->L215: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~__tmp_13~0_1 (ite (< v_main_~main__j~0_15 v_main_~main__bufsize~0_8) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~11_4 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main__j~0=v_main_~main__j~0_15} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main__j~0=v_main_~main__j~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {3863#(<= 1 main_~main__j~0)} is VALID [2022-04-14 19:13:40,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {3863#(<= 1 main_~main__j~0)} [221] L215-->L227: Formula: (and (= (ite (<= 0 v_main_~main__j~0_16) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__j~0=v_main_~main__j~0_16} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__j~0=v_main_~main__j~0_16} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {3864#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-14 19:13:40,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {3864#(not (= main_~__VERIFIER_assert__cond~13 0))} [224] L227-->L229: Formula: (= v_main_~__VERIFIER_assert__cond~13_3 0) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_3} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_3} AuxVars[] AssignedVars[] {3858#false} is VALID [2022-04-14 19:13:40,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {3858#false} [226] L229-->mainErr13ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3858#false} is VALID [2022-04-14 19:13:40,580 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-14 19:13:40,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:40,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234612011] [2022-04-14 19:13:40,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234612011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:40,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:40,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 19:13:40,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122863755] [2022-04-14 19:13:40,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:40,581 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-14 19:13:40,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:40,581 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-14 19:13:40,593 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-14 19:13:40,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:13:40,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:40,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:13:40,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 19:13:40,594 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-14 19:13:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:40,915 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-14 19:13:40,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 19:13:40,915 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-14 19:13:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:40,915 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-14 19:13:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2022-04-14 19:13:40,916 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-14 19:13:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2022-04-14 19:13:40,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 100 transitions. [2022-04-14 19:13:40,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:13:40,998 INFO L225 Difference]: With dead ends: 85 [2022-04-14 19:13:40,998 INFO L226 Difference]: Without dead ends: 85 [2022-04-14 19:13:40,998 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-14 19:13:40,998 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 116 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:13:40,998 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.1s Time] [2022-04-14 19:13:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-14 19:13:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2022-04-14 19:13:41,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:41,000 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-14 19:13:41,000 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-14 19:13:41,000 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-14 19:13:41,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:41,001 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-14 19:13:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-04-14 19:13:41,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:41,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:41,002 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-14 19:13:41,002 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-14 19:13:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:41,003 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-14 19:13:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-04-14 19:13:41,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:41,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:41,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:41,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:41,003 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-14 19:13:41,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-14 19:13:41,004 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2022-04-14 19:13:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:41,004 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-14 19:13:41,004 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-14 19:13:41,004 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-14 19:13:41,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 19:13:41,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:41,005 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-14 19:13:41,005 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-14 19:13:41,005 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-14 19:13:41,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:41,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1355674374, now seen corresponding path program 1 times [2022-04-14 19:13:41,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:41,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529364638] [2022-04-14 19:13:41,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:41,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:41,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:41,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {4174#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {4165#true} is VALID [2022-04-14 19:13:41,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {4165#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4165#true} is VALID [2022-04-14 19:13:41,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4165#true} {4165#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4165#true} is VALID [2022-04-14 19:13:41,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {4165#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4174#(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-14 19:13:41,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {4174#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {4165#true} is VALID [2022-04-14 19:13:41,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {4165#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4165#true} is VALID [2022-04-14 19:13:41,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4165#true} {4165#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4165#true} is VALID [2022-04-14 19:13:41,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {4165#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4165#true} is VALID [2022-04-14 19:13:41,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {4165#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {4165#true} is VALID [2022-04-14 19:13:41,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {4165#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {4170#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:41,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {4170#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {4170#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:41,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {4170#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {4170#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:41,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {4170#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:41,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:41,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:41,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:41,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:41,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:41,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:41,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [203] L163-->L175: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__j~0_12) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:41,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [209] L175-->L191: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__i~0_17) (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (+ v_main_~main__i~0_17 1) v_main_~main__i~0_16) (= (ite (< v_main_~main__i~0_16 v_main_~main__len~0_11) 1 0) v_main_~__tmp_11~0_1) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__j~0_14) (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) (= (+ v_main_~main__j~0_14 1) v_main_~main__j~0_13)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main__j~0=v_main_~main__j~0_14, main_~main__i~0=v_main_~main__i~0_17} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__j~0=v_main_~main__j~0_13, main_~__tmp_11~0=v_main_~__tmp_11~0_1, main_~main__i~0=v_main_~main__i~0_16} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~__VERIFIER_assert__cond~10, main_~main____CPAchecker_TMP_1~0, main_~main__j~0, main_~__tmp_11~0, main_~main__i~0] {4172#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:41,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {4172#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} [213] L191-->L203: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__i~0_18) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {4172#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:41,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {4172#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} [217] L203-->L215: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~__tmp_13~0_1 (ite (< v_main_~main__j~0_15 v_main_~main__bufsize~0_8) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~11_4 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main__j~0=v_main_~main__j~0_15} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main__j~0=v_main_~main__j~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {4172#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:41,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {4172#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} [221] L215-->L227: Formula: (and (= (ite (<= 0 v_main_~main__j~0_16) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__j~0=v_main_~main__j~0_16} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__j~0=v_main_~main__j~0_16} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {4172#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-14 19:13:41,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {4172#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} [225] L227-->L243: Formula: (and (= v_main_~main____CPAchecker_TMP_4~0_1 v_main_~main__i~0_20) (= (+ v_main_~main__j~0_18 1) v_main_~main__j~0_17) (= v_main_~main____CPAchecker_TMP_3~0_1 v_main_~main__j~0_18) (not (= v_main_~__VERIFIER_assert__cond~13_4 0)) (= (+ v_main_~main__i~0_20 1) v_main_~main__i~0_19) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1) (= (ite (< v_main_~main__j~0_17 v_main_~main__bufsize~0_9) 1 0) v_main_~__tmp_15~0_1)) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_9, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main__j~0=v_main_~main__j~0_18, main_~main__i~0=v_main_~main__i~0_20} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_9, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main__j~0=v_main_~main__j~0_17, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1, main_~main__i~0=v_main_~main__i~0_19, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14, main_~main__j~0, main_~main____CPAchecker_TMP_3~0, main_~main__i~0, main_~main____CPAchecker_TMP_4~0] {4173#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-14 19:13:41,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {4173#(not (= main_~__VERIFIER_assert__cond~14 0))} [228] L243-->L245: Formula: (= v_main_~__VERIFIER_assert__cond~14_3 0) InVars {main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_3} OutVars{main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_3} AuxVars[] AssignedVars[] {4166#false} is VALID [2022-04-14 19:13:41,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {4166#false} [230] L245-->mainErr14ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4166#false} is VALID [2022-04-14 19:13:41,094 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-14 19:13:41,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:41,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529364638] [2022-04-14 19:13:41,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529364638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:41,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:41,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-14 19:13:41,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653285146] [2022-04-14 19:13:41,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:41,095 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-14 19:13:41,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:41,096 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-14 19:13:41,109 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-14 19:13:41,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 19:13:41,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:41,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 19:13:41,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-14 19:13:41,110 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-14 19:13:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:41,369 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-14 19:13:41,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 19:13:41,369 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-14 19:13:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:41,370 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-14 19:13:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-14 19:13:41,371 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-14 19:13:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-14 19:13:41,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-14 19:13:41,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:13:41,430 INFO L225 Difference]: With dead ends: 58 [2022-04-14 19:13:41,430 INFO L226 Difference]: Without dead ends: 58 [2022-04-14 19:13:41,430 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-14 19:13:41,431 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-14 19:13:41,431 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-14 19:13:41,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-14 19:13:41,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2022-04-14 19:13:41,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:41,432 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-14 19:13:41,432 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-14 19:13:41,432 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-14 19:13:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:41,433 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-14 19:13:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-14 19:13:41,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:41,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:41,434 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-14 19:13:41,434 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-14 19:13:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:41,435 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-14 19:13:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-14 19:13:41,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:41,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:41,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:41,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:41,435 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-14 19:13:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-14 19:13:41,436 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2022-04-14 19:13:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:41,436 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-14 19:13:41,436 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-14 19:13:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-14 19:13:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 19:13:41,436 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:13:41,436 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-14 19:13:41,436 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-14 19:13:41,437 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-14 19:13:41,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:13:41,437 INFO L85 PathProgramCache]: Analyzing trace with hash 923768623, now seen corresponding path program 1 times [2022-04-14 19:13:41,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:13:41,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832248414] [2022-04-14 19:13:41,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:13:41,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:13:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:41,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:13:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:13:41,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {4404#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {4395#true} is VALID [2022-04-14 19:13:41,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {4395#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4395#true} is VALID [2022-04-14 19:13:41,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4395#true} {4395#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4395#true} is VALID [2022-04-14 19:13:41,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {4395#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4404#(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-14 19:13:41,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {4404#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {4395#true} is VALID [2022-04-14 19:13:41,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {4395#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4395#true} is VALID [2022-04-14 19:13:41,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4395#true} {4395#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4395#true} is VALID [2022-04-14 19:13:41,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {4395#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4395#true} is VALID [2022-04-14 19:13:41,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {4395#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {4395#true} is VALID [2022-04-14 19:13:41,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {4395#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {4395#true} is VALID [2022-04-14 19:13:41,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {4395#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {4400#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:41,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {4400#(= main_~main__j~0 0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {4400#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:41,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {4400#(= main_~main__j~0 0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {4400#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:41,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {4400#(= main_~main__j~0 0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {4400#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:41,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {4400#(= main_~main__j~0 0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4400#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:41,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {4400#(= main_~main__j~0 0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {4400#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:41,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {4400#(= main_~main__j~0 0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {4400#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:41,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {4400#(= main_~main__j~0 0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {4400#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:41,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {4400#(= main_~main__j~0 0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {4400#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:41,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {4400#(= main_~main__j~0 0)} [203] L163-->L175: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__j~0_12) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {4400#(= main_~main__j~0 0)} is VALID [2022-04-14 19:13:41,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {4400#(= main_~main__j~0 0)} [209] L175-->L191: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__i~0_17) (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (+ v_main_~main__i~0_17 1) v_main_~main__i~0_16) (= (ite (< v_main_~main__i~0_16 v_main_~main__len~0_11) 1 0) v_main_~__tmp_11~0_1) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__j~0_14) (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) (= (+ v_main_~main__j~0_14 1) v_main_~main__j~0_13)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main__j~0=v_main_~main__j~0_14, main_~main__i~0=v_main_~main__i~0_17} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__j~0=v_main_~main__j~0_13, main_~__tmp_11~0=v_main_~__tmp_11~0_1, main_~main__i~0=v_main_~main__i~0_16} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~__VERIFIER_assert__cond~10, main_~main____CPAchecker_TMP_1~0, main_~main__j~0, main_~__tmp_11~0, main_~main__i~0] {4401#(<= 1 main_~main__j~0)} is VALID [2022-04-14 19:13:41,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {4401#(<= 1 main_~main__j~0)} [213] L191-->L203: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__i~0_18) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {4401#(<= 1 main_~main__j~0)} is VALID [2022-04-14 19:13:41,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {4401#(<= 1 main_~main__j~0)} [217] L203-->L215: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~__tmp_13~0_1 (ite (< v_main_~main__j~0_15 v_main_~main__bufsize~0_8) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~11_4 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main__j~0=v_main_~main__j~0_15} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main__j~0=v_main_~main__j~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {4401#(<= 1 main_~main__j~0)} is VALID [2022-04-14 19:13:41,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {4401#(<= 1 main_~main__j~0)} [221] L215-->L227: Formula: (and (= (ite (<= 0 v_main_~main__j~0_16) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__j~0=v_main_~main__j~0_16} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__j~0=v_main_~main__j~0_16} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {4401#(<= 1 main_~main__j~0)} is VALID [2022-04-14 19:13:41,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {4401#(<= 1 main_~main__j~0)} [225] L227-->L243: Formula: (and (= v_main_~main____CPAchecker_TMP_4~0_1 v_main_~main__i~0_20) (= (+ v_main_~main__j~0_18 1) v_main_~main__j~0_17) (= v_main_~main____CPAchecker_TMP_3~0_1 v_main_~main__j~0_18) (not (= v_main_~__VERIFIER_assert__cond~13_4 0)) (= (+ v_main_~main__i~0_20 1) v_main_~main__i~0_19) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1) (= (ite (< v_main_~main__j~0_17 v_main_~main__bufsize~0_9) 1 0) v_main_~__tmp_15~0_1)) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_9, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main__j~0=v_main_~main__j~0_18, main_~main__i~0=v_main_~main__i~0_20} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_9, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main__j~0=v_main_~main__j~0_17, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1, main_~main__i~0=v_main_~main__i~0_19, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14, main_~main__j~0, main_~main____CPAchecker_TMP_3~0, main_~main__i~0, main_~main____CPAchecker_TMP_4~0] {4402#(<= 2 main_~main__j~0)} is VALID [2022-04-14 19:13:41,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {4402#(<= 2 main_~main__j~0)} [229] L243-->L255: Formula: (and (= v_main_~__tmp_16~0_1 (ite (<= 0 v_main_~main__j~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~14_4 0)) (= v_main_~__tmp_16~0_1 v_main_~__VERIFIER_assert__cond~15_3)) InVars {main_~main__j~0=v_main_~main__j~0_19, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_3, main_~__tmp_16~0=v_main_~__tmp_16~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__j~0=v_main_~main__j~0_19} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~15, main_~__tmp_16~0] {4403#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-14 19:13:41,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {4403#(not (= main_~__VERIFIER_assert__cond~15 0))} [232] L255-->L257: Formula: (= v_main_~__VERIFIER_assert__cond~15_1 0) InVars {main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_1} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_1} AuxVars[] AssignedVars[] {4396#false} is VALID [2022-04-14 19:13:41,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {4396#false} [234] L257-->mainErr15ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4396#false} is VALID [2022-04-14 19:13:41,535 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-14 19:13:41,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:13:41,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832248414] [2022-04-14 19:13:41,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832248414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:13:41,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:13:41,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-14 19:13:41,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456052405] [2022-04-14 19:13:41,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:13:41,536 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-14 19:13:41,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:13:41,537 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-14 19:13:41,550 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-14 19:13:41,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 19:13:41,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:13:41,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 19:13:41,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-14 19:13:41,551 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-14 19:13:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:41,982 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2022-04-14 19:13:41,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 19:13:41,982 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-14 19:13:41,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:13:41,982 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-14 19:13:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2022-04-14 19:13:41,983 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-14 19:13:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2022-04-14 19:13:41,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 146 transitions. [2022-04-14 19:13:42,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:13:42,089 INFO L225 Difference]: With dead ends: 123 [2022-04-14 19:13:42,089 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 19:13:42,089 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-14 19:13:42,091 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 162 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 19:13:42,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 74 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 19:13:42,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 19:13:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 19:13:42,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:13:42,092 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-14 19:13:42,092 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-14 19:13:42,092 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-14 19:13:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:42,092 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 19:13:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:13:42,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:42,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:42,092 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-14 19:13:42,092 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-14 19:13:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:13:42,093 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 19:13:42,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:13:42,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:42,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:13:42,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:13:42,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:13:42,093 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-14 19:13:42,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 19:13:42,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-04-14 19:13:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:13:42,093 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 19:13:42,093 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-14 19:13:42,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:13:42,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:13:42,095 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-04-14 19:13:42,096 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-04-14 19:13:42,096 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-04-14 19:13:42,096 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-04-14 19:13:42,096 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-04-14 19:13:42,097 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-04-14 19:13:42,097 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-04-14 19:13:42,097 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-04-14 19:13:42,097 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-04-14 19:13:42,097 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-04-14 19:13:42,097 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-04-14 19:13:42,098 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-04-14 19:13:42,098 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-04-14 19:13:42,098 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-04-14 19:13:42,098 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-04-14 19:13:42,098 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-04-14 19:13:42,098 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-14 19:13:42,100 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:13:42,101 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 19:13:42,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:13:42 BasicIcfg [2022-04-14 19:13:42,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 19:13:42,104 INFO L158 Benchmark]: Toolchain (without parser) took 7556.79ms. Allocated memory was 187.7MB in the beginning and 276.8MB in the end (delta: 89.1MB). Free memory was 139.2MB in the beginning and 120.7MB in the end (delta: 18.5MB). Peak memory consumption was 108.1MB. Max. memory is 8.0GB. [2022-04-14 19:13:42,104 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory was 155.5MB in the beginning and 155.3MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 19:13:42,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.60ms. Allocated memory is still 187.7MB. Free memory was 139.0MB in the beginning and 156.9MB in the end (delta: -18.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 19:13:42,104 INFO L158 Benchmark]: Boogie Preprocessor took 42.45ms. Allocated memory is still 187.7MB. Free memory was 156.9MB in the beginning and 155.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 19:13:42,104 INFO L158 Benchmark]: RCFGBuilder took 356.99ms. Allocated memory is still 187.7MB. Free memory was 155.2MB in the beginning and 139.7MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-14 19:13:42,104 INFO L158 Benchmark]: IcfgTransformer took 61.91ms. Allocated memory is still 187.7MB. Free memory was 139.7MB in the beginning and 137.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-14 19:13:42,105 INFO L158 Benchmark]: TraceAbstraction took 6790.14ms. Allocated memory was 187.7MB in the beginning and 276.8MB in the end (delta: 89.1MB). Free memory was 136.6MB in the beginning and 120.7MB in the end (delta: 15.9MB). Peak memory consumption was 106.3MB. Max. memory is 8.0GB. [2022-04-14 19:13:42,105 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory was 155.5MB in the beginning and 155.3MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 297.60ms. Allocated memory is still 187.7MB. Free memory was 139.0MB in the beginning and 156.9MB in the end (delta: -18.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.45ms. Allocated memory is still 187.7MB. Free memory was 156.9MB in the beginning and 155.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 356.99ms. Allocated memory is still 187.7MB. Free memory was 155.2MB in the beginning and 139.7MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * IcfgTransformer took 61.91ms. Allocated memory is still 187.7MB. Free memory was 139.7MB in the beginning and 137.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6790.14ms. Allocated memory was 187.7MB in the beginning and 276.8MB in the end (delta: 89.1MB). Free memory was 136.6MB in the beginning and 120.7MB in the end (delta: 15.9MB). Peak memory consumption was 106.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 59]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 88]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 141]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 100]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 153]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 112]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 165]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 193]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 205]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 217]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 229]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 245]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1971 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1971 mSDsluCounter, 1183 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 236 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1590 IncrementalHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 947 mSDtfsCounter, 1590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 436 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-14 19:13:42,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...