./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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_string_eq_byte_buf_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 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 09:52:14,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:52:14,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:52:14,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:52:14,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:52:14,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:52:14,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:52:14,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:52:14,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:52:14,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:52:14,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:52:14,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:52:14,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:52:14,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:52:14,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:52:14,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:52:14,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:52:14,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:52:14,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:52:14,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:52:14,797 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:52:14,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:52:14,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:52:14,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:52:14,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:52:14,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:52:14,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:52:14,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:52:14,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:52:14,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:52:14,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:52:14,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:52:14,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:52:14,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:52:14,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:52:14,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:52:14,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:52:14,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:52:14,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:52:14,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:52:14,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:52:14,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:52:14,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 09:52:14,838 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:52:14,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:52:14,840 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:52:14,840 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:52:14,841 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:52:14,841 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:52:14,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:52:14,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:52:14,842 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:52:14,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:52:14,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 09:52:14,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:52:14,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:52:14,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:52:14,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:52:14,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:52:14,844 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:52:14,844 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:52:14,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:52:14,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:52:14,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:52:14,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:52:14,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:52:14,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:52:14,851 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:52:14,851 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 09:52:14,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 09:52:14,851 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:52:14,852 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:52:14,852 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:52:14,852 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 -> 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce [2022-07-21 09:52:15,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:52:15,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:52:15,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:52:15,135 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:52:15,135 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:52:15,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2022-07-21 09:52:15,180 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcba6e9be/f54d9f96410e4a19afeb7aaaac4afbb2/FLAGd800e9eef [2022-07-21 09:52:15,718 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:52:15,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2022-07-21 09:52:15,743 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcba6e9be/f54d9f96410e4a19afeb7aaaac4afbb2/FLAGd800e9eef [2022-07-21 09:52:16,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcba6e9be/f54d9f96410e4a19afeb7aaaac4afbb2 [2022-07-21 09:52:16,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:52:16,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:52:16,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:52:16,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:52:16,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:52:16,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:52:16" (1/1) ... [2022-07-21 09:52:16,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb70c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:16, skipping insertion in model container [2022-07-21 09:52:16,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:52:16" (1/1) ... [2022-07-21 09:52:16,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:52:16,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:52:16,424 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_string_eq_byte_buf_harness.i[4496,4509] [2022-07-21 09:52:16,429 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_string_eq_byte_buf_harness.i[4556,4569] [2022-07-21 09:52:17,109 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,110 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,111 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,112 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,113 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,131 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,131 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,133 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,133 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,351 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-21 09:52:17,353 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-21 09:52:17,354 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-21 09:52:17,354 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-21 09:52:17,355 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-21 09:52:17,355 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-21 09:52:17,356 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-21 09:52:17,359 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-21 09:52:17,360 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-21 09:52:17,362 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-21 09:52:17,448 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-21 09:52:17,510 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,511 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:52:17,616 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:52:17,624 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_string_eq_byte_buf_harness.i[4496,4509] [2022-07-21 09:52:17,625 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_string_eq_byte_buf_harness.i[4556,4569] [2022-07-21 09:52:17,644 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,644 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,644 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,645 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,645 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,649 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,649 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,650 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,650 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,673 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-21 09:52:17,673 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-21 09:52:17,674 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-21 09:52:17,674 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-21 09:52:17,675 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-21 09:52:17,675 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-21 09:52:17,676 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-21 09:52:17,676 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-21 09:52:17,676 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-21 09:52:17,676 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-21 09:52:17,704 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-21 09:52:17,731 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,731 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:17,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:52:18,036 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:52:18,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:18 WrapperNode [2022-07-21 09:52:18,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:52:18,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:52:18,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:52:18,038 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:52:18,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:18" (1/1) ... [2022-07-21 09:52:18,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:18" (1/1) ... [2022-07-21 09:52:18,180 INFO L137 Inliner]: procedures = 693, calls = 2792, calls flagged for inlining = 61, calls inlined = 8, statements flattened = 879 [2022-07-21 09:52:18,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:52:18,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:52:18,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:52:18,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:52:18,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:18" (1/1) ... [2022-07-21 09:52:18,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:18" (1/1) ... [2022-07-21 09:52:18,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:18" (1/1) ... [2022-07-21 09:52:18,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:18" (1/1) ... [2022-07-21 09:52:18,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:18" (1/1) ... [2022-07-21 09:52:18,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:18" (1/1) ... [2022-07-21 09:52:18,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:18" (1/1) ... [2022-07-21 09:52:18,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:52:18,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:52:18,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:52:18,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:52:18,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:18" (1/1) ... [2022-07-21 09:52:18,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:52:18,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:18,275 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-21 09:52:18,284 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-21 09:52:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-21 09:52:18,311 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-21 09:52:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-21 09:52:18,311 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-21 09:52:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-21 09:52:18,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-21 09:52:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-21 09:52:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:52:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-21 09:52:18,313 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-21 09:52:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 09:52:18,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 09:52:18,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 09:52:18,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:52:18,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:52:18,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 09:52:18,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:52:18,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:52:18,316 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-21 09:52:18,316 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-21 09:52:18,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 09:52:18,316 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 09:52:18,316 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 09:52:18,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:52:18,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 09:52:18,317 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-07-21 09:52:18,317 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-07-21 09:52:18,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 09:52:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-21 09:52:18,318 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-21 09:52:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-21 09:52:18,318 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-21 09:52:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 09:52:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 09:52:18,544 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:52:18,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:52:19,343 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:52:19,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:52:19,350 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 09:52:19,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:52:19 BoogieIcfgContainer [2022-07-21 09:52:19,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:52:19,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:52:19,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:52:19,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:52:19,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:52:16" (1/3) ... [2022-07-21 09:52:19,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a78929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:52:19, skipping insertion in model container [2022-07-21 09:52:19,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:18" (2/3) ... [2022-07-21 09:52:19,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a78929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:52:19, skipping insertion in model container [2022-07-21 09:52:19,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:52:19" (3/3) ... [2022-07-21 09:52:19,358 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_buf_harness.i [2022-07-21 09:52:19,368 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:52:19,368 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:52:19,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:52:19,423 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@1a3b49c2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6edb822 [2022-07-21 09:52:19,424 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 09:52:19,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-21 09:52:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-21 09:52:19,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:19,437 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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-21 09:52:19,437 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:19,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:19,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1812998439, now seen corresponding path program 1 times [2022-07-21 09:52:19,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:19,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043096134] [2022-07-21 09:52:19,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:19,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:19,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:19,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:19,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:19,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:19,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:19,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:19,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 09:52:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:19,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:52:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:19,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 09:52:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:19,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:52:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-21 09:52:19,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:19,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043096134] [2022-07-21 09:52:19,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043096134] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:19,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:19,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:52:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956936522] [2022-07-21 09:52:19,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:19,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:52:19,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:19,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:52:19,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:52:19,981 INFO L87 Difference]: Start difference. First operand has 131 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 09:52:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:20,166 INFO L93 Difference]: Finished difference Result 253 states and 352 transitions. [2022-07-21 09:52:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:52:20,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2022-07-21 09:52:20,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:20,176 INFO L225 Difference]: With dead ends: 253 [2022-07-21 09:52:20,177 INFO L226 Difference]: Without dead ends: 126 [2022-07-21 09:52:20,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-21 09:52:20,190 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 55 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:20,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 219 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:52:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-21 09:52:20,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-21 09:52:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 85 states have internal predecessors, (106), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-21 09:52:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2022-07-21 09:52:20,244 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 167 transitions. Word has length 72 [2022-07-21 09:52:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:20,245 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 167 transitions. [2022-07-21 09:52:20,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 09:52:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2022-07-21 09:52:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-21 09:52:20,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:20,253 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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-21 09:52:20,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 09:52:20,254 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:20,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:20,254 INFO L85 PathProgramCache]: Analyzing trace with hash -795992417, now seen corresponding path program 1 times [2022-07-21 09:52:20,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:20,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644157417] [2022-07-21 09:52:20,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:20,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 09:52:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:52:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 09:52:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:52:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-21 09:52:20,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:20,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644157417] [2022-07-21 09:52:20,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644157417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:20,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:20,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:52:20,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828796151] [2022-07-21 09:52:20,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:20,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:52:20,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:20,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:52:20,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:52:20,480 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 09:52:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:20,732 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2022-07-21 09:52:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:52:20,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 72 [2022-07-21 09:52:20,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:20,735 INFO L225 Difference]: With dead ends: 213 [2022-07-21 09:52:20,735 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 09:52:20,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 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-21 09:52:20,736 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 108 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:20,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 403 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:52:20,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 09:52:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-21 09:52:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.255813953488372) internal successors, (108), 88 states have internal predecessors, (108), 31 states have call successors, (31), 10 states have call predecessors, (31), 11 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-07-21 09:52:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 170 transitions. [2022-07-21 09:52:20,744 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 170 transitions. Word has length 72 [2022-07-21 09:52:20,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:20,745 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 170 transitions. [2022-07-21 09:52:20,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 09:52:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 170 transitions. [2022-07-21 09:52:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-21 09:52:20,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:20,746 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:20,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 09:52:20,746 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:20,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:20,747 INFO L85 PathProgramCache]: Analyzing trace with hash -565003148, now seen corresponding path program 1 times [2022-07-21 09:52:20,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:20,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622153258] [2022-07-21 09:52:20,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:20,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:20,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:52:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 09:52:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:52:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-21 09:52:21,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:21,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622153258] [2022-07-21 09:52:21,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622153258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:21,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:21,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 09:52:21,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708987454] [2022-07-21 09:52:21,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:21,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:52:21,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:21,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:52:21,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:52:21,059 INFO L87 Difference]: Start difference. First operand 129 states and 170 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-21 09:52:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:21,517 INFO L93 Difference]: Finished difference Result 225 states and 299 transitions. [2022-07-21 09:52:21,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:52:21,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 78 [2022-07-21 09:52:21,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:21,519 INFO L225 Difference]: With dead ends: 225 [2022-07-21 09:52:21,519 INFO L226 Difference]: Without dead ends: 167 [2022-07-21 09:52:21,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-21 09:52:21,520 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 226 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:21,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 555 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 09:52:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-21 09:52:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 146. [2022-07-21 09:52:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 100 states have internal predecessors, (123), 35 states have call successors, (35), 11 states have call predecessors, (35), 12 states have return successors, (36), 34 states have call predecessors, (36), 34 states have call successors, (36) [2022-07-21 09:52:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 194 transitions. [2022-07-21 09:52:21,529 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 194 transitions. Word has length 78 [2022-07-21 09:52:21,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:21,530 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 194 transitions. [2022-07-21 09:52:21,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-21 09:52:21,530 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 194 transitions. [2022-07-21 09:52:21,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-21 09:52:21,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:21,531 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:21,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 09:52:21,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:21,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:21,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1924525814, now seen corresponding path program 1 times [2022-07-21 09:52:21,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:21,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879099110] [2022-07-21 09:52:21,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:21,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:52:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 09:52:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:52:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-21 09:52:21,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:21,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879099110] [2022-07-21 09:52:21,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879099110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:21,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:21,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:52:21,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287392676] [2022-07-21 09:52:21,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:21,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:52:21,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:21,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:52:21,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:52:21,788 INFO L87 Difference]: Start difference. First operand 146 states and 194 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 09:52:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:22,020 INFO L93 Difference]: Finished difference Result 250 states and 338 transitions. [2022-07-21 09:52:22,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:52:22,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 78 [2022-07-21 09:52:22,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:22,025 INFO L225 Difference]: With dead ends: 250 [2022-07-21 09:52:22,025 INFO L226 Difference]: Without dead ends: 194 [2022-07-21 09:52:22,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:52:22,027 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 67 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:22,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 380 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:52:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-21 09:52:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2022-07-21 09:52:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 128 states have (on average 1.2578125) internal successors, (161), 130 states have internal predecessors, (161), 51 states have call successors, (51), 11 states have call predecessors, (51), 12 states have return successors, (54), 50 states have call predecessors, (54), 50 states have call successors, (54) [2022-07-21 09:52:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 266 transitions. [2022-07-21 09:52:22,048 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 266 transitions. Word has length 78 [2022-07-21 09:52:22,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:22,049 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 266 transitions. [2022-07-21 09:52:22,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 09:52:22,049 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 266 transitions. [2022-07-21 09:52:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-21 09:52:22,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:22,052 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 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] [2022-07-21 09:52:22,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 09:52:22,052 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2071762423, now seen corresponding path program 1 times [2022-07-21 09:52:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:22,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466803948] [2022-07-21 09:52:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:22,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:52:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 09:52:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:52:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:52:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-21 09:52:22,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:22,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466803948] [2022-07-21 09:52:22,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466803948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:22,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:22,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 09:52:22,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490946447] [2022-07-21 09:52:22,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:22,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:52:22,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:22,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:52:22,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:52:22,341 INFO L87 Difference]: Start difference. First operand 192 states and 266 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-21 09:52:22,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:22,680 INFO L93 Difference]: Finished difference Result 203 states and 282 transitions. [2022-07-21 09:52:22,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:52:22,681 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 90 [2022-07-21 09:52:22,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:22,682 INFO L225 Difference]: With dead ends: 203 [2022-07-21 09:52:22,682 INFO L226 Difference]: Without dead ends: 196 [2022-07-21 09:52:22,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:52:22,683 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 80 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:22,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 715 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 09:52:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-21 09:52:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-07-21 09:52:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 131 states have (on average 1.251908396946565) internal successors, (164), 134 states have internal predecessors, (164), 51 states have call successors, (51), 11 states have call predecessors, (51), 13 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2022-07-21 09:52:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 275 transitions. [2022-07-21 09:52:22,691 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 275 transitions. Word has length 90 [2022-07-21 09:52:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:22,692 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 275 transitions. [2022-07-21 09:52:22,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-21 09:52:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 275 transitions. [2022-07-21 09:52:22,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 09:52:22,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:22,693 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 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] [2022-07-21 09:52:22,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 09:52:22,693 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:22,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:22,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1055189439, now seen corresponding path program 1 times [2022-07-21 09:52:22,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:22,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236056704] [2022-07-21 09:52:22,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:22,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:52:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 09:52:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:52:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:52:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-21 09:52:22,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:22,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236056704] [2022-07-21 09:52:22,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236056704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:22,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:22,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:52:22,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425386386] [2022-07-21 09:52:22,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:22,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:52:22,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:22,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:52:22,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:52:22,902 INFO L87 Difference]: Start difference. First operand 196 states and 275 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-21 09:52:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:23,211 INFO L93 Difference]: Finished difference Result 362 states and 524 transitions. [2022-07-21 09:52:23,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:52:23,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2022-07-21 09:52:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:23,213 INFO L225 Difference]: With dead ends: 362 [2022-07-21 09:52:23,213 INFO L226 Difference]: Without dead ends: 221 [2022-07-21 09:52:23,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:52:23,214 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 120 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:23,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 447 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 09:52:23,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-21 09:52:23,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 201. [2022-07-21 09:52:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 136 states have (on average 1.2573529411764706) internal successors, (171), 139 states have internal predecessors, (171), 51 states have call successors, (51), 11 states have call predecessors, (51), 13 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2022-07-21 09:52:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 282 transitions. [2022-07-21 09:52:23,226 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 282 transitions. Word has length 94 [2022-07-21 09:52:23,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:23,226 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 282 transitions. [2022-07-21 09:52:23,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-21 09:52:23,227 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 282 transitions. [2022-07-21 09:52:23,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 09:52:23,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:23,228 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 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] [2022-07-21 09:52:23,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 09:52:23,228 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:23,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:23,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1313354877, now seen corresponding path program 1 times [2022-07-21 09:52:23,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:23,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324467132] [2022-07-21 09:52:23,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:23,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:23,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:23,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:23,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:23,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:23,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:23,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:23,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:52:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:23,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:23,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 09:52:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:23,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:52:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:23,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:52:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-21 09:52:23,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:23,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324467132] [2022-07-21 09:52:23,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324467132] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:23,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479541229] [2022-07-21 09:52:23,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:23,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:23,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:23,672 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-21 09:52:23,691 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-21 09:52:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 2607 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-21 09:52:24,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:24,195 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-21 09:52:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-21 09:52:24,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:52:24,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479541229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:24,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:52:24,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2022-07-21 09:52:24,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039925390] [2022-07-21 09:52:24,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:24,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 09:52:24,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:24,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 09:52:24,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-07-21 09:52:24,425 INFO L87 Difference]: Start difference. First operand 201 states and 282 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-21 09:52:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:24,461 INFO L93 Difference]: Finished difference Result 373 states and 521 transitions. [2022-07-21 09:52:24,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 09:52:24,461 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 94 [2022-07-21 09:52:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:24,463 INFO L225 Difference]: With dead ends: 373 [2022-07-21 09:52:24,463 INFO L226 Difference]: Without dead ends: 220 [2022-07-21 09:52:24,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-07-21 09:52:24,465 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 20 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:24,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 936 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 57 Unchecked, 0.0s Time] [2022-07-21 09:52:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-21 09:52:24,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-07-21 09:52:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 154 states have (on average 1.2597402597402598) internal successors, (194), 157 states have internal predecessors, (194), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2022-07-21 09:52:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 305 transitions. [2022-07-21 09:52:24,480 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 305 transitions. Word has length 94 [2022-07-21 09:52:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:24,480 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 305 transitions. [2022-07-21 09:52:24,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-21 09:52:24,480 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 305 transitions. [2022-07-21 09:52:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 09:52:24,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:24,481 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 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] [2022-07-21 09:52:24,504 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-21 09:52:24,693 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-21 09:52:24,694 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:24,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1354029627, now seen corresponding path program 1 times [2022-07-21 09:52:24,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:24,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732423796] [2022-07-21 09:52:24,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:24,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:52:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 09:52:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:52:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:52:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-21 09:52:24,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:24,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732423796] [2022-07-21 09:52:24,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732423796] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:24,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322816727] [2022-07-21 09:52:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:24,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:24,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:24,848 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-21 09:52:24,849 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-21 09:52:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:52:25,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-21 09:52:25,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:52:25,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322816727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:25,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:52:25,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-21 09:52:25,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500073333] [2022-07-21 09:52:25,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:25,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:52:25,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:25,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:52:25,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:52:25,240 INFO L87 Difference]: Start difference. First operand 220 states and 305 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 09:52:25,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:25,259 INFO L93 Difference]: Finished difference Result 379 states and 533 transitions. [2022-07-21 09:52:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:52:25,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2022-07-21 09:52:25,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:25,261 INFO L225 Difference]: With dead ends: 379 [2022-07-21 09:52:25,262 INFO L226 Difference]: Without dead ends: 229 [2022-07-21 09:52:25,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 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-21 09:52:25,262 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 20 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 493 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-21 09:52:25,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 493 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:52:25,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-21 09:52:25,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 212. [2022-07-21 09:52:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 149 states have internal predecessors, (185), 51 states have call successors, (51), 12 states have call predecessors, (51), 13 states have return successors, (58), 50 states have call predecessors, (58), 50 states have call successors, (58) [2022-07-21 09:52:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2022-07-21 09:52:25,272 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 94 [2022-07-21 09:52:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:25,272 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2022-07-21 09:52:25,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 09:52:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2022-07-21 09:52:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-21 09:52:25,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:25,275 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-21 09:52:25,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 09:52:25,491 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,SelfDestructingSolverStorable7 [2022-07-21 09:52:25,491 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:25,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:25,492 INFO L85 PathProgramCache]: Analyzing trace with hash -805510601, now seen corresponding path program 1 times [2022-07-21 09:52:25,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:25,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013854053] [2022-07-21 09:52:25,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:25,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:52:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 09:52:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:52:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 09:52:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 09:52:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-21 09:52:25,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:25,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013854053] [2022-07-21 09:52:25,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013854053] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:25,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237796976] [2022-07-21 09:52:25,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:25,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:25,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:25,696 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-21 09:52:25,697 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-21 09:52:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 09:52:26,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 09:52:26,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:52:26,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237796976] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:26,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:52:26,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-07-21 09:52:26,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504464614] [2022-07-21 09:52:26,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:26,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:52:26,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:26,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:52:26,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:52:26,132 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 09:52:26,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:26,236 INFO L93 Difference]: Finished difference Result 367 states and 515 transitions. [2022-07-21 09:52:26,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:52:26,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2022-07-21 09:52:26,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:26,238 INFO L225 Difference]: With dead ends: 367 [2022-07-21 09:52:26,238 INFO L226 Difference]: Without dead ends: 217 [2022-07-21 09:52:26,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:52:26,239 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 12 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:26,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1183 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:52:26,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-21 09:52:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-21 09:52:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 151 states have (on average 1.2516556291390728) internal successors, (189), 154 states have internal predecessors, (189), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2022-07-21 09:52:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 303 transitions. [2022-07-21 09:52:26,247 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 303 transitions. Word has length 98 [2022-07-21 09:52:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:26,247 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 303 transitions. [2022-07-21 09:52:26,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 09:52:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 303 transitions. [2022-07-21 09:52:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 09:52:26,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:26,248 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-21 09:52:26,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 09:52:26,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:26,463 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:26,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:26,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1170955310, now seen corresponding path program 1 times [2022-07-21 09:52:26,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:26,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039619922] [2022-07-21 09:52:26,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:26,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 09:52:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:52:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:52:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-21 09:52:26,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:26,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039619922] [2022-07-21 09:52:26,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039619922] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:26,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643627769] [2022-07-21 09:52:26,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:26,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:26,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:26,592 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-21 09:52:26,593 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-21 09:52:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 2619 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:52:26,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 09:52:26,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:52:26,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643627769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:26,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:52:26,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-21 09:52:26,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970293523] [2022-07-21 09:52:26,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:26,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:52:26,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:26,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:52:26,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:52:26,965 INFO L87 Difference]: Start difference. First operand 217 states and 303 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 09:52:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:26,983 INFO L93 Difference]: Finished difference Result 377 states and 535 transitions. [2022-07-21 09:52:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:52:26,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2022-07-21 09:52:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:26,985 INFO L225 Difference]: With dead ends: 377 [2022-07-21 09:52:26,985 INFO L226 Difference]: Without dead ends: 220 [2022-07-21 09:52:26,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 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-21 09:52:26,986 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 9 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 486 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-21 09:52:26,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 486 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:52:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-21 09:52:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2022-07-21 09:52:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 151 states have (on average 1.2384105960264902) internal successors, (187), 154 states have internal predecessors, (187), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2022-07-21 09:52:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 301 transitions. [2022-07-21 09:52:26,996 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 301 transitions. Word has length 100 [2022-07-21 09:52:26,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:26,996 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 301 transitions. [2022-07-21 09:52:26,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 09:52:26,996 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 301 transitions. [2022-07-21 09:52:26,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 09:52:26,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:26,997 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 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] [2022-07-21 09:52:27,019 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-21 09:52:27,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:27,211 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:27,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:27,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1786047986, now seen corresponding path program 1 times [2022-07-21 09:52:27,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:27,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625257419] [2022-07-21 09:52:27,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:27,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 09:52:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:52:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:52:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-21 09:52:27,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:27,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625257419] [2022-07-21 09:52:27,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625257419] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:27,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8709684] [2022-07-21 09:52:27,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:27,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:27,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:27,345 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-21 09:52:27,371 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-21 09:52:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 2621 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:52:27,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 09:52:27,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:52:27,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8709684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:27,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:52:27,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-21 09:52:27,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794595208] [2022-07-21 09:52:27,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:27,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:52:27,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:27,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:52:27,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:52:27,723 INFO L87 Difference]: Start difference. First operand 217 states and 301 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 09:52:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:27,739 INFO L93 Difference]: Finished difference Result 383 states and 546 transitions. [2022-07-21 09:52:27,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:52:27,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2022-07-21 09:52:27,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:27,740 INFO L225 Difference]: With dead ends: 383 [2022-07-21 09:52:27,740 INFO L226 Difference]: Without dead ends: 226 [2022-07-21 09:52:27,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 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-21 09:52:27,742 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 34 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 484 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-21 09:52:27,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 484 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:52:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-21 09:52:27,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 213. [2022-07-21 09:52:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 150 states have internal predecessors, (180), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2022-07-21 09:52:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 294 transitions. [2022-07-21 09:52:27,748 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 294 transitions. Word has length 100 [2022-07-21 09:52:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:27,748 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 294 transitions. [2022-07-21 09:52:27,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 09:52:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 294 transitions. [2022-07-21 09:52:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 09:52:27,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:27,750 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 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] [2022-07-21 09:52:27,769 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-21 09:52:27,963 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,SelfDestructingSolverStorable10 [2022-07-21 09:52:27,963 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:27,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1106775732, now seen corresponding path program 1 times [2022-07-21 09:52:27,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:27,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507408281] [2022-07-21 09:52:27,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:27,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 09:52:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:52:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:52:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-21 09:52:28,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:28,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507408281] [2022-07-21 09:52:28,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507408281] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:28,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647527203] [2022-07-21 09:52:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:28,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:28,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:28,448 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-21 09:52:28,487 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-21 09:52:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 2616 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-21 09:52:28,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:28,886 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 13 treesize of output 9 [2022-07-21 09:52:29,409 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-21 09:52:29,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:52:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-21 09:52:29,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647527203] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:52:29,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:52:29,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 27 [2022-07-21 09:52:29,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585042811] [2022-07-21 09:52:29,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:52:29,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 09:52:29,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:29,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 09:52:29,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2022-07-21 09:52:29,698 INFO L87 Difference]: Start difference. First operand 213 states and 294 transitions. Second operand has 27 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 7 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2022-07-21 09:52:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:30,937 INFO L93 Difference]: Finished difference Result 258 states and 341 transitions. [2022-07-21 09:52:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 09:52:30,937 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 7 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 100 [2022-07-21 09:52:30,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:30,938 INFO L225 Difference]: With dead ends: 258 [2022-07-21 09:52:30,938 INFO L226 Difference]: Without dead ends: 230 [2022-07-21 09:52:30,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 201 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2022-07-21 09:52:30,939 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 361 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:30,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1018 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1420 Invalid, 0 Unknown, 312 Unchecked, 0.9s Time] [2022-07-21 09:52:30,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-21 09:52:30,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2022-07-21 09:52:30,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 155 states have (on average 1.2129032258064516) internal successors, (188), 158 states have internal predecessors, (188), 51 states have call successors, (51), 14 states have call predecessors, (51), 16 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2022-07-21 09:52:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 302 transitions. [2022-07-21 09:52:30,948 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 302 transitions. Word has length 100 [2022-07-21 09:52:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:30,949 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 302 transitions. [2022-07-21 09:52:30,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 7 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2022-07-21 09:52:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 302 transitions. [2022-07-21 09:52:30,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 09:52:30,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:30,950 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-21 09:52:30,973 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-21 09:52:31,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:31,170 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:31,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:31,170 INFO L85 PathProgramCache]: Analyzing trace with hash 61814546, now seen corresponding path program 1 times [2022-07-21 09:52:31,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:31,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127188936] [2022-07-21 09:52:31,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:31,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 09:52:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:52:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:52:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-21 09:52:31,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:31,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127188936] [2022-07-21 09:52:31,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127188936] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:31,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633250673] [2022-07-21 09:52:31,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:31,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:31,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:31,536 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-21 09:52:31,537 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-21 09:52:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 2613 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-21 09:52:31,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-21 09:52:32,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:52:33,052 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 09:52:33,053 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 39 treesize of output 1 [2022-07-21 09:52:33,185 INFO L356 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2022-07-21 09:52:33,186 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 39 treesize of output 35 [2022-07-21 09:52:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-21 09:52:33,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633250673] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:52:33,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:52:33,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 33 [2022-07-21 09:52:33,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333344713] [2022-07-21 09:52:33,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:52:33,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-21 09:52:33,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:33,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-21 09:52:33,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2022-07-21 09:52:33,267 INFO L87 Difference]: Start difference. First operand 223 states and 302 transitions. Second operand has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2022-07-21 09:52:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:35,617 INFO L93 Difference]: Finished difference Result 354 states and 510 transitions. [2022-07-21 09:52:35,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 09:52:35,617 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) Word has length 100 [2022-07-21 09:52:35,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:35,619 INFO L225 Difference]: With dead ends: 354 [2022-07-21 09:52:35,619 INFO L226 Difference]: Without dead ends: 342 [2022-07-21 09:52:35,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 196 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=587, Invalid=2383, Unknown=0, NotChecked=0, Total=2970 [2022-07-21 09:52:35,620 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 320 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 672 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:35,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1504 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1955 Invalid, 0 Unknown, 672 Unchecked, 1.4s Time] [2022-07-21 09:52:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-07-21 09:52:35,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 334. [2022-07-21 09:52:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 232 states have (on average 1.2155172413793103) internal successors, (282), 235 states have internal predecessors, (282), 81 states have call successors, (81), 17 states have call predecessors, (81), 20 states have return successors, (117), 81 states have call predecessors, (117), 80 states have call successors, (117) [2022-07-21 09:52:35,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 480 transitions. [2022-07-21 09:52:35,654 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 480 transitions. Word has length 100 [2022-07-21 09:52:35,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:35,654 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 480 transitions. [2022-07-21 09:52:35,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2022-07-21 09:52:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 480 transitions. [2022-07-21 09:52:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 09:52:35,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:35,656 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-07-21 09:52:35,676 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-21 09:52:35,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:35,865 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:35,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:35,866 INFO L85 PathProgramCache]: Analyzing trace with hash 319979984, now seen corresponding path program 1 times [2022-07-21 09:52:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:35,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59631474] [2022-07-21 09:52:35,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:35,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:35,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:35,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:35,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:35,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:35,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 09:52:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:52:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:52:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-21 09:52:36,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:36,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59631474] [2022-07-21 09:52:36,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59631474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:36,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:36,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:52:36,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451170347] [2022-07-21 09:52:36,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:36,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:52:36,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:36,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:52:36,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:52:36,056 INFO L87 Difference]: Start difference. First operand 334 states and 480 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-21 09:52:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:36,346 INFO L93 Difference]: Finished difference Result 490 states and 688 transitions. [2022-07-21 09:52:36,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:52:36,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2022-07-21 09:52:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:36,348 INFO L225 Difference]: With dead ends: 490 [2022-07-21 09:52:36,348 INFO L226 Difference]: Without dead ends: 325 [2022-07-21 09:52:36,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:52:36,349 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 78 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:36,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 446 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:52:36,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-07-21 09:52:36,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-07-21 09:52:36,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 224 states have (on average 1.2142857142857142) internal successors, (272), 226 states have internal predecessors, (272), 81 states have call successors, (81), 17 states have call predecessors, (81), 19 states have return successors, (116), 81 states have call predecessors, (116), 80 states have call successors, (116) [2022-07-21 09:52:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 469 transitions. [2022-07-21 09:52:36,364 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 469 transitions. Word has length 100 [2022-07-21 09:52:36,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:36,365 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 469 transitions. [2022-07-21 09:52:36,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-21 09:52:36,365 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 469 transitions. [2022-07-21 09:52:36,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 09:52:36,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:36,366 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-21 09:52:36,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 09:52:36,367 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:36,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:36,367 INFO L85 PathProgramCache]: Analyzing trace with hash 102489296, now seen corresponding path program 1 times [2022-07-21 09:52:36,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:36,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746525845] [2022-07-21 09:52:36,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:36,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 09:52:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:52:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:52:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-21 09:52:36,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:36,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746525845] [2022-07-21 09:52:36,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746525845] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:36,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583463825] [2022-07-21 09:52:36,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:36,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:36,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:36,924 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-21 09:52:36,948 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-21 09:52:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:37,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 2618 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-21 09:52:37,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-21 09:52:38,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:52:38,585 INFO L356 Elim1Store]: treesize reduction 39, result has 46.6 percent of original size [2022-07-21 09:52:38,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 48 [2022-07-21 09:52:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-21 09:52:38,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583463825] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:52:38,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:52:38,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 30 [2022-07-21 09:52:38,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697688526] [2022-07-21 09:52:38,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:52:38,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-21 09:52:38,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:38,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-21 09:52:38,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2022-07-21 09:52:38,893 INFO L87 Difference]: Start difference. First operand 325 states and 469 transitions. Second operand has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-07-21 09:52:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:40,863 INFO L93 Difference]: Finished difference Result 349 states and 492 transitions. [2022-07-21 09:52:40,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 09:52:40,864 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 100 [2022-07-21 09:52:40,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:40,865 INFO L225 Difference]: With dead ends: 349 [2022-07-21 09:52:40,865 INFO L226 Difference]: Without dead ends: 337 [2022-07-21 09:52:40,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 198 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=382, Invalid=1780, Unknown=0, NotChecked=0, Total=2162 [2022-07-21 09:52:40,868 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 240 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:40,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 885 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1190 Invalid, 0 Unknown, 204 Unchecked, 1.0s Time] [2022-07-21 09:52:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-21 09:52:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 320. [2022-07-21 09:52:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 220 states have (on average 1.2181818181818183) internal successors, (268), 221 states have internal predecessors, (268), 81 states have call successors, (81), 17 states have call predecessors, (81), 18 states have return successors, (107), 81 states have call predecessors, (107), 80 states have call successors, (107) [2022-07-21 09:52:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 456 transitions. [2022-07-21 09:52:40,887 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 456 transitions. Word has length 100 [2022-07-21 09:52:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:40,887 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 456 transitions. [2022-07-21 09:52:40,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-07-21 09:52:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 456 transitions. [2022-07-21 09:52:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-21 09:52:40,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:40,889 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-21 09:52:40,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-21 09:52:41,107 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,SelfDestructingSolverStorable14 [2022-07-21 09:52:41,108 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:41,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:41,108 INFO L85 PathProgramCache]: Analyzing trace with hash -430654057, now seen corresponding path program 1 times [2022-07-21 09:52:41,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:41,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698221843] [2022-07-21 09:52:41,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:41,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 09:52:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:52:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:52:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-21 09:52:41,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:41,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698221843] [2022-07-21 09:52:41,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698221843] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:41,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:41,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 09:52:41,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926550472] [2022-07-21 09:52:41,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:41,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 09:52:41,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:41,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 09:52:41,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:52:41,306 INFO L87 Difference]: Start difference. First operand 320 states and 456 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-21 09:52:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:41,717 INFO L93 Difference]: Finished difference Result 331 states and 473 transitions. [2022-07-21 09:52:41,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 09:52:41,718 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2022-07-21 09:52:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:41,719 INFO L225 Difference]: With dead ends: 331 [2022-07-21 09:52:41,719 INFO L226 Difference]: Without dead ends: 289 [2022-07-21 09:52:41,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-21 09:52:41,720 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 84 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:41,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 885 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 09:52:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-21 09:52:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2022-07-21 09:52:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 197 states have (on average 1.2030456852791878) internal successors, (237), 199 states have internal predecessors, (237), 69 states have call successors, (69), 17 states have call predecessors, (69), 18 states have return successors, (86), 68 states have call predecessors, (86), 67 states have call successors, (86) [2022-07-21 09:52:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 392 transitions. [2022-07-21 09:52:41,738 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 392 transitions. Word has length 102 [2022-07-21 09:52:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:41,738 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 392 transitions. [2022-07-21 09:52:41,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-21 09:52:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 392 transitions. [2022-07-21 09:52:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-21 09:52:41,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:41,740 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-21 09:52:41,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 09:52:41,740 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:41,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:41,740 INFO L85 PathProgramCache]: Analyzing trace with hash 704139607, now seen corresponding path program 1 times [2022-07-21 09:52:41,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:41,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744949334] [2022-07-21 09:52:41,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:41,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:52:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 09:52:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:52:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:52:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-21 09:52:42,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:42,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744949334] [2022-07-21 09:52:42,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744949334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:42,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:42,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-21 09:52:42,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453289118] [2022-07-21 09:52:42,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:42,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 09:52:42,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:42,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 09:52:42,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-21 09:52:42,182 INFO L87 Difference]: Start difference. First operand 285 states and 392 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-21 09:52:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:42,956 INFO L93 Difference]: Finished difference Result 295 states and 406 transitions. [2022-07-21 09:52:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 09:52:42,956 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2022-07-21 09:52:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:42,958 INFO L225 Difference]: With dead ends: 295 [2022-07-21 09:52:42,958 INFO L226 Difference]: Without dead ends: 230 [2022-07-21 09:52:42,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2022-07-21 09:52:42,959 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 177 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:42,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 928 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 09:52:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-21 09:52:42,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 167. [2022-07-21 09:52:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 118 states have (on average 1.1864406779661016) internal successors, (140), 120 states have internal predecessors, (140), 33 states have call successors, (33), 14 states have call predecessors, (33), 15 states have return successors, (36), 32 states have call predecessors, (36), 32 states have call successors, (36) [2022-07-21 09:52:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 209 transitions. [2022-07-21 09:52:42,969 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 209 transitions. Word has length 102 [2022-07-21 09:52:42,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:42,969 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 209 transitions. [2022-07-21 09:52:42,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-21 09:52:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 209 transitions. [2022-07-21 09:52:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-21 09:52:42,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:42,970 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:42,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 09:52:42,970 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:42,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:42,971 INFO L85 PathProgramCache]: Analyzing trace with hash 523668838, now seen corresponding path program 1 times [2022-07-21 09:52:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:42,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586604546] [2022-07-21 09:52:42,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:42,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:52:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:52:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:52:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:52:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:52:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 09:52:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 09:52:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:52:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:52:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 09:52:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 09:52:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-21 09:52:43,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:43,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586604546] [2022-07-21 09:52:43,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586604546] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:43,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038575047] [2022-07-21 09:52:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:43,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:43,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:43,361 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-21 09:52:43,389 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-21 09:52:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 2725 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 09:52:43,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-21 09:52:43,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:52:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-21 09:52:43,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038575047] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:52:43,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:52:43,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 24 [2022-07-21 09:52:43,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611688478] [2022-07-21 09:52:43,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:52:43,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 09:52:43,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:43,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 09:52:43,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2022-07-21 09:52:43,981 INFO L87 Difference]: Start difference. First operand 167 states and 209 transitions. Second operand has 24 states, 21 states have (on average 3.857142857142857) internal successors, (81), 18 states have internal predecessors, (81), 10 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 10 states have call successors, (23) [2022-07-21 09:52:44,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:44,423 INFO L93 Difference]: Finished difference Result 185 states and 223 transitions. [2022-07-21 09:52:44,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 09:52:44,424 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.857142857142857) internal successors, (81), 18 states have internal predecessors, (81), 10 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 10 states have call successors, (23) Word has length 118 [2022-07-21 09:52:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:44,424 INFO L225 Difference]: With dead ends: 185 [2022-07-21 09:52:44,424 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 09:52:44,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2022-07-21 09:52:44,426 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 64 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:44,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 274 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:52:44,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 09:52:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 09:52:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:52:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 09:52:44,427 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2022-07-21 09:52:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:44,427 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 09:52:44,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.857142857142857) internal successors, (81), 18 states have internal predecessors, (81), 10 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 10 states have call successors, (23) [2022-07-21 09:52:44,427 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 09:52:44,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 09:52:44,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 09:52:44,452 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-21 09:52:44,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 09:52:44,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 09:52:47,979 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2022-07-21 09:52:47,979 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-07-21 09:52:47,980 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2022-07-21 09:52:47,980 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-07-21 09:52:47,980 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |old(#length)| |#length|) (or (<= |ensure_string_is_allocated_bounded_length_~len~1#1| (+ (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) 15)) .cse0) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (<= (* 18446744073709551616 (div (+ 18446744073709551615 |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) (<= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| (+ 15 (* 18446744073709551616 (div (+ (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 18446744073709551616))))) (= |old(#valid)| |#valid|))) [2022-07-21 09:52:47,980 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-07-21 09:52:47,980 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2022-07-21 09:52:47,980 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-07-21 09:52:47,980 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-21 09:52:47,980 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-21 09:52:47,980 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-07-21 09:52:47,980 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-07-21 09:52:47,980 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-21 09:52:47,981 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-21 09:52:47,981 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-07-21 09:52:47,981 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-21 09:52:47,981 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-21 09:52:47,981 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-21 09:52:47,981 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-21 09:52:47,981 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-21 09:52:47,981 INFO L902 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2022-07-21 09:52:47,981 INFO L899 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2022-07-21 09:52:47,981 INFO L899 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2022-07-21 09:52:47,981 INFO L902 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2022-07-21 09:52:47,981 INFO L899 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2022-07-21 09:52:47,981 INFO L899 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2022-07-21 09:52:47,981 INFO L902 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2022-07-21 09:52:47,981 INFO L899 garLoopResultBuilder]: For program point L7364-6(line 7364) no Hoare annotation was computed. [2022-07-21 09:52:47,981 INFO L899 garLoopResultBuilder]: For program point L7364-4(line 7364) no Hoare annotation was computed. [2022-07-21 09:52:47,981 INFO L899 garLoopResultBuilder]: For program point L7364-3(line 7364) no Hoare annotation was computed. [2022-07-21 09:52:47,981 INFO L899 garLoopResultBuilder]: For program point L7364-8(line 7364) no Hoare annotation was computed. [2022-07-21 09:52:47,981 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7359 7365) the Hoare annotation is: true [2022-07-21 09:52:47,981 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7359 7365) no Hoare annotation was computed. [2022-07-21 09:52:47,982 INFO L899 garLoopResultBuilder]: For program point L7361-3(line 7361) no Hoare annotation was computed. [2022-07-21 09:52:47,982 INFO L899 garLoopResultBuilder]: For program point L7361-1(line 7361) no Hoare annotation was computed. [2022-07-21 09:52:47,982 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7359 7365) no Hoare annotation was computed. [2022-07-21 09:52:47,982 INFO L899 garLoopResultBuilder]: For program point L7361(lines 7361 7364) no Hoare annotation was computed. [2022-07-21 09:52:47,982 INFO L899 garLoopResultBuilder]: For program point L7361-7(lines 7361 7364) no Hoare annotation was computed. [2022-07-21 09:52:47,982 INFO L899 garLoopResultBuilder]: For program point L7361-6(lines 7361 7362) no Hoare annotation was computed. [2022-07-21 09:52:47,982 INFO L899 garLoopResultBuilder]: For program point L7361-4(lines 7361 7362) no Hoare annotation was computed. [2022-07-21 09:52:47,982 INFO L899 garLoopResultBuilder]: For program point L7361-11(lines 7361 7364) no Hoare annotation was computed. [2022-07-21 09:52:47,982 INFO L899 garLoopResultBuilder]: For program point L7361-9(lines 7361 7364) no Hoare annotation was computed. [2022-07-21 09:52:47,982 INFO L899 garLoopResultBuilder]: For program point L7364-2(line 7364) no Hoare annotation was computed. [2022-07-21 09:52:47,982 INFO L899 garLoopResultBuilder]: For program point L7364(line 7364) no Hoare annotation was computed. [2022-07-21 09:52:47,982 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-21 09:52:47,983 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-21 09:52:47,983 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-21 09:52:47,983 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-21 09:52:47,983 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-21 09:52:47,983 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-21 09:52:47,983 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-21 09:52:47,983 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-07-21 09:52:47,983 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-07-21 09:52:47,983 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-07-21 09:52:47,984 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-07-21 09:52:47,984 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-07-21 09:52:47,984 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-21 09:52:47,984 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-07-21 09:52:47,984 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-07-21 09:52:47,984 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-07-21 09:52:47,984 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-07-21 09:52:47,984 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-21 09:52:47,984 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-21 09:52:47,984 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-21 09:52:47,985 INFO L895 garLoopResultBuilder]: At program point L9408(line 9408) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-21 09:52:47,985 INFO L899 garLoopResultBuilder]: For program point L9408-1(line 9408) no Hoare annotation was computed. [2022-07-21 09:52:47,985 INFO L895 garLoopResultBuilder]: At program point L9408-2(lines 9386 9409) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-21 09:52:47,985 INFO L899 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2022-07-21 09:52:47,985 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 09:52:47,985 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 09:52:47,985 INFO L895 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-07-21 09:52:47,985 INFO L902 garLoopResultBuilder]: At program point L9558(line 9558) the Hoare annotation is: true [2022-07-21 09:52:47,986 INFO L899 garLoopResultBuilder]: For program point L6610-3(lines 6610 6612) no Hoare annotation was computed. [2022-07-21 09:52:47,986 INFO L899 garLoopResultBuilder]: For program point L6610-1(lines 6610 6612) no Hoare annotation was computed. [2022-07-21 09:52:47,986 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-07-21 09:52:47,986 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-21 09:52:47,986 INFO L895 garLoopResultBuilder]: At program point L9551(line 9551) the Hoare annotation is: false [2022-07-21 09:52:47,986 INFO L899 garLoopResultBuilder]: For program point L9551-1(line 9551) no Hoare annotation was computed. [2022-07-21 09:52:47,986 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-21 09:52:47,986 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-07-21 09:52:47,986 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-21 09:52:47,987 INFO L899 garLoopResultBuilder]: For program point L6612-1(line 6612) no Hoare annotation was computed. [2022-07-21 09:52:47,987 INFO L895 garLoopResultBuilder]: At program point L6612(line 6612) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-07-21 09:52:47,987 INFO L895 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2022-07-21 09:52:47,987 INFO L899 garLoopResultBuilder]: For program point L9544-1(line 9544) no Hoare annotation was computed. [2022-07-21 09:52:47,987 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-21 09:52:47,987 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-07-21 09:52:47,987 INFO L899 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2022-07-21 09:52:47,987 INFO L895 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_#t~mem475#1| (select (select |#memory_int| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (+ |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 16)))) [2022-07-21 09:52:47,987 INFO L899 garLoopResultBuilder]: For program point L9388(line 9388) no Hoare annotation was computed. [2022-07-21 09:52:47,988 INFO L895 garLoopResultBuilder]: At program point L9388-2(line 9388) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-21 09:52:47,988 INFO L895 garLoopResultBuilder]: At program point L9553(line 9553) the Hoare annotation is: false [2022-07-21 09:52:47,988 INFO L895 garLoopResultBuilder]: At program point L9553-1(line 9553) the Hoare annotation is: false [2022-07-21 09:52:47,988 INFO L899 garLoopResultBuilder]: For program point L9553-2(line 9553) no Hoare annotation was computed. [2022-07-21 09:52:47,988 INFO L899 garLoopResultBuilder]: For program point L9388-3(line 9388) no Hoare annotation was computed. [2022-07-21 09:52:47,988 INFO L895 garLoopResultBuilder]: At program point L9388-4(line 9388) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-21 09:52:47,988 INFO L899 garLoopResultBuilder]: For program point L9388-5(line 9388) no Hoare annotation was computed. [2022-07-21 09:52:47,988 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 09:52:47,989 INFO L899 garLoopResultBuilder]: For program point L9389(line 9389) no Hoare annotation was computed. [2022-07-21 09:52:47,989 INFO L895 garLoopResultBuilder]: At program point L9389-2(line 9389) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-21 09:52:47,989 INFO L895 garLoopResultBuilder]: At program point L9546(line 9546) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-07-21 09:52:47,989 INFO L899 garLoopResultBuilder]: For program point L9389-3(line 9389) no Hoare annotation was computed. [2022-07-21 09:52:47,989 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-07-21 09:52:47,989 INFO L899 garLoopResultBuilder]: For program point L9538(lines 9538 9557) no Hoare annotation was computed. [2022-07-21 09:52:47,989 INFO L895 garLoopResultBuilder]: At program point L9546-1(line 9546) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse7 (select .cse8 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse7 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse7) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|) .cse4 .cse5 .cse6) (and (<= 0 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1352#1|) .cse4 (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1352#1| 0) .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse7 (* 18446744073709551616 (div (+ (* (- 1) .cse7) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 .cse6 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-21 09:52:47,989 INFO L895 garLoopResultBuilder]: At program point L9389-4(line 9389) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-21 09:52:47,990 INFO L899 garLoopResultBuilder]: For program point L9546-2(line 9546) no Hoare annotation was computed. [2022-07-21 09:52:47,990 INFO L899 garLoopResultBuilder]: For program point L9389-5(line 9389) no Hoare annotation was computed. [2022-07-21 09:52:47,990 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-21 09:52:47,990 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 09:52:47,990 INFO L899 garLoopResultBuilder]: For program point L9390(lines 9390 9398) no Hoare annotation was computed. [2022-07-21 09:52:47,990 INFO L902 garLoopResultBuilder]: At program point L9539(line 9539) the Hoare annotation is: true [2022-07-21 09:52:47,990 INFO L899 garLoopResultBuilder]: For program point L9539-1(lines 9539 9540) no Hoare annotation was computed. [2022-07-21 09:52:47,990 INFO L902 garLoopResultBuilder]: At program point L9539-2(line 9539) the Hoare annotation is: true [2022-07-21 09:52:47,990 INFO L899 garLoopResultBuilder]: For program point L9539-3(line 9539) no Hoare annotation was computed. [2022-07-21 09:52:47,991 INFO L899 garLoopResultBuilder]: For program point L9539-5(lines 9539 9540) no Hoare annotation was computed. [2022-07-21 09:52:47,991 INFO L895 garLoopResultBuilder]: At program point L9556(line 9556) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (<= 1 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1361#1|) (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1361#1| 1)) [2022-07-21 09:52:47,991 INFO L899 garLoopResultBuilder]: For program point L9556-1(line 9556) no Hoare annotation was computed. [2022-07-21 09:52:47,991 INFO L899 garLoopResultBuilder]: For program point L9399(lines 9399 9407) no Hoare annotation was computed. [2022-07-21 09:52:47,991 INFO L895 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-21 09:52:47,991 INFO L899 garLoopResultBuilder]: For program point L9548-1(lines 9548 9549) no Hoare annotation was computed. [2022-07-21 09:52:47,991 INFO L895 garLoopResultBuilder]: At program point L6600(lines 6598 6601) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2022-07-21 09:52:47,991 INFO L899 garLoopResultBuilder]: For program point L9548-3(lines 9548 9549) no Hoare annotation was computed. [2022-07-21 09:52:47,991 INFO L899 garLoopResultBuilder]: For program point L9548-4(lines 9548 9554) no Hoare annotation was computed. [2022-07-21 09:52:47,992 INFO L895 garLoopResultBuilder]: At program point L9548-6(lines 9548 9554) the Hoare annotation is: (let ((.cse5 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse4 (select .cse5 16))) (let ((.cse1 (<= .cse4 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse4) 18446744073709551616))))) (.cse2 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse0 (select .cse5 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)) .cse1 .cse2 .cse3) (and .cse1 .cse2 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse0 (+ .cse4 (* 18446744073709551616 (div (+ (* (- 1) .cse4) 18446744073709551615 (* 18446744073709551616 (div .cse0 18446744073709551616))) 18446744073709551616)))) .cse3 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-21 09:52:47,992 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-21 09:52:47,992 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-21 09:52:47,992 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-21 09:52:47,992 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-21 09:52:47,992 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-21 09:52:47,992 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-21 09:52:47,995 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:47,996 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 09:52:48,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:52:48,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2022-07-21 09:52:48,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:52:48,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2022-07-21 09:52:48,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 09:52:48 BoogieIcfgContainer [2022-07-21 09:52:48,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 09:52:48,025 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 09:52:48,025 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 09:52:48,025 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 09:52:48,025 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:52:19" (3/4) ... [2022-07-21 09:52:48,027 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 09:52:48,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-07-21 09:52:48,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-21 09:52:48,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2022-07-21 09:52:48,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-21 09:52:48,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-07-21 09:52:48,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-21 09:52:48,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-21 09:52:48,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-21 09:52:48,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-21 09:52:48,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-21 09:52:48,042 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2022-07-21 09:52:48,043 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2022-07-21 09:52:48,044 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-07-21 09:52:48,045 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-21 09:52:48,046 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-21 09:52:48,047 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-21 09:52:48,047 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 09:52:48,048 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 09:52:48,070 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && !(\old(max_size) == 16) [2022-07-21 09:52:48,374 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 09:52:48,374 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 09:52:48,375 INFO L158 Benchmark]: Toolchain (without parser) took 32210.87ms. Allocated memory was 54.5MB in the beginning and 484.4MB in the end (delta: 429.9MB). Free memory was 33.7MB in the beginning and 134.4MB in the end (delta: -100.7MB). Peak memory consumption was 328.7MB. Max. memory is 16.1GB. [2022-07-21 09:52:48,375 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 54.5MB. Free memory was 36.3MB in the beginning and 36.2MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 09:52:48,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1872.97ms. Allocated memory was 54.5MB in the beginning and 115.3MB in the end (delta: 60.8MB). Free memory was 33.4MB in the beginning and 48.0MB in the end (delta: -14.6MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2022-07-21 09:52:48,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 150.99ms. Allocated memory is still 115.3MB. Free memory was 48.0MB in the beginning and 66.2MB in the end (delta: -18.2MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2022-07-21 09:52:48,375 INFO L158 Benchmark]: Boogie Preprocessor took 61.13ms. Allocated memory is still 115.3MB. Free memory was 66.2MB in the beginning and 59.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-21 09:52:48,376 INFO L158 Benchmark]: RCFGBuilder took 1100.78ms. Allocated memory was 115.3MB in the beginning and 163.6MB in the end (delta: 48.2MB). Free memory was 59.9MB in the beginning and 79.7MB in the end (delta: -19.8MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2022-07-21 09:52:48,376 INFO L158 Benchmark]: TraceAbstraction took 28670.39ms. Allocated memory was 163.6MB in the beginning and 484.4MB in the end (delta: 320.9MB). Free memory was 79.7MB in the beginning and 266.5MB in the end (delta: -186.8MB). Peak memory consumption was 134.1MB. Max. memory is 16.1GB. [2022-07-21 09:52:48,376 INFO L158 Benchmark]: Witness Printer took 349.44ms. Allocated memory is still 484.4MB. Free memory was 266.5MB in the beginning and 134.4MB in the end (delta: 132.1MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2022-07-21 09:52:48,377 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 54.5MB. Free memory was 36.3MB in the beginning and 36.2MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1872.97ms. Allocated memory was 54.5MB in the beginning and 115.3MB in the end (delta: 60.8MB). Free memory was 33.4MB in the beginning and 48.0MB in the end (delta: -14.6MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 150.99ms. Allocated memory is still 115.3MB. Free memory was 48.0MB in the beginning and 66.2MB in the end (delta: -18.2MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.13ms. Allocated memory is still 115.3MB. Free memory was 66.2MB in the beginning and 59.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1100.78ms. Allocated memory was 115.3MB in the beginning and 163.6MB in the end (delta: 48.2MB). Free memory was 59.9MB in the beginning and 79.7MB in the end (delta: -19.8MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 28670.39ms. Allocated memory was 163.6MB in the beginning and 484.4MB in the end (delta: 320.9MB). Free memory was 79.7MB in the beginning and 266.5MB in the end (delta: -186.8MB). Peak memory consumption was 134.1MB. Max. memory is 16.1GB. * Witness Printer took 349.44ms. Allocated memory is still 484.4MB. Free memory was 266.5MB in the beginning and 134.4MB in the end (delta: 132.1MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.6s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2209 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2075 mSDsluCounter, 12241 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1245 IncrementalHoareTripleChecker+Unchecked, 9461 mSDsCounter, 723 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9212 IncrementalHoareTripleChecker+Invalid, 11180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 723 mSolverCounterUnsat, 2780 mSDtfsCounter, 9212 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1994 GetRequests, 1659 SyntacticMatches, 31 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2063 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=13, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 175 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 440 PreInvPairs, 484 NumberOfFragments, 1592 HoareAnnotationTreeSize, 440 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 45 FomulaSimplificationsInter, 2964 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 2596 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2983 ConstructedInterpolants, 101 QuantifiedInterpolants, 16167 SizeOfPredicates, 78 NumberOfNonLiveVariables, 23635 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 31 InterpolantComputations, 14 PerfectInterpolantSequences, 1856/2033 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6598]: Loop Invariant Derived loop invariant: ((str == 0 && str == 0) && !(buf == 0)) && buf == 0 - InvariantResult [Line: 9558]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9386]: Loop Invariant [2022-07-21 09:52:48,382 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:52:48,383 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2022-07-21 09:52:48,384 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:52:48,384 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR Derived loop invariant: (((((str == 0 && 0 <= 18446744073709551616 * (-1 * unknown-#memory_int-unknown[buf][buf] / 18446744073709551616) + unknown-#memory_int-unknown[buf][buf]) && str == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(buf == 0)) && buf == 0) || ((((((((str == 0 && str == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(buf == 0)) && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR] == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16] + 18446744073709551616 * ((-1 * unknown-#memory_int-unknown[buf][16] + 18446744073709551615 + 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) / 18446744073709551616)) && buf == 0) && buf == buf) && buf == 0) - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: ((!(str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && !(\old(max_size) == 16) RESULT: Ultimate proved your program to be correct! [2022-07-21 09:52:48,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE