./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_reset_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_reset_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 26dd1e590401fc7cb1a23c07b0d1f52f89cca75ab7679d1aa0110320620b8ebd --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:59:19,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:59:19,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:59:19,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:59:19,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:59:19,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:59:19,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:59:19,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:59:19,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:59:19,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:59:19,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:59:19,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:59:19,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:59:19,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:59:19,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:59:19,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:59:19,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:59:19,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:59:19,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:59:19,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:59:19,914 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:59:19,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:59:19,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:59:19,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:59:19,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:59:19,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:59:19,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:59:19,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:59:19,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:59:19,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:59:19,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:59:19,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:59:19,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:59:19,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:59:19,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:59:19,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:59:19,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:59:19,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:59:19,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:59:19,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:59:19,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:59:19,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:59:19,926 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 21:59:19,943 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:59:19,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:59:19,948 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:59:19,948 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:59:19,949 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:59:19,949 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:59:19,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:59:19,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:59:19,950 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:59:19,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:59:19,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:59:19,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:59:19,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:59:19,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:59:19,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:59:19,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:59:19,951 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:59:19,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:59:19,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:59:19,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:59:19,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:59:19,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:59:19,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:59:19,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:59:19,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:59:19,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:59:19,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:59:19,954 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:59:19,954 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:59:19,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:59:19,955 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26dd1e590401fc7cb1a23c07b0d1f52f89cca75ab7679d1aa0110320620b8ebd [2022-07-19 21:59:20,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:59:20,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:59:20,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:59:20,146 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:59:20,146 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:59:20,147 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_reset_harness.i [2022-07-19 21:59:20,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b604e7102/0d89c113caf741d6afd5eb6d66057ffb/FLAG9a82cb826 [2022-07-19 21:59:20,759 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:59:20,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reset_harness.i [2022-07-19 21:59:20,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b604e7102/0d89c113caf741d6afd5eb6d66057ffb/FLAG9a82cb826 [2022-07-19 21:59:21,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b604e7102/0d89c113caf741d6afd5eb6d66057ffb [2022-07-19 21:59:21,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:59:21,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:59:21,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:59:21,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:59:21,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:59:21,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:59:21" (1/1) ... [2022-07-19 21:59:21,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62dbe902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:59:21, skipping insertion in model container [2022-07-19 21:59:21,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:59:21" (1/1) ... [2022-07-19 21:59:21,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:59:21,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:59:21,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reset_harness.i[4492,4505] [2022-07-19 21:59:21,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reset_harness.i[4552,4565] [2022-07-19 21:59:21,906 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:21,907 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:21,908 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:21,908 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:21,909 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:21,918 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:21,921 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:21,927 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:21,928 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:22,126 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 21:59:22,127 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 21:59:22,128 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 21:59:22,128 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 21:59:22,129 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 21:59:22,130 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 21:59:22,130 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 21:59:22,131 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 21:59:22,131 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 21:59:22,132 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 21:59:22,241 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 21:59:22,351 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:22,353 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:22,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:59:22,455 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:59:22,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reset_harness.i[4492,4505] [2022-07-19 21:59:22,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reset_harness.i[4552,4565] [2022-07-19 21:59:22,488 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:22,489 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:22,490 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:22,490 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:22,491 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:22,494 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:22,496 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:22,496 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:22,497 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:22,524 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 21:59:22,525 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 21:59:22,526 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 21:59:22,528 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 21:59:22,528 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 21:59:22,529 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 21:59:22,529 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 21:59:22,529 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 21:59:22,530 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 21:59:22,530 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 21:59:22,550 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 21:59:22,591 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:22,593 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:59:22,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:59:22,774 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:59:22,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:59:22 WrapperNode [2022-07-19 21:59:22,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:59:22,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:59:22,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:59:22,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:59:22,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:59:22" (1/1) ... [2022-07-19 21:59:22,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:59:22" (1/1) ... [2022-07-19 21:59:22,934 INFO L137 Inliner]: procedures = 691, calls = 2631, calls flagged for inlining = 59, calls inlined = 7, statements flattened = 816 [2022-07-19 21:59:22,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:59:22,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:59:22,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:59:22,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:59:22,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:59:22" (1/1) ... [2022-07-19 21:59:22,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:59:22" (1/1) ... [2022-07-19 21:59:22,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:59:22" (1/1) ... [2022-07-19 21:59:22,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:59:22" (1/1) ... [2022-07-19 21:59:22,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:59:22" (1/1) ... [2022-07-19 21:59:22,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:59:22" (1/1) ... [2022-07-19 21:59:23,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:59:22" (1/1) ... [2022-07-19 21:59:23,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:59:23,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:59:23,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:59:23,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:59:23,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:59:22" (1/1) ... [2022-07-19 21:59:23,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:59:23,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:23,044 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-07-19 21:59:23,056 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-07-19 21:59:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-19 21:59:23,073 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-19 21:59:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:59:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-19 21:59:23,074 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-19 21:59:23,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 21:59:23,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 21:59:23,074 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 21:59:23,075 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_secure_zero [2022-07-19 21:59:23,075 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_secure_zero [2022-07-19 21:59:23,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 21:59:23,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:59:23,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 21:59:23,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:59:23,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:59:23,077 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 21:59:23,077 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 21:59:23,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 21:59:23,077 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 21:59:23,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:59:23,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 21:59:23,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 21:59:23,078 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-19 21:59:23,078 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-19 21:59:23,078 INFO L130 BoogieDeclarations]: Found specification of procedure assert_all_bytes_are [2022-07-19 21:59:23,079 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_all_bytes_are [2022-07-19 21:59:23,079 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-19 21:59:23,079 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-19 21:59:23,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:59:23,080 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2022-07-19 21:59:23,080 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2022-07-19 21:59:23,080 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2022-07-19 21:59:23,080 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2022-07-19 21:59:23,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:59:23,299 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:59:23,306 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:59:23,966 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:59:23,976 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:59:23,976 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 21:59:23,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:59:23 BoogieIcfgContainer [2022-07-19 21:59:23,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:59:23,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:59:23,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:59:23,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:59:23,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:59:21" (1/3) ... [2022-07-19 21:59:23,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23390b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:59:23, skipping insertion in model container [2022-07-19 21:59:23,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:59:22" (2/3) ... [2022-07-19 21:59:23,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23390b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:59:23, skipping insertion in model container [2022-07-19 21:59:23,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:59:23" (3/3) ... [2022-07-19 21:59:23,985 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_reset_harness.i [2022-07-19 21:59:23,995 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:59:23,995 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 21:59:24,042 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:59:24,047 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@780dce87, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@61ed601e [2022-07-19 21:59:24,047 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 21:59:24,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 80 states have internal predecessors, (96), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-19 21:59:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 21:59:24,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:24,059 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:24,059 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:24,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1110276302, now seen corresponding path program 1 times [2022-07-19 21:59:24,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:24,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362024340] [2022-07-19 21:59:24,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:59:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 21:59:24,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:24,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362024340] [2022-07-19 21:59:24,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362024340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:24,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:24,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:59:24,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614316350] [2022-07-19 21:59:24,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:24,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:59:24,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:24,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:59:24,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:59:24,544 INFO L87 Difference]: Start difference. First operand has 114 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 80 states have internal predecessors, (96), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 21:59:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:24,718 INFO L93 Difference]: Finished difference Result 224 states and 296 transitions. [2022-07-19 21:59:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:59:24,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2022-07-19 21:59:24,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:24,731 INFO L225 Difference]: With dead ends: 224 [2022-07-19 21:59:24,731 INFO L226 Difference]: Without dead ends: 105 [2022-07-19 21:59:24,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:59:24,740 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 65 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:24,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 151 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:59:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-19 21:59:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-19 21:59:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-19 21:59:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2022-07-19 21:59:24,797 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 46 [2022-07-19 21:59:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:24,797 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2022-07-19 21:59:24,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 21:59:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2022-07-19 21:59:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 21:59:24,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:24,801 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:24,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:59:24,801 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:24,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:24,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1937663032, now seen corresponding path program 1 times [2022-07-19 21:59:24,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:24,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31837560] [2022-07-19 21:59:24,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:24,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:25,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:25,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:59:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 21:59:25,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:25,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31837560] [2022-07-19 21:59:25,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31837560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:25,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:25,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:59:25,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699025404] [2022-07-19 21:59:25,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:25,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:59:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:25,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:59:25,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:59:25,070 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 21:59:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:25,383 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2022-07-19 21:59:25,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:59:25,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-07-19 21:59:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:25,387 INFO L225 Difference]: With dead ends: 188 [2022-07-19 21:59:25,387 INFO L226 Difference]: Without dead ends: 108 [2022-07-19 21:59:25,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:59:25,394 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 97 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:25,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 192 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:59:25,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-19 21:59:25,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-07-19 21:59:25,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.178082191780822) internal successors, (86), 76 states have internal predecessors, (86), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (23), 21 states have call predecessors, (23), 21 states have call successors, (23) [2022-07-19 21:59:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2022-07-19 21:59:25,407 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 46 [2022-07-19 21:59:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:25,407 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2022-07-19 21:59:25,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 21:59:25,408 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2022-07-19 21:59:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 21:59:25,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:25,409 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:25,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 21:59:25,409 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:25,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:25,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1805915411, now seen corresponding path program 1 times [2022-07-19 21:59:25,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:25,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072269582] [2022-07-19 21:59:25,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:25,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:25,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:25,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:25,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:25,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:25,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:25,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 21:59:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 21:59:25,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:25,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072269582] [2022-07-19 21:59:25,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072269582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:25,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:25,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:59:25,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352360657] [2022-07-19 21:59:25,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:25,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:59:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:25,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:59:25,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:59:25,639 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 21:59:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:26,042 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2022-07-19 21:59:26,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:59:26,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2022-07-19 21:59:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:26,043 INFO L225 Difference]: With dead ends: 114 [2022-07-19 21:59:26,044 INFO L226 Difference]: Without dead ends: 112 [2022-07-19 21:59:26,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:59:26,044 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 82 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:26,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 238 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 21:59:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-19 21:59:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-19 21:59:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 79 states have internal predecessors, (89), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (23), 21 states have call predecessors, (23), 21 states have call successors, (23) [2022-07-19 21:59:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2022-07-19 21:59:26,051 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 52 [2022-07-19 21:59:26,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:26,051 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2022-07-19 21:59:26,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 21:59:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2022-07-19 21:59:26,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 21:59:26,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:26,052 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:26,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 21:59:26,053 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:26,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:26,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1287993371, now seen corresponding path program 1 times [2022-07-19 21:59:26,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:26,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392411999] [2022-07-19 21:59:26,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:26,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 21:59:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 21:59:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 21:59:26,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:26,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392411999] [2022-07-19 21:59:26,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392411999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:26,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:26,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 21:59:26,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684945489] [2022-07-19 21:59:26,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:26,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:59:26,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:26,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:59:26,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:59:26,369 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 21:59:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:26,902 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2022-07-19 21:59:26,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:59:26,902 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-07-19 21:59:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:26,903 INFO L225 Difference]: With dead ends: 130 [2022-07-19 21:59:26,903 INFO L226 Difference]: Without dead ends: 128 [2022-07-19 21:59:26,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-19 21:59:26,904 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 91 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:26,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 237 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 21:59:26,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-19 21:59:26,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2022-07-19 21:59:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 85 states have internal predecessors, (95), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (25), 22 states have call predecessors, (25), 23 states have call successors, (25) [2022-07-19 21:59:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2022-07-19 21:59:26,929 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 58 [2022-07-19 21:59:26,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:26,929 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2022-07-19 21:59:26,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 21:59:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2022-07-19 21:59:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 21:59:26,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:26,930 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:26,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 21:59:26,931 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:26,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:26,931 INFO L85 PathProgramCache]: Analyzing trace with hash 388379591, now seen corresponding path program 1 times [2022-07-19 21:59:26,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:26,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655226821] [2022-07-19 21:59:26,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:26,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:27,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:27,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:27,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:27,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:27,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:27,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 21:59:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:27,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 21:59:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:27,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 21:59:27,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:27,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655226821] [2022-07-19 21:59:27,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655226821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:27,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:27,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 21:59:27,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24524549] [2022-07-19 21:59:27,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:27,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:59:27,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:27,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:59:27,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:59:27,195 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 21:59:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:27,691 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2022-07-19 21:59:27,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:59:27,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 64 [2022-07-19 21:59:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:27,693 INFO L225 Difference]: With dead ends: 134 [2022-07-19 21:59:27,693 INFO L226 Difference]: Without dead ends: 132 [2022-07-19 21:59:27,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-19 21:59:27,694 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 91 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:27,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 237 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 21:59:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-19 21:59:27,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2022-07-19 21:59:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 89 states have internal predecessors, (99), 26 states have call successors, (26), 14 states have call predecessors, (26), 14 states have return successors, (26), 23 states have call predecessors, (26), 24 states have call successors, (26) [2022-07-19 21:59:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2022-07-19 21:59:27,702 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 64 [2022-07-19 21:59:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:27,702 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2022-07-19 21:59:27,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 21:59:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2022-07-19 21:59:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-19 21:59:27,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:27,704 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 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, 1] [2022-07-19 21:59:27,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 21:59:27,704 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:27,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:27,705 INFO L85 PathProgramCache]: Analyzing trace with hash -472545423, now seen corresponding path program 1 times [2022-07-19 21:59:27,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:27,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325322765] [2022-07-19 21:59:27,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:27,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:27,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:27,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:27,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 21:59:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 21:59:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 21:59:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 21:59:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:28,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325322765] [2022-07-19 21:59:28,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325322765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:28,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:28,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 21:59:28,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889228902] [2022-07-19 21:59:28,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:28,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:59:28,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:28,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:59:28,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:59:28,102 INFO L87 Difference]: Start difference. First operand 127 states and 151 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 21:59:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:28,660 INFO L93 Difference]: Finished difference Result 138 states and 162 transitions. [2022-07-19 21:59:28,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:59:28,660 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 70 [2022-07-19 21:59:28,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:28,661 INFO L225 Difference]: With dead ends: 138 [2022-07-19 21:59:28,662 INFO L226 Difference]: Without dead ends: 136 [2022-07-19 21:59:28,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:59:28,663 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 92 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:28,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 229 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 21:59:28,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-19 21:59:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2022-07-19 21:59:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 90 states have (on average 1.1444444444444444) internal successors, (103), 93 states have internal predecessors, (103), 27 states have call successors, (27), 15 states have call predecessors, (27), 15 states have return successors, (27), 24 states have call predecessors, (27), 25 states have call successors, (27) [2022-07-19 21:59:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 157 transitions. [2022-07-19 21:59:28,671 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 157 transitions. Word has length 70 [2022-07-19 21:59:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:28,672 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 157 transitions. [2022-07-19 21:59:28,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 21:59:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 157 transitions. [2022-07-19 21:59:28,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 21:59:28,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:28,673 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 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, 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-07-19 21:59:28,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 21:59:28,673 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:28,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:28,674 INFO L85 PathProgramCache]: Analyzing trace with hash -918234075, now seen corresponding path program 1 times [2022-07-19 21:59:28,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:28,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714976193] [2022-07-19 21:59:28,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:28,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 21:59:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 21:59:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 21:59:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 21:59:28,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:28,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714976193] [2022-07-19 21:59:28,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714976193] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:28,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352731128] [2022-07-19 21:59:28,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:28,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:28,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:28,892 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:59:28,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 21:59:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:29,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 2522 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 21:59:29,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 21:59:29,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:29,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352731128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:29,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:29,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2022-07-19 21:59:29,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788418149] [2022-07-19 21:59:29,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:29,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:59:29,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:29,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:59:29,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-07-19 21:59:29,473 INFO L87 Difference]: Start difference. First operand 133 states and 157 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-19 21:59:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:29,631 INFO L93 Difference]: Finished difference Result 214 states and 253 transitions. [2022-07-19 21:59:29,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:59:29,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 72 [2022-07-19 21:59:29,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:29,634 INFO L225 Difference]: With dead ends: 214 [2022-07-19 21:59:29,634 INFO L226 Difference]: Without dead ends: 130 [2022-07-19 21:59:29,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-07-19 21:59:29,637 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 169 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:29,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 604 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:59:29,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-19 21:59:29,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-19 21:59:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 90 states have internal predecessors, (100), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-19 21:59:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2022-07-19 21:59:29,649 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 72 [2022-07-19 21:59:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:29,649 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2022-07-19 21:59:29,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-19 21:59:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2022-07-19 21:59:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 21:59:29,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:29,650 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:29,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 21:59:29,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:29,863 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:29,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:29,864 INFO L85 PathProgramCache]: Analyzing trace with hash -54561733, now seen corresponding path program 1 times [2022-07-19 21:59:29,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:29,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171512584] [2022-07-19 21:59:29,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:29,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 21:59:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 21:59:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 21:59:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 21:59:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-19 21:59:30,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:30,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171512584] [2022-07-19 21:59:30,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171512584] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:30,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:30,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 21:59:30,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295016685] [2022-07-19 21:59:30,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:30,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:59:30,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:30,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:59:30,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:59:30,095 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-19 21:59:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:30,489 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2022-07-19 21:59:30,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:59:30,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2022-07-19 21:59:30,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:30,491 INFO L225 Difference]: With dead ends: 142 [2022-07-19 21:59:30,491 INFO L226 Difference]: Without dead ends: 140 [2022-07-19 21:59:30,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:59:30,492 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 85 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:30,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 346 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:59:30,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-19 21:59:30,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2022-07-19 21:59:30,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.127659574468085) internal successors, (106), 97 states have internal predecessors, (106), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (29), 25 states have call predecessors, (29), 26 states have call successors, (29) [2022-07-19 21:59:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2022-07-19 21:59:30,498 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 84 [2022-07-19 21:59:30,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:30,498 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2022-07-19 21:59:30,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-19 21:59:30,498 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2022-07-19 21:59:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-19 21:59:30,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:30,499 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:30,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 21:59:30,499 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:30,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:30,500 INFO L85 PathProgramCache]: Analyzing trace with hash 300350147, now seen corresponding path program 1 times [2022-07-19 21:59:30,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:30,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889554580] [2022-07-19 21:59:30,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:30,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 21:59:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 21:59:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 21:59:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 21:59:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-19 21:59:30,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:30,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889554580] [2022-07-19 21:59:30,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889554580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:30,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:30,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:59:30,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977408358] [2022-07-19 21:59:30,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:30,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:59:30,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:30,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:59:30,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:59:30,728 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:31,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:31,070 INFO L93 Difference]: Finished difference Result 278 states and 336 transitions. [2022-07-19 21:59:31,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:59:31,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2022-07-19 21:59:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:31,072 INFO L225 Difference]: With dead ends: 278 [2022-07-19 21:59:31,072 INFO L226 Difference]: Without dead ends: 164 [2022-07-19 21:59:31,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:59:31,073 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 130 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:31,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 245 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:59:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-19 21:59:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 144. [2022-07-19 21:59:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 102 states have internal predecessors, (113), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (29), 25 states have call predecessors, (29), 26 states have call successors, (29) [2022-07-19 21:59:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2022-07-19 21:59:31,084 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 88 [2022-07-19 21:59:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:31,084 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2022-07-19 21:59:31,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2022-07-19 21:59:31,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-19 21:59:31,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:31,086 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:31,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 21:59:31,086 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:31,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:31,087 INFO L85 PathProgramCache]: Analyzing trace with hash 558515585, now seen corresponding path program 1 times [2022-07-19 21:59:31,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:31,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942811270] [2022-07-19 21:59:31,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:31,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:31,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:31,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:31,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:31,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:31,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:31,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 21:59:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:31,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 21:59:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 21:59:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 21:59:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 21:59:31,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:31,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942811270] [2022-07-19 21:59:31,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942811270] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:31,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415392323] [2022-07-19 21:59:31,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:31,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:31,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:31,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:59:31,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 21:59:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:31,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 2563 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-19 21:59:31,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:31,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 21:59:32,072 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 21:59:32,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:32,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415392323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:32,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:32,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 17 [2022-07-19 21:59:32,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299909333] [2022-07-19 21:59:32,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:32,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 21:59:32,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:32,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 21:59:32,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-07-19 21:59:32,074 INFO L87 Difference]: Start difference. First operand 144 states and 170 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 10 states have internal predecessors, (53), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-19 21:59:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:32,126 INFO L93 Difference]: Finished difference Result 286 states and 339 transitions. [2022-07-19 21:59:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:59:32,127 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 10 states have internal predecessors, (53), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 88 [2022-07-19 21:59:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:32,130 INFO L225 Difference]: With dead ends: 286 [2022-07-19 21:59:32,130 INFO L226 Difference]: Without dead ends: 163 [2022-07-19 21:59:32,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-19 21:59:32,131 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 32 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:32,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 665 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 79 Unchecked, 0.0s Time] [2022-07-19 21:59:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-19 21:59:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-07-19 21:59:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 117 states have (on average 1.1623931623931625) internal successors, (136), 120 states have internal predecessors, (136), 28 states have call successors, (28), 17 states have call predecessors, (28), 17 states have return successors, (29), 25 states have call predecessors, (29), 26 states have call successors, (29) [2022-07-19 21:59:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 193 transitions. [2022-07-19 21:59:32,142 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 193 transitions. Word has length 88 [2022-07-19 21:59:32,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:32,143 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 193 transitions. [2022-07-19 21:59:32,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 10 states have internal predecessors, (53), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-19 21:59:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2022-07-19 21:59:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-19 21:59:32,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:32,144 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:32,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-19 21:59:32,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 21:59:32,358 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:32,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash 599190335, now seen corresponding path program 1 times [2022-07-19 21:59:32,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:32,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717156626] [2022-07-19 21:59:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:32,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:32,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:32,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:32,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:32,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:32,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:32,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 21:59:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:32,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 21:59:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:32,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 21:59:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:32,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 21:59:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-19 21:59:32,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:32,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717156626] [2022-07-19 21:59:32,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717156626] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:32,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406048578] [2022-07-19 21:59:32,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:32,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:32,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:32,522 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:59:32,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 21:59:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:32,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 2558 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 21:59:32,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 21:59:32,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:32,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406048578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:32,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:32,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-19 21:59:32,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443740436] [2022-07-19 21:59:32,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:32,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:59:32,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:32,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:59:32,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:59:32,897 INFO L87 Difference]: Start difference. First operand 163 states and 193 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:32,916 INFO L93 Difference]: Finished difference Result 295 states and 354 transitions. [2022-07-19 21:59:32,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:59:32,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2022-07-19 21:59:32,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:32,917 INFO L225 Difference]: With dead ends: 295 [2022-07-19 21:59:32,918 INFO L226 Difference]: Without dead ends: 172 [2022-07-19 21:59:32,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:59:32,918 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 20 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:32,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 373 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:59:32,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-19 21:59:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2022-07-19 21:59:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 110 states have (on average 1.1545454545454545) internal successors, (127), 112 states have internal predecessors, (127), 28 states have call successors, (28), 17 states have call predecessors, (28), 16 states have return successors, (28), 25 states have call predecessors, (28), 26 states have call successors, (28) [2022-07-19 21:59:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2022-07-19 21:59:32,926 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 88 [2022-07-19 21:59:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:32,926 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2022-07-19 21:59:32,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2022-07-19 21:59:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-19 21:59:32,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:32,927 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:32,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 21:59:33,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:33,151 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:33,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1357155461, now seen corresponding path program 2 times [2022-07-19 21:59:33,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:33,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807626599] [2022-07-19 21:59:33,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:33,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:33,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:33,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:33,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:33,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:33,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:33,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:59:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:33,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 21:59:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:33,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 21:59:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:33,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 21:59:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-19 21:59:33,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:33,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807626599] [2022-07-19 21:59:33,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807626599] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:33,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086482337] [2022-07-19 21:59:33,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:59:33,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:33,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:33,340 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:59:33,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 21:59:33,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 21:59:33,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:59:33,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 2334 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-19 21:59:33,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:33,732 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-19 21:59:33,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-19 21:59:33,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:33,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-19 21:59:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 21:59:34,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:34,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086482337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:34,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:34,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2022-07-19 21:59:34,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327482681] [2022-07-19 21:59:34,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:34,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:59:34,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:34,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:59:34,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-19 21:59:34,006 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:34,091 INFO L93 Difference]: Finished difference Result 223 states and 264 transitions. [2022-07-19 21:59:34,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:59:34,091 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2022-07-19 21:59:34,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:34,092 INFO L225 Difference]: With dead ends: 223 [2022-07-19 21:59:34,092 INFO L226 Difference]: Without dead ends: 177 [2022-07-19 21:59:34,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-07-19 21:59:34,094 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 25 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:34,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 531 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 70 Unchecked, 0.0s Time] [2022-07-19 21:59:34,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-19 21:59:34,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2022-07-19 21:59:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 127 states have (on average 1.1811023622047243) internal successors, (150), 129 states have internal predecessors, (150), 29 states have call successors, (29), 18 states have call predecessors, (29), 16 states have return successors, (30), 25 states have call predecessors, (30), 27 states have call successors, (30) [2022-07-19 21:59:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 209 transitions. [2022-07-19 21:59:34,103 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 209 transitions. Word has length 92 [2022-07-19 21:59:34,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:34,103 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 209 transitions. [2022-07-19 21:59:34,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 209 transitions. [2022-07-19 21:59:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-19 21:59:34,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:34,107 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:34,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 21:59:34,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:34,323 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:34,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:34,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1657948157, now seen corresponding path program 2 times [2022-07-19 21:59:34,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:34,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885137326] [2022-07-19 21:59:34,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:34,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:34,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:34,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:34,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:34,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:34,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:34,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:59:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:34,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 21:59:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:34,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 21:59:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 21:59:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 21:59:34,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:34,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885137326] [2022-07-19 21:59:34,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885137326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:34,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:34,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 21:59:34,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637805805] [2022-07-19 21:59:34,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:34,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:59:34,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:34,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:59:34,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:59:34,537 INFO L87 Difference]: Start difference. First operand 173 states and 209 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:34,936 INFO L93 Difference]: Finished difference Result 237 states and 283 transitions. [2022-07-19 21:59:34,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:59:34,938 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2022-07-19 21:59:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:34,939 INFO L225 Difference]: With dead ends: 237 [2022-07-19 21:59:34,939 INFO L226 Difference]: Without dead ends: 197 [2022-07-19 21:59:34,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:59:34,940 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 134 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:34,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 249 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:59:34,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-19 21:59:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 185. [2022-07-19 21:59:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 138 states have (on average 1.181159420289855) internal successors, (163), 141 states have internal predecessors, (163), 29 states have call successors, (29), 18 states have call predecessors, (29), 17 states have return successors, (32), 25 states have call predecessors, (32), 27 states have call successors, (32) [2022-07-19 21:59:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 224 transitions. [2022-07-19 21:59:34,947 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 224 transitions. Word has length 92 [2022-07-19 21:59:34,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:34,947 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 224 transitions. [2022-07-19 21:59:34,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:34,947 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 224 transitions. [2022-07-19 21:59:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-19 21:59:34,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:34,948 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:34,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 21:59:34,948 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:34,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:34,949 INFO L85 PathProgramCache]: Analyzing trace with hash -188565183, now seen corresponding path program 1 times [2022-07-19 21:59:34,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:34,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099059959] [2022-07-19 21:59:34,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:34,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:35,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:35,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:35,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:35,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:35,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:35,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:59:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:35,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 21:59:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:35,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 21:59:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:35,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 21:59:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-19 21:59:35,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:35,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099059959] [2022-07-19 21:59:35,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099059959] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:35,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53453275] [2022-07-19 21:59:35,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:35,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:35,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:35,132 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:59:35,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 21:59:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:35,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 2567 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-19 21:59:35,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:35,672 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-19 21:59:35,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-19 21:59:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 21:59:35,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:59:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 21:59:36,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53453275] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:59:36,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:59:36,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2022-07-19 21:59:36,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453161787] [2022-07-19 21:59:36,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:59:36,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-19 21:59:36,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:36,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-19 21:59:36,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-07-19 21:59:36,146 INFO L87 Difference]: Start difference. First operand 185 states and 224 transitions. Second operand has 23 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 4 states have call successors, (19), 4 states have call predecessors, (19), 7 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-19 21:59:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:37,454 INFO L93 Difference]: Finished difference Result 380 states and 471 transitions. [2022-07-19 21:59:37,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-19 21:59:37,455 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 4 states have call successors, (19), 4 states have call predecessors, (19), 7 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 92 [2022-07-19 21:59:37,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:37,456 INFO L225 Difference]: With dead ends: 380 [2022-07-19 21:59:37,456 INFO L226 Difference]: Without dead ends: 229 [2022-07-19 21:59:37,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 189 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=1585, Unknown=0, NotChecked=0, Total=1892 [2022-07-19 21:59:37,458 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 294 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:37,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 520 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1438 Invalid, 0 Unknown, 210 Unchecked, 0.8s Time] [2022-07-19 21:59:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-19 21:59:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2022-07-19 21:59:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 173 states have (on average 1.1618497109826589) internal successors, (201), 180 states have internal predecessors, (201), 31 states have call successors, (31), 20 states have call predecessors, (31), 23 states have return successors, (48), 27 states have call predecessors, (48), 29 states have call successors, (48) [2022-07-19 21:59:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 280 transitions. [2022-07-19 21:59:37,468 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 280 transitions. Word has length 92 [2022-07-19 21:59:37,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:37,468 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 280 transitions. [2022-07-19 21:59:37,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 4 states have call successors, (19), 4 states have call predecessors, (19), 7 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-19 21:59:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2022-07-19 21:59:37,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-19 21:59:37,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:37,470 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 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, 1] [2022-07-19 21:59:37,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 21:59:37,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-19 21:59:37,687 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1157731838, now seen corresponding path program 1 times [2022-07-19 21:59:37,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:37,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910667261] [2022-07-19 21:59:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:37,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 21:59:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 21:59:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-19 21:59:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:37,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910667261] [2022-07-19 21:59:37,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910667261] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:37,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146313614] [2022-07-19 21:59:37,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:37,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:37,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:37,868 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:59:37,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 21:59:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:38,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 2569 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 21:59:38,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-19 21:59:38,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:38,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146313614] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:38,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:38,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-19 21:59:38,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904249513] [2022-07-19 21:59:38,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:38,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:59:38,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:38,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:59:38,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:59:38,282 INFO L87 Difference]: Start difference. First operand 228 states and 280 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:38,305 INFO L93 Difference]: Finished difference Result 414 states and 515 transitions. [2022-07-19 21:59:38,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:59:38,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2022-07-19 21:59:38,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:38,306 INFO L225 Difference]: With dead ends: 414 [2022-07-19 21:59:38,306 INFO L226 Difference]: Without dead ends: 211 [2022-07-19 21:59:38,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:59:38,308 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 9 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:38,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 366 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:59:38,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-19 21:59:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2022-07-19 21:59:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 155 states have (on average 1.1290322580645162) internal successors, (175), 160 states have internal predecessors, (175), 31 states have call successors, (31), 20 states have call predecessors, (31), 21 states have return successors, (41), 27 states have call predecessors, (41), 29 states have call successors, (41) [2022-07-19 21:59:38,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 247 transitions. [2022-07-19 21:59:38,323 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 247 transitions. Word has length 94 [2022-07-19 21:59:38,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:38,323 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 247 transitions. [2022-07-19 21:59:38,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:38,323 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 247 transitions. [2022-07-19 21:59:38,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-19 21:59:38,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:38,325 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:38,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 21:59:38,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 21:59:38,535 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:38,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:38,536 INFO L85 PathProgramCache]: Analyzing trace with hash 542639162, now seen corresponding path program 1 times [2022-07-19 21:59:38,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:38,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018356018] [2022-07-19 21:59:38,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:38,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:38,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:38,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:38,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:38,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:38,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:38,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:38,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 21:59:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:38,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 21:59:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-19 21:59:38,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:38,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018356018] [2022-07-19 21:59:38,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018356018] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:38,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753863225] [2022-07-19 21:59:38,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:38,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:38,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:38,669 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:59:38,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 21:59:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 2571 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 21:59:39,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 21:59:39,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:39,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753863225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:39,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:39,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-19 21:59:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989292932] [2022-07-19 21:59:39,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:39,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:59:39,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:39,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:59:39,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:59:39,051 INFO L87 Difference]: Start difference. First operand 208 states and 247 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:39,068 INFO L93 Difference]: Finished difference Result 374 states and 453 transitions. [2022-07-19 21:59:39,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:59:39,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2022-07-19 21:59:39,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:39,069 INFO L225 Difference]: With dead ends: 374 [2022-07-19 21:59:39,069 INFO L226 Difference]: Without dead ends: 196 [2022-07-19 21:59:39,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:59:39,070 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 34 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:39,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 364 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:59:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-19 21:59:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 192. [2022-07-19 21:59:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 140 states have (on average 1.1071428571428572) internal successors, (155), 144 states have internal predecessors, (155), 31 states have call successors, (31), 20 states have call predecessors, (31), 20 states have return successors, (38), 27 states have call predecessors, (38), 29 states have call successors, (38) [2022-07-19 21:59:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 224 transitions. [2022-07-19 21:59:39,077 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 224 transitions. Word has length 94 [2022-07-19 21:59:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:39,078 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 224 transitions. [2022-07-19 21:59:39,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 224 transitions. [2022-07-19 21:59:39,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-19 21:59:39,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:39,079 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:39,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 21:59:39,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:39,286 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:39,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:39,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1730782770, now seen corresponding path program 1 times [2022-07-19 21:59:39,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:39,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134521242] [2022-07-19 21:59:39,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 21:59:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 21:59:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 21:59:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 21:59:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:59:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-19 21:59:39,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:39,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134521242] [2022-07-19 21:59:39,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134521242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:39,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:39,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:59:39,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032776410] [2022-07-19 21:59:39,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:39,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:59:39,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:39,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:59:39,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:59:39,535 INFO L87 Difference]: Start difference. First operand 192 states and 224 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-19 21:59:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:39,735 INFO L93 Difference]: Finished difference Result 215 states and 246 transitions. [2022-07-19 21:59:39,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:59:39,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2022-07-19 21:59:39,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:39,736 INFO L225 Difference]: With dead ends: 215 [2022-07-19 21:59:39,736 INFO L226 Difference]: Without dead ends: 171 [2022-07-19 21:59:39,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:59:39,737 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 76 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:39,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 189 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 21:59:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-19 21:59:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-19 21:59:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 126 states have (on average 1.1111111111111112) internal successors, (140), 129 states have internal predecessors, (140), 27 states have call successors, (27), 17 states have call predecessors, (27), 17 states have return successors, (34), 24 states have call predecessors, (34), 25 states have call successors, (34) [2022-07-19 21:59:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2022-07-19 21:59:39,743 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 97 [2022-07-19 21:59:39,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:39,744 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2022-07-19 21:59:39,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-19 21:59:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2022-07-19 21:59:39,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-19 21:59:39,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:39,745 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:39,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 21:59:39,745 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:39,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:39,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1045365502, now seen corresponding path program 1 times [2022-07-19 21:59:39,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:39,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302716396] [2022-07-19 21:59:39,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:39,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 21:59:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 21:59:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-19 21:59:39,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:39,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302716396] [2022-07-19 21:59:39,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302716396] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:39,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516122938] [2022-07-19 21:59:39,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:39,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:39,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:39,922 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:59:39,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 21:59:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:40,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 2573 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-19 21:59:40,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:40,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 21:59:40,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 21:59:40,673 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:59:40,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 11 [2022-07-19 21:59:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-19 21:59:40,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:40,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516122938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:40,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:40,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2022-07-19 21:59:40,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552584532] [2022-07-19 21:59:40,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:40,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 21:59:40,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:40,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 21:59:40,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-07-19 21:59:40,690 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 10 states have internal predecessors, (59), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 21:59:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:40,829 INFO L93 Difference]: Finished difference Result 333 states and 388 transitions. [2022-07-19 21:59:40,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 21:59:40,830 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 10 states have internal predecessors, (59), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 98 [2022-07-19 21:59:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:40,831 INFO L225 Difference]: With dead ends: 333 [2022-07-19 21:59:40,831 INFO L226 Difference]: Without dead ends: 239 [2022-07-19 21:59:40,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 99 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2022-07-19 21:59:40,832 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 29 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:40,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 650 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-07-19 21:59:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-19 21:59:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 225. [2022-07-19 21:59:40,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 170 states have (on average 1.111764705882353) internal successors, (189), 174 states have internal predecessors, (189), 32 states have call successors, (32), 21 states have call predecessors, (32), 22 states have return successors, (45), 29 states have call predecessors, (45), 30 states have call successors, (45) [2022-07-19 21:59:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2022-07-19 21:59:40,839 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 98 [2022-07-19 21:59:40,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:40,840 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2022-07-19 21:59:40,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 10 states have internal predecessors, (59), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 21:59:40,840 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2022-07-19 21:59:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-19 21:59:40,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:40,841 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:40,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 21:59:41,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 21:59:41,047 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:41,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:41,048 INFO L85 PathProgramCache]: Analyzing trace with hash 590802921, now seen corresponding path program 1 times [2022-07-19 21:59:41,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:41,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668972984] [2022-07-19 21:59:41,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:41,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 21:59:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 21:59:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-19 21:59:41,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:41,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668972984] [2022-07-19 21:59:41,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668972984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:41,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:41,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:59:41,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615832149] [2022-07-19 21:59:41,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:41,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:59:41,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:41,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:59:41,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:59:41,267 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:41,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:41,615 INFO L93 Difference]: Finished difference Result 275 states and 322 transitions. [2022-07-19 21:59:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:59:41,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2022-07-19 21:59:41,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:41,617 INFO L225 Difference]: With dead ends: 275 [2022-07-19 21:59:41,617 INFO L226 Difference]: Without dead ends: 235 [2022-07-19 21:59:41,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-07-19 21:59:41,618 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 110 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:41,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 258 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:59:41,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-19 21:59:41,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 230. [2022-07-19 21:59:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 174 states have (on average 1.1091954022988506) internal successors, (193), 179 states have internal predecessors, (193), 32 states have call successors, (32), 21 states have call predecessors, (32), 23 states have return successors, (46), 29 states have call predecessors, (46), 30 states have call successors, (46) [2022-07-19 21:59:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 271 transitions. [2022-07-19 21:59:41,626 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 271 transitions. Word has length 100 [2022-07-19 21:59:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:41,626 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 271 transitions. [2022-07-19 21:59:41,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 271 transitions. [2022-07-19 21:59:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-19 21:59:41,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:41,628 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:41,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 21:59:41,628 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:41,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:41,628 INFO L85 PathProgramCache]: Analyzing trace with hash -585376130, now seen corresponding path program 1 times [2022-07-19 21:59:41,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:41,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538326058] [2022-07-19 21:59:41,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:41,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 21:59:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 21:59:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-19 21:59:41,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:41,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538326058] [2022-07-19 21:59:41,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538326058] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:41,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203364807] [2022-07-19 21:59:41,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:41,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:41,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:41,820 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:59:41,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 21:59:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 2573 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:59:42,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-19 21:59:42,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:42,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203364807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:42,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:42,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-07-19 21:59:42,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215507046] [2022-07-19 21:59:42,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:42,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:59:42,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:42,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:59:42,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-19 21:59:42,306 INFO L87 Difference]: Start difference. First operand 230 states and 271 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-19 21:59:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:42,414 INFO L93 Difference]: Finished difference Result 365 states and 425 transitions. [2022-07-19 21:59:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:59:42,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2022-07-19 21:59:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:42,416 INFO L225 Difference]: With dead ends: 365 [2022-07-19 21:59:42,416 INFO L226 Difference]: Without dead ends: 221 [2022-07-19 21:59:42,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:59:42,417 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 6 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:42,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 431 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2022-07-19 21:59:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-19 21:59:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-07-19 21:59:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 166 states have (on average 1.1024096385542168) internal successors, (183), 170 states have internal predecessors, (183), 32 states have call successors, (32), 21 states have call predecessors, (32), 22 states have return successors, (43), 29 states have call predecessors, (43), 30 states have call successors, (43) [2022-07-19 21:59:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 258 transitions. [2022-07-19 21:59:42,424 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 258 transitions. Word has length 98 [2022-07-19 21:59:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:42,424 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 258 transitions. [2022-07-19 21:59:42,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-19 21:59:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 258 transitions. [2022-07-19 21:59:42,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-19 21:59:42,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:42,426 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:42,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 21:59:42,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:42,646 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:42,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:42,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1989518094, now seen corresponding path program 1 times [2022-07-19 21:59:42,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:42,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124052473] [2022-07-19 21:59:42,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:42,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 21:59:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 21:59:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-19 21:59:42,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:42,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124052473] [2022-07-19 21:59:42,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124052473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:42,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:42,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 21:59:42,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650693224] [2022-07-19 21:59:42,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:42,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:59:42,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:42,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:59:42,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:59:42,822 INFO L87 Difference]: Start difference. First operand 221 states and 258 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-19 21:59:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:43,272 INFO L93 Difference]: Finished difference Result 235 states and 274 transitions. [2022-07-19 21:59:43,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:59:43,273 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2022-07-19 21:59:43,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:43,274 INFO L225 Difference]: With dead ends: 235 [2022-07-19 21:59:43,274 INFO L226 Difference]: Without dead ends: 233 [2022-07-19 21:59:43,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-07-19 21:59:43,275 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 91 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:43,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 407 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 21:59:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-19 21:59:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2022-07-19 21:59:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 171 states have (on average 1.0994152046783625) internal successors, (188), 176 states have internal predecessors, (188), 32 states have call successors, (32), 21 states have call predecessors, (32), 23 states have return successors, (46), 29 states have call predecessors, (46), 30 states have call successors, (46) [2022-07-19 21:59:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 266 transitions. [2022-07-19 21:59:43,282 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 266 transitions. Word has length 102 [2022-07-19 21:59:43,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:43,282 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 266 transitions. [2022-07-19 21:59:43,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-19 21:59:43,282 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 266 transitions. [2022-07-19 21:59:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-19 21:59:43,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:43,283 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:43,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 21:59:43,283 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:43,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:43,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1604384624, now seen corresponding path program 2 times [2022-07-19 21:59:43,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:43,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114765582] [2022-07-19 21:59:43,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:43,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 21:59:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 21:59:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-19 21:59:43,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:43,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114765582] [2022-07-19 21:59:43,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114765582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:43,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:43,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:59:43,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934855383] [2022-07-19 21:59:43,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:43,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:59:43,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:43,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:59:43,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:59:43,489 INFO L87 Difference]: Start difference. First operand 227 states and 266 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:43,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:43,818 INFO L93 Difference]: Finished difference Result 267 states and 310 transitions. [2022-07-19 21:59:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:59:43,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 102 [2022-07-19 21:59:43,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:43,819 INFO L225 Difference]: With dead ends: 267 [2022-07-19 21:59:43,820 INFO L226 Difference]: Without dead ends: 227 [2022-07-19 21:59:43,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:59:43,820 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 100 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:43,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 232 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:59:43,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-19 21:59:43,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2022-07-19 21:59:43,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 171 states have (on average 1.0994152046783625) internal successors, (188), 176 states have internal predecessors, (188), 32 states have call successors, (32), 21 states have call predecessors, (32), 23 states have return successors, (44), 29 states have call predecessors, (44), 30 states have call successors, (44) [2022-07-19 21:59:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 264 transitions. [2022-07-19 21:59:43,828 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 264 transitions. Word has length 102 [2022-07-19 21:59:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:43,828 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 264 transitions. [2022-07-19 21:59:43,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 21:59:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-07-19 21:59:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 21:59:43,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:43,829 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:43,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 21:59:43,830 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:43,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:43,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1126798311, now seen corresponding path program 1 times [2022-07-19 21:59:43,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:43,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990856495] [2022-07-19 21:59:43,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:43,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:44,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:44,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:44,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:44,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:44,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:44,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 21:59:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:44,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:44,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:59:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:44,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:59:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:44,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:59:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:44,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 21:59:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-19 21:59:44,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:44,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990856495] [2022-07-19 21:59:44,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990856495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:44,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:44,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 21:59:44,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109340106] [2022-07-19 21:59:44,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:44,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 21:59:44,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:44,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 21:59:44,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:59:44,355 INFO L87 Difference]: Start difference. First operand 227 states and 264 transitions. Second operand has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 8 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-19 21:59:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:45,142 INFO L93 Difference]: Finished difference Result 261 states and 308 transitions. [2022-07-19 21:59:45,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:59:45,143 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 8 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) Word has length 106 [2022-07-19 21:59:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:45,144 INFO L225 Difference]: With dead ends: 261 [2022-07-19 21:59:45,144 INFO L226 Difference]: Without dead ends: 259 [2022-07-19 21:59:45,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-07-19 21:59:45,145 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 166 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:45,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 215 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 21:59:45,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-19 21:59:45,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 252. [2022-07-19 21:59:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 193 states have internal predecessors, (205), 37 states have call successors, (37), 22 states have call predecessors, (37), 27 states have return successors, (55), 36 states have call predecessors, (55), 35 states have call successors, (55) [2022-07-19 21:59:45,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 297 transitions. [2022-07-19 21:59:45,156 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 297 transitions. Word has length 106 [2022-07-19 21:59:45,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:45,157 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 297 transitions. [2022-07-19 21:59:45,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 8 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-19 21:59:45,157 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 297 transitions. [2022-07-19 21:59:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-19 21:59:45,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:45,158 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:45,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 21:59:45,159 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:45,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:45,159 INFO L85 PathProgramCache]: Analyzing trace with hash -589292466, now seen corresponding path program 1 times [2022-07-19 21:59:45,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:45,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208684034] [2022-07-19 21:59:45,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:45,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:45,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:45,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:45,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:45,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:45,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:45,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:45,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:45,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 21:59:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:45,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:59:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:45,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:45,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:45,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 21:59:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-19 21:59:45,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:45,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208684034] [2022-07-19 21:59:45,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208684034] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:45,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59797322] [2022-07-19 21:59:45,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:45,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:45,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:45,527 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:59:45,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 21:59:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:45,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 2670 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-19 21:59:45,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:46,473 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-19 21:59:46,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 1 [2022-07-19 21:59:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 61 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 21:59:46,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:59:46,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-19 21:59:46,799 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 21:59:46,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2022-07-19 21:59:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-19 21:59:46,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59797322] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:59:46,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:59:46,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 29 [2022-07-19 21:59:46,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926750078] [2022-07-19 21:59:46,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:59:46,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-19 21:59:46,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:46,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-19 21:59:46,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2022-07-19 21:59:46,833 INFO L87 Difference]: Start difference. First operand 252 states and 297 transitions. Second operand has 29 states, 27 states have (on average 4.851851851851852) internal successors, (131), 23 states have internal predecessors, (131), 9 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (23), 5 states have call predecessors, (23), 7 states have call successors, (23) [2022-07-19 21:59:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:48,584 INFO L93 Difference]: Finished difference Result 458 states and 534 transitions. [2022-07-19 21:59:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-19 21:59:48,585 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 4.851851851851852) internal successors, (131), 23 states have internal predecessors, (131), 9 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (23), 5 states have call predecessors, (23), 7 states have call successors, (23) Word has length 112 [2022-07-19 21:59:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:48,586 INFO L225 Difference]: With dead ends: 458 [2022-07-19 21:59:48,586 INFO L226 Difference]: Without dead ends: 278 [2022-07-19 21:59:48,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 235 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=359, Invalid=2091, Unknown=0, NotChecked=0, Total=2450 [2022-07-19 21:59:48,588 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 252 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:48,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 389 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1606 Invalid, 0 Unknown, 409 Unchecked, 1.0s Time] [2022-07-19 21:59:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-19 21:59:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 261. [2022-07-19 21:59:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 195 states have (on average 1.0974358974358975) internal successors, (214), 200 states have internal predecessors, (214), 37 states have call successors, (37), 24 states have call predecessors, (37), 28 states have return successors, (52), 36 states have call predecessors, (52), 35 states have call successors, (52) [2022-07-19 21:59:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 303 transitions. [2022-07-19 21:59:48,599 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 303 transitions. Word has length 112 [2022-07-19 21:59:48,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:48,599 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 303 transitions. [2022-07-19 21:59:48,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 4.851851851851852) internal successors, (131), 23 states have internal predecessors, (131), 9 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (23), 5 states have call predecessors, (23), 7 states have call successors, (23) [2022-07-19 21:59:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 303 transitions. [2022-07-19 21:59:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-19 21:59:48,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:48,601 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:48,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 21:59:48,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-19 21:59:48,821 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:48,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1476515312, now seen corresponding path program 1 times [2022-07-19 21:59:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:48,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894895768] [2022-07-19 21:59:48,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:48,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 21:59:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:59:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 21:59:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-19 21:59:49,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:49,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894895768] [2022-07-19 21:59:49,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894895768] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:49,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757411744] [2022-07-19 21:59:49,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:49,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:49,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:49,230 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:59:49,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 21:59:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 2665 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-19 21:59:49,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:49,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:59:49,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:59:49,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 21:59:49,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 21:59:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 21:59:49,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:49,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757411744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:49,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:49,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 24 [2022-07-19 21:59:49,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899454727] [2022-07-19 21:59:49,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:49,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:59:49,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:49,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:59:49,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2022-07-19 21:59:49,865 INFO L87 Difference]: Start difference. First operand 261 states and 303 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-19 21:59:50,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:50,116 INFO L93 Difference]: Finished difference Result 410 states and 468 transitions. [2022-07-19 21:59:50,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 21:59:50,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 112 [2022-07-19 21:59:50,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:50,118 INFO L225 Difference]: With dead ends: 410 [2022-07-19 21:59:50,118 INFO L226 Difference]: Without dead ends: 268 [2022-07-19 21:59:50,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2022-07-19 21:59:50,119 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 52 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:50,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 812 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-07-19 21:59:50,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-19 21:59:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-07-19 21:59:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 200 states have (on average 1.095) internal successors, (219), 204 states have internal predecessors, (219), 38 states have call successors, (38), 25 states have call predecessors, (38), 29 states have return successors, (53), 38 states have call predecessors, (53), 36 states have call successors, (53) [2022-07-19 21:59:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 310 transitions. [2022-07-19 21:59:50,129 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 310 transitions. Word has length 112 [2022-07-19 21:59:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:50,130 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 310 transitions. [2022-07-19 21:59:50,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-19 21:59:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 310 transitions. [2022-07-19 21:59:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-19 21:59:50,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:50,147 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:50,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 21:59:50,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-19 21:59:50,348 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:50,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1680736505, now seen corresponding path program 1 times [2022-07-19 21:59:50,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:50,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478504726] [2022-07-19 21:59:50,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:50,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:50,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:50,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:50,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:50,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:50,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:50,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 21:59:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:50,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:50,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:59:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:50,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:59:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:50,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:59:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:50,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 21:59:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:50,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 21:59:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-19 21:59:50,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:50,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478504726] [2022-07-19 21:59:50,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478504726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:50,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:50,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-19 21:59:50,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490075434] [2022-07-19 21:59:50,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:50,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 21:59:50,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:50,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 21:59:50,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:59:50,916 INFO L87 Difference]: Start difference. First operand 268 states and 310 transitions. Second operand has 15 states, 13 states have (on average 4.461538461538462) internal successors, (58), 11 states have internal predecessors, (58), 8 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-19 21:59:51,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:51,666 INFO L93 Difference]: Finished difference Result 281 states and 324 transitions. [2022-07-19 21:59:51,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:59:51,667 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.461538461538462) internal successors, (58), 11 states have internal predecessors, (58), 8 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) Word has length 112 [2022-07-19 21:59:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:51,668 INFO L225 Difference]: With dead ends: 281 [2022-07-19 21:59:51,668 INFO L226 Difference]: Without dead ends: 279 [2022-07-19 21:59:51,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-07-19 21:59:51,669 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 181 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:51,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 223 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 21:59:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-19 21:59:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 274. [2022-07-19 21:59:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 204 states have (on average 1.0931372549019607) internal successors, (223), 208 states have internal predecessors, (223), 39 states have call successors, (39), 26 states have call predecessors, (39), 30 states have return successors, (54), 39 states have call predecessors, (54), 37 states have call successors, (54) [2022-07-19 21:59:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 316 transitions. [2022-07-19 21:59:51,683 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 316 transitions. Word has length 112 [2022-07-19 21:59:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:51,683 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 316 transitions. [2022-07-19 21:59:51,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.461538461538462) internal successors, (58), 11 states have internal predecessors, (58), 8 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-19 21:59:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 316 transitions. [2022-07-19 21:59:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-19 21:59:51,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:51,684 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:51,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 21:59:51,685 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:51,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:51,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1114984106, now seen corresponding path program 1 times [2022-07-19 21:59:51,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:51,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315609817] [2022-07-19 21:59:51,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:51,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 21:59:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:59:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 21:59:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-19 21:59:51,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:51,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315609817] [2022-07-19 21:59:51,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315609817] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:51,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802072809] [2022-07-19 21:59:51,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:51,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:51,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:51,889 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:59:51,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 21:59:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 2672 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-19 21:59:52,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:52,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 21:59:52,695 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:59:52,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 13 [2022-07-19 21:59:52,798 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 47 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 21:59:52,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:59:53,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-19 21:59:53,236 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-19 21:59:53,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2022-07-19 21:59:53,252 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-19 21:59:53,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802072809] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:59:53,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:59:53,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 14] total 34 [2022-07-19 21:59:53,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57279687] [2022-07-19 21:59:53,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:59:53,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 21:59:53,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:53,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 21:59:53,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2022-07-19 21:59:53,254 INFO L87 Difference]: Start difference. First operand 274 states and 316 transitions. Second operand has 34 states, 29 states have (on average 4.931034482758621) internal successors, (143), 27 states have internal predecessors, (143), 16 states have call successors, (34), 7 states have call predecessors, (34), 8 states have return successors, (30), 11 states have call predecessors, (30), 14 states have call successors, (30) [2022-07-19 21:59:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:55,609 INFO L93 Difference]: Finished difference Result 490 states and 556 transitions. [2022-07-19 21:59:55,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-19 21:59:55,610 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 4.931034482758621) internal successors, (143), 27 states have internal predecessors, (143), 16 states have call successors, (34), 7 states have call predecessors, (34), 8 states have return successors, (30), 11 states have call predecessors, (30), 14 states have call successors, (30) Word has length 116 [2022-07-19 21:59:55,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:55,611 INFO L225 Difference]: With dead ends: 490 [2022-07-19 21:59:55,611 INFO L226 Difference]: Without dead ends: 254 [2022-07-19 21:59:55,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 228 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=502, Invalid=5346, Unknown=4, NotChecked=0, Total=5852 [2022-07-19 21:59:55,613 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 278 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 2802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:55,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 802 Invalid, 2802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2431 Invalid, 0 Unknown, 256 Unchecked, 1.1s Time] [2022-07-19 21:59:55,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-19 21:59:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2022-07-19 21:59:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 176 states have (on average 1.0625) internal successors, (187), 178 states have internal predecessors, (187), 37 states have call successors, (37), 25 states have call predecessors, (37), 26 states have return successors, (47), 36 states have call predecessors, (47), 35 states have call successors, (47) [2022-07-19 21:59:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 271 transitions. [2022-07-19 21:59:55,623 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 271 transitions. Word has length 116 [2022-07-19 21:59:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:55,623 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 271 transitions. [2022-07-19 21:59:55,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 4.931034482758621) internal successors, (143), 27 states have internal predecessors, (143), 16 states have call successors, (34), 7 states have call predecessors, (34), 8 states have return successors, (30), 11 states have call predecessors, (30), 14 states have call successors, (30) [2022-07-19 21:59:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 271 transitions. [2022-07-19 21:59:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-19 21:59:55,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:55,625 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:55,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 21:59:55,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-19 21:59:55,839 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:55,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:55,839 INFO L85 PathProgramCache]: Analyzing trace with hash -959716687, now seen corresponding path program 1 times [2022-07-19 21:59:55,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:55,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933864933] [2022-07-19 21:59:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:55,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:56,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:56,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:56,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:56,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:56,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:56,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:56,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 21:59:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:56,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:56,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:59:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:56,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:59:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:56,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:59:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:56,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 21:59:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:56,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 21:59:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:56,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 21:59:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-19 21:59:56,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:56,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933864933] [2022-07-19 21:59:56,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933864933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:56,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:56,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 21:59:56,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616312207] [2022-07-19 21:59:56,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:56,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 21:59:56,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:56,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 21:59:56,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:59:56,311 INFO L87 Difference]: Start difference. First operand 240 states and 271 transitions. Second operand has 14 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 8 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-07-19 21:59:56,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:56,984 INFO L93 Difference]: Finished difference Result 251 states and 282 transitions. [2022-07-19 21:59:56,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:59:56,984 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 8 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 118 [2022-07-19 21:59:56,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:56,985 INFO L225 Difference]: With dead ends: 251 [2022-07-19 21:59:56,985 INFO L226 Difference]: Without dead ends: 249 [2022-07-19 21:59:56,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-07-19 21:59:56,986 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 221 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:56,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 200 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 21:59:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-19 21:59:56,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2022-07-19 21:59:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 180 states have (on average 1.0611111111111111) internal successors, (191), 182 states have internal predecessors, (191), 38 states have call successors, (38), 26 states have call predecessors, (38), 27 states have return successors, (48), 37 states have call predecessors, (48), 36 states have call successors, (48) [2022-07-19 21:59:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 277 transitions. [2022-07-19 21:59:57,000 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 277 transitions. Word has length 118 [2022-07-19 21:59:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:57,000 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 277 transitions. [2022-07-19 21:59:57,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 8 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-07-19 21:59:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 277 transitions. [2022-07-19 21:59:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-19 21:59:57,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:57,001 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:57,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 21:59:57,002 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:57,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:57,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1201655876, now seen corresponding path program 1 times [2022-07-19 21:59:57,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:57,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114965638] [2022-07-19 21:59:57,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:57,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 21:59:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 21:59:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:59:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-19 21:59:57,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:57,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114965638] [2022-07-19 21:59:57,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114965638] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:57,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:57,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:59:57,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525933242] [2022-07-19 21:59:57,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:57,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:59:57,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:57,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:59:57,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:59:57,154 INFO L87 Difference]: Start difference. First operand 246 states and 277 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 21:59:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:57,373 INFO L93 Difference]: Finished difference Result 342 states and 372 transitions. [2022-07-19 21:59:57,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:59:57,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2022-07-19 21:59:57,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:57,376 INFO L225 Difference]: With dead ends: 342 [2022-07-19 21:59:57,376 INFO L226 Difference]: Without dead ends: 236 [2022-07-19 21:59:57,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 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-07-19 21:59:57,377 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 109 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:57,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 156 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 21:59:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-19 21:59:57,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2022-07-19 21:59:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 173 states have (on average 1.0578034682080926) internal successors, (183), 174 states have internal predecessors, (183), 36 states have call successors, (36), 26 states have call predecessors, (36), 25 states have return successors, (42), 34 states have call predecessors, (42), 34 states have call successors, (42) [2022-07-19 21:59:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 261 transitions. [2022-07-19 21:59:57,395 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 261 transitions. Word has length 119 [2022-07-19 21:59:57,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:57,396 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 261 transitions. [2022-07-19 21:59:57,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 21:59:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 261 transitions. [2022-07-19 21:59:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-19 21:59:57,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:57,397 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:57,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-19 21:59:57,397 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:57,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1430669570, now seen corresponding path program 1 times [2022-07-19 21:59:57,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:57,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280893671] [2022-07-19 21:59:57,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:57,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:59:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 21:59:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:58,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 21:59:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:58,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 21:59:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:58,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:58,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:58,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 21:59:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-19 21:59:58,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:58,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280893671] [2022-07-19 21:59:58,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280893671] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:58,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94765431] [2022-07-19 21:59:58,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:58,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:58,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:58,504 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:59:58,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 21:59:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:58,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 2700 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-19 21:59:58,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:58,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:59:59,051 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 21:59:59,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 21:59:59,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 22:00:01,065 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_24| Int)) (not (= |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_24| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8)))) is different from true [2022-07-19 22:00:03,111 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_25| Int)) (not (= |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_25| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_25|) 8)))) is different from true [2022-07-19 22:00:05,146 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_17| Int)) (not (= |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_17| (select (select |c_#memory_$Pointer$.base| |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_17|) 8)))) is different from true [2022-07-19 22:00:11,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 22:00:11,651 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1446 (Array Int Int))) (= (store |c_old(#memory_int)| |c_memset_impl_#in~s.base| v_ArrVal_1446) |c_#memory_int|)) is different from true [2022-07-19 22:00:11,663 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1446 (Array Int Int))) (= (store |c_old(#memory_int)| |c_my_memset_#in~s.base| v_ArrVal_1446) |c_#memory_int|)) is different from true [2022-07-19 22:00:11,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-07-19 22:00:11,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-19 22:00:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 8 proven. 28 refuted. 6 times theorem prover too weak. 4 trivial. 42 not checked. [2022-07-19 22:00:16,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:00:16,362 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1454 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_aws_byte_buf_secure_zero_aws_secure_zero_~pBuf#1.base| v_ArrVal_1454) |c_aws_byte_buf_secure_zero_~buf#1.base|) (+ 16 |c_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2022-07-19 22:00:16,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94765431] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:00:16,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:00:16,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 32] total 46 [2022-07-19 22:00:16,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911616806] [2022-07-19 22:00:16,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:00:16,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-19 22:00:16,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:00:16,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-19 22:00:16,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1830, Unknown=8, NotChecked=546, Total=2550 [2022-07-19 22:00:16,365 INFO L87 Difference]: Start difference. First operand 235 states and 261 transitions. Second operand has 46 states, 41 states have (on average 3.682926829268293) internal successors, (151), 39 states have internal predecessors, (151), 14 states have call successors, (24), 13 states have call predecessors, (24), 14 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-19 22:01:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:01:27,438 INFO L93 Difference]: Finished difference Result 335 states and 369 transitions. [2022-07-19 22:01:27,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-19 22:01:27,438 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 3.682926829268293) internal successors, (151), 39 states have internal predecessors, (151), 14 states have call successors, (24), 13 states have call predecessors, (24), 14 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) Word has length 121 [2022-07-19 22:01:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:01:27,440 INFO L225 Difference]: With dead ends: 335 [2022-07-19 22:01:27,440 INFO L226 Difference]: Without dead ends: 268 [2022-07-19 22:01:27,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 140 SyntacticMatches, 11 SemanticMatches, 79 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 87.4s TimeCoverageRelationStatistics Valid=461, Invalid=5036, Unknown=77, NotChecked=906, Total=6480 [2022-07-19 22:01:27,442 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 291 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 3941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1989 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:01:27,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 718 Invalid, 3941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1741 Invalid, 0 Unknown, 1989 Unchecked, 0.9s Time] [2022-07-19 22:01:27,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-19 22:01:27,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 263. [2022-07-19 22:01:27,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 196 states have (on average 1.0561224489795917) internal successors, (207), 198 states have internal predecessors, (207), 38 states have call successors, (38), 28 states have call predecessors, (38), 28 states have return successors, (47), 36 states have call predecessors, (47), 36 states have call successors, (47) [2022-07-19 22:01:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2022-07-19 22:01:27,456 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 121 [2022-07-19 22:01:27,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:01:27,457 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2022-07-19 22:01:27,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 3.682926829268293) internal successors, (151), 39 states have internal predecessors, (151), 14 states have call successors, (24), 13 states have call predecessors, (24), 14 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-19 22:01:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2022-07-19 22:01:27,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-19 22:01:27,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:01:27,459 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:01:27,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-19 22:01:27,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:01:27,679 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:01:27,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:01:27,680 INFO L85 PathProgramCache]: Analyzing trace with hash -65138626, now seen corresponding path program 1 times [2022-07-19 22:01:27,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:01:27,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060796986] [2022-07-19 22:01:27,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:01:27,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:01:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:28,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:01:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:28,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:01:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:28,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 22:01:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:28,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:01:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:28,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 22:01:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:28,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:01:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:28,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:01:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:28,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 22:01:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:28,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:01:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:28,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:01:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:28,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:01:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:28,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:01:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-19 22:01:28,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:01:28,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060796986] [2022-07-19 22:01:28,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060796986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:01:28,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583264360] [2022-07-19 22:01:28,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:01:28,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:01:28,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:01:28,742 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:01:28,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-19 22:01:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:29,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 2710 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-19 22:01:29,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:01:29,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:01:29,259 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 22:01:29,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 22:01:29,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:01:29,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 22:01:31,275 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_29| Int)) (not (= |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_29| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_29|) 8)))) is different from true [2022-07-19 22:01:33,308 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_30| Int)) (not (= |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_30| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_30|) 8)))) is different from true [2022-07-19 22:01:35,345 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_22| Int)) (not (= |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$.base| |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_22|) 8)))) is different from true [2022-07-19 22:01:43,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 22:01:43,829 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1553 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_memset_impl_#in~s.base| v_ArrVal_1553))) is different from true [2022-07-19 22:01:43,839 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1553 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_my_memset_#in~s.base| v_ArrVal_1553))) is different from true [2022-07-19 22:01:43,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-07-19 22:01:43,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-19 22:01:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 8 proven. 29 refuted. 5 times theorem prover too weak. 4 trivial. 42 not checked. [2022-07-19 22:01:46,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:01:46,479 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1561 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_aws_byte_buf_secure_zero_aws_secure_zero_~pBuf#1.base| v_ArrVal_1561) |c_aws_byte_buf_secure_zero_~buf#1.base|) (+ 16 |c_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2022-07-19 22:01:46,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583264360] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:01:46,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:01:46,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 33] total 46 [2022-07-19 22:01:46,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651718493] [2022-07-19 22:01:46,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:01:46,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-19 22:01:46,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:01:46,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-19 22:01:46,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1824, Unknown=7, NotChecked=546, Total=2550 [2022-07-19 22:01:46,481 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand has 46 states, 41 states have (on average 3.658536585365854) internal successors, (150), 39 states have internal predecessors, (150), 14 states have call successors, (24), 13 states have call predecessors, (24), 14 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-19 22:03:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:15,592 INFO L93 Difference]: Finished difference Result 475 states and 544 transitions. [2022-07-19 22:03:15,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-19 22:03:15,592 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 3.658536585365854) internal successors, (150), 39 states have internal predecessors, (150), 14 states have call successors, (24), 13 states have call predecessors, (24), 14 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) Word has length 121 [2022-07-19 22:03:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:15,594 INFO L225 Difference]: With dead ends: 475 [2022-07-19 22:03:15,594 INFO L226 Difference]: Without dead ends: 385 [2022-07-19 22:03:15,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 141 SyntacticMatches, 12 SemanticMatches, 81 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1496 ImplicationChecksByTransitivity, 105.2s TimeCoverageRelationStatistics Valid=509, Invalid=5280, Unknown=87, NotChecked=930, Total=6806 [2022-07-19 22:03:15,596 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 293 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 2059 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 4667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 2059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2355 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:15,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 897 Invalid, 4667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 2059 Invalid, 0 Unknown, 2355 Unchecked, 1.2s Time] [2022-07-19 22:03:15,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-07-19 22:03:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 357. [2022-07-19 22:03:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 264 states have (on average 1.053030303030303) internal successors, (278), 265 states have internal predecessors, (278), 56 states have call successors, (56), 37 states have call predecessors, (56), 36 states have return successors, (74), 54 states have call predecessors, (74), 54 states have call successors, (74) [2022-07-19 22:03:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 408 transitions. [2022-07-19 22:03:15,617 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 408 transitions. Word has length 121 [2022-07-19 22:03:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:15,617 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 408 transitions. [2022-07-19 22:03:15,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 3.658536585365854) internal successors, (150), 39 states have internal predecessors, (150), 14 states have call successors, (24), 13 states have call predecessors, (24), 14 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-19 22:03:15,618 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 408 transitions. [2022-07-19 22:03:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-19 22:03:15,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:15,619 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:15,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 22:03:15,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:15,839 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:15,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:15,840 INFO L85 PathProgramCache]: Analyzing trace with hash 769710831, now seen corresponding path program 1 times [2022-07-19 22:03:15,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:15,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302784870] [2022-07-19 22:03:15,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:15,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:16,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:03:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:16,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:03:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:03:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:16,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:03:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:16,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:03:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:16,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 22:03:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:16,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:03:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:16,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:03:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:16,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:03:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:16,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 22:03:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:03:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:16,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:03:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:16,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 22:03:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-19 22:03:16,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:16,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302784870] [2022-07-19 22:03:16,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302784870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:16,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111962779] [2022-07-19 22:03:16,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:16,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:16,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:16,907 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:03:16,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-19 22:03:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:17,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 2723 conjuncts, 106 conjunts are in the unsatisfiable core [2022-07-19 22:03:17,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:03:17,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:03:17,443 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 22:03:17,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 22:03:17,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 22:03:19,456 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_35| Int)) (not (= |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_35| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_35|) 8)))) is different from true [2022-07-19 22:03:21,485 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_36| Int)) (not (= |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_36| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_36|) 8)))) is different from true [2022-07-19 22:03:23,518 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_27| Int)) (not (= |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_27| (select (select |c_#memory_$Pointer$.base| |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_27|) 8)))) is different from true [2022-07-19 22:03:29,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 22:03:29,958 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1659 (Array Int Int))) (= (store |c_old(#memory_int)| |c_memset_impl_#in~s.base| v_ArrVal_1659) |c_#memory_int|)) is different from true [2022-07-19 22:03:29,966 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1659 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_my_memset_#in~s.base| v_ArrVal_1659))) is different from true [2022-07-19 22:03:29,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-07-19 22:03:29,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-19 22:03:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 8 proven. 28 refuted. 6 times theorem prover too weak. 4 trivial. 42 not checked. [2022-07-19 22:03:34,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:03:34,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_aws_byte_buf_secure_zero_aws_secure_zero_~pBuf#1.base| v_ArrVal_1667) |c_aws_byte_buf_secure_zero_~buf#1.base|) (+ 16 |c_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2022-07-19 22:03:34,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111962779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:34,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:03:34,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32] total 45 [2022-07-19 22:03:34,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330569532] [2022-07-19 22:03:34,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:03:34,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-19 22:03:34,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:34,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-19 22:03:34,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1749, Unknown=8, NotChecked=534, Total=2450 [2022-07-19 22:03:34,556 INFO L87 Difference]: Start difference. First operand 357 states and 408 transitions. Second operand has 45 states, 40 states have (on average 3.875) internal successors, (155), 38 states have internal predecessors, (155), 14 states have call successors, (26), 13 states have call predecessors, (26), 14 states have return successors, (23), 11 states have call predecessors, (23), 12 states have call successors, (23)