./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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_ignore_case_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 c6f394469998c48e6ef18c3b42ee2a3474a6570f40012cad15c840d16c47e9d4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 22:34:00,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:34:00,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:34:00,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:34:00,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:34:00,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:34:00,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:34:00,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:34:00,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:34:00,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:34:00,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:34:00,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:34:00,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:34:00,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:34:00,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:34:00,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:34:00,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:34:00,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:34:00,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:34:00,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:34:00,152 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:34:00,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:34:00,155 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:34:00,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:34:00,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:34:00,160 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:34:00,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:34:00,160 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:34:00,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:34:00,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:34:00,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:34:00,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:34:00,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:34:00,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:34:00,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:34:00,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:34:00,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:34:00,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:34:00,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:34:00,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:34:00,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:34:00,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:34:00,169 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 22:34:00,202 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:34:00,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:34:00,205 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:34:00,205 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:34:00,206 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:34:00,206 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:34:00,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:34:00,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:34:00,207 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:34:00,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:34:00,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 22:34:00,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:34:00,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:34:00,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:34:00,209 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:34:00,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:34:00,210 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:34:00,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:34:00,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:34:00,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:34:00,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:34:00,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:34:00,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:34:00,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:34:00,213 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:34:00,213 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 22:34:00,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 22:34:00,213 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:34:00,214 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:34:00,214 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:34:00,214 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 -> c6f394469998c48e6ef18c3b42ee2a3474a6570f40012cad15c840d16c47e9d4 [2022-07-22 22:34:00,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:34:00,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:34:00,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:34:00,498 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:34:00,499 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:34:00,500 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_ignore_case_harness.i [2022-07-22 22:34:00,557 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d0d0bbb/caa34081bdcc41b1a572c1f1a523c477/FLAG919213358 [2022-07-22 22:34:01,313 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:34:01,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i [2022-07-22 22:34:01,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d0d0bbb/caa34081bdcc41b1a572c1f1a523c477/FLAG919213358 [2022-07-22 22:34:01,540 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d0d0bbb/caa34081bdcc41b1a572c1f1a523c477 [2022-07-22 22:34:01,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:34:01,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:34:01,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:34:01,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:34:01,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:34:01,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:34:01" (1/1) ... [2022-07-22 22:34:01,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2034c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:01, skipping insertion in model container [2022-07-22 22:34:01,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:34:01" (1/1) ... [2022-07-22 22:34:01,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:34:01,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:34:01,938 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_ignore_case_harness.i[4508,4521] [2022-07-22 22:34:01,945 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_ignore_case_harness.i[4568,4581] [2022-07-22 22:34:02,580 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:02,583 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:02,585 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:02,588 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:02,589 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:02,598 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:02,600 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:02,602 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:02,602 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:02,856 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:34:02,858 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:34:02,859 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:34:02,860 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:34:02,864 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:34:02,867 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:34:02,868 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:34:02,869 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:34:02,870 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:34:02,871 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:34:03,046 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:34:03,123 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:03,123 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:03,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:34:03,248 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 22:34:03,261 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_ignore_case_harness.i[4508,4521] [2022-07-22 22:34:03,262 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_ignore_case_harness.i[4568,4581] [2022-07-22 22:34:03,286 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:03,287 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:03,287 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:03,287 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:03,288 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:03,292 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:03,293 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:03,294 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:03,294 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:03,358 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:34:03,361 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:34:03,361 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:34:03,362 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:34:03,362 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:34:03,363 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:34:03,364 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:34:03,364 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:34:03,364 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:34:03,365 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:34:03,388 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:34:03,448 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:03,449 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:03,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:34:03,728 INFO L208 MainTranslator]: Completed translation [2022-07-22 22:34:03,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:03 WrapperNode [2022-07-22 22:34:03,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 22:34:03,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 22:34:03,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 22:34:03,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 22:34:03,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:03" (1/1) ... [2022-07-22 22:34:03,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:03" (1/1) ... [2022-07-22 22:34:03,905 INFO L137 Inliner]: procedures = 693, calls = 2784, calls flagged for inlining = 60, calls inlined = 7, statements flattened = 853 [2022-07-22 22:34:03,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 22:34:03,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 22:34:03,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 22:34:03,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 22:34:03,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:03" (1/1) ... [2022-07-22 22:34:03,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:03" (1/1) ... [2022-07-22 22:34:03,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:03" (1/1) ... [2022-07-22 22:34:03,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:03" (1/1) ... [2022-07-22 22:34:03,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:03" (1/1) ... [2022-07-22 22:34:03,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:03" (1/1) ... [2022-07-22 22:34:04,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:03" (1/1) ... [2022-07-22 22:34:04,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 22:34:04,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 22:34:04,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 22:34:04,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 22:34:04,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:03" (1/1) ... [2022-07-22 22:34:04,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:34:04,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:04,061 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-22 22:34:04,083 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-22 22:34:04,098 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-22 22:34:04,098 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-22 22:34:04,098 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-22 22:34:04,099 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-22 22:34:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_ignore_case [2022-07-22 22:34:04,099 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_ignore_case [2022-07-22 22:34:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-22 22:34:04,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-22 22:34:04,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 22:34:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-22 22:34:04,101 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-22 22:34:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 22:34:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 22:34:04,102 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 22:34:04,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 22:34:04,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 22:34:04,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 22:34:04,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 22:34:04,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 22:34:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-22 22:34:04,104 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-22 22:34:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-22 22:34:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 22:34:04,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 22:34:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 22:34:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 22:34:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 22:34:04,106 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-22 22:34:04,106 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-22 22:34:04,106 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-22 22:34:04,106 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-22 22:34:04,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 22:34:04,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 22:34:04,390 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 22:34:04,392 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 22:34:05,363 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 22:34:05,372 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 22:34:05,372 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 22:34:05,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:34:05 BoogieIcfgContainer [2022-07-22 22:34:05,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 22:34:05,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 22:34:05,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 22:34:05,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 22:34:05,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:34:01" (1/3) ... [2022-07-22 22:34:05,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e63af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:34:05, skipping insertion in model container [2022-07-22 22:34:05,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:03" (2/3) ... [2022-07-22 22:34:05,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e63af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:34:05, skipping insertion in model container [2022-07-22 22:34:05,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:34:05" (3/3) ... [2022-07-22 22:34:05,384 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_buf_ignore_case_harness.i [2022-07-22 22:34:05,397 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 22:34:05,398 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 22:34:05,465 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 22:34:05,470 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@1bb34350, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@461a4737 [2022-07-22 22:34:05,471 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 22:34:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 88 states have internal predecessors, (113), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-22 22:34:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 22:34:05,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:05,487 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:05,487 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:05,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:05,494 INFO L85 PathProgramCache]: Analyzing trace with hash 624639396, now seen corresponding path program 1 times [2022-07-22 22:34:05,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:05,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64907112] [2022-07-22 22:34:05,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:05,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 22:34:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 22:34:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-22 22:34:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:34:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-22 22:34:06,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:06,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64907112] [2022-07-22 22:34:06,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64907112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:06,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:06,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 22:34:06,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785092030] [2022-07-22 22:34:06,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:06,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 22:34:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:06,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 22:34:06,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:34:06,209 INFO L87 Difference]: Start difference. First operand has 125 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 88 states have internal predecessors, (113), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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-22 22:34:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:06,395 INFO L93 Difference]: Finished difference Result 238 states and 329 transitions. [2022-07-22 22:34:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 22:34:06,398 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 74 [2022-07-22 22:34:06,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:06,412 INFO L225 Difference]: With dead ends: 238 [2022-07-22 22:34:06,413 INFO L226 Difference]: Without dead ends: 120 [2022-07-22 22:34:06,418 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-22 22:34:06,426 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 59 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:06,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 205 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:34:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-22 22:34:06,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-22 22:34:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 84 states have internal predecessors, (106), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-22 22:34:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 157 transitions. [2022-07-22 22:34:06,470 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 157 transitions. Word has length 74 [2022-07-22 22:34:06,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:06,471 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 157 transitions. [2022-07-22 22:34:06,472 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-22 22:34:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 157 transitions. [2022-07-22 22:34:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 22:34:06,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:06,476 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:06,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 22:34:06,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:06,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:06,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1603023894, now seen corresponding path program 1 times [2022-07-22 22:34:06,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:06,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182911559] [2022-07-22 22:34:06,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:06,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 22:34:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 22:34:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-22 22:34:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:34:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:34:06,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:06,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182911559] [2022-07-22 22:34:06,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182911559] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:06,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393368258] [2022-07-22 22:34:06,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:06,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:06,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:06,953 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-22 22:34:06,955 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-22 22:34:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:07,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 2545 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 22:34:07,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-22 22:34:07,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:34:07,673 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-22 22:34:07,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393368258] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:07,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:34:07,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2022-07-22 22:34:07,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272305177] [2022-07-22 22:34:07,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:07,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:34:07,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:07,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:34:07,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:34:07,677 INFO L87 Difference]: Start difference. First operand 120 states and 157 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 22:34:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:07,862 INFO L93 Difference]: Finished difference Result 185 states and 249 transitions. [2022-07-22 22:34:07,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:34:07,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 74 [2022-07-22 22:34:07,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:07,867 INFO L225 Difference]: With dead ends: 185 [2022-07-22 22:34:07,868 INFO L226 Difference]: Without dead ends: 145 [2022-07-22 22:34:07,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:34:07,873 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 218 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:07,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 529 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:34:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-22 22:34:07,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2022-07-22 22:34:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 92 states have internal predecessors, (116), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-07-22 22:34:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 175 transitions. [2022-07-22 22:34:07,925 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 175 transitions. Word has length 74 [2022-07-22 22:34:07,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:07,925 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 175 transitions. [2022-07-22 22:34:07,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 22:34:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 175 transitions. [2022-07-22 22:34:07,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 22:34:07,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:07,935 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:07,967 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-22 22:34:08,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:08,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:08,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:08,152 INFO L85 PathProgramCache]: Analyzing trace with hash -216820500, now seen corresponding path program 1 times [2022-07-22 22:34:08,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:08,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36743517] [2022-07-22 22:34:08,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:08,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:08,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:08,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:08,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:08,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:08,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:08,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:08,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 22:34:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:08,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 22:34:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-22 22:34:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:08,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 22:34:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:08,450 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:34:08,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:08,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36743517] [2022-07-22 22:34:08,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36743517] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:08,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781007077] [2022-07-22 22:34:08,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:08,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:08,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:08,453 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-22 22:34:08,454 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-22 22:34:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:08,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 2546 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 22:34:08,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 22:34:09,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:34:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:34:09,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781007077] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:34:09,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:34:09,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-07-22 22:34:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18269021] [2022-07-22 22:34:09,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:34:09,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 22:34:09,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:09,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 22:34:09,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:34:09,187 INFO L87 Difference]: Start difference. First operand 132 states and 175 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 11 states have internal predecessors, (73), 7 states have call successors, (25), 4 states have call predecessors, (25), 5 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2022-07-22 22:34:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:09,730 INFO L93 Difference]: Finished difference Result 219 states and 297 transitions. [2022-07-22 22:34:09,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:34:09,732 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 11 states have internal predecessors, (73), 7 states have call successors, (25), 4 states have call predecessors, (25), 5 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) Word has length 74 [2022-07-22 22:34:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:09,734 INFO L225 Difference]: With dead ends: 219 [2022-07-22 22:34:09,735 INFO L226 Difference]: Without dead ends: 135 [2022-07-22 22:34:09,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-07-22 22:34:09,737 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 320 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:09,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 521 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 22:34:09,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-22 22:34:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-07-22 22:34:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 95 states have internal predecessors, (118), 30 states have call successors, (30), 10 states have call predecessors, (30), 11 states have return successors, (31), 29 states have call predecessors, (31), 29 states have call successors, (31) [2022-07-22 22:34:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 179 transitions. [2022-07-22 22:34:09,753 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 179 transitions. Word has length 74 [2022-07-22 22:34:09,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:09,753 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 179 transitions. [2022-07-22 22:34:09,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 11 states have internal predecessors, (73), 7 states have call successors, (25), 4 states have call predecessors, (25), 5 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2022-07-22 22:34:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 179 transitions. [2022-07-22 22:34:09,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-22 22:34:09,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:09,760 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:09,795 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-22 22:34:09,983 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,SelfDestructingSolverStorable2 [2022-07-22 22:34:09,984 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:09,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:09,984 INFO L85 PathProgramCache]: Analyzing trace with hash 287122273, now seen corresponding path program 1 times [2022-07-22 22:34:09,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:09,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794414861] [2022-07-22 22:34:09,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:09,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:34:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:34:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:34:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:34:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-22 22:34:10,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:10,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794414861] [2022-07-22 22:34:10,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794414861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:10,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:10,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:34:10,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488274966] [2022-07-22 22:34:10,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:10,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:34:10,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:10,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:34:10,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:34:10,236 INFO L87 Difference]: Start difference. First operand 135 states and 179 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-22 22:34:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:10,511 INFO L93 Difference]: Finished difference Result 244 states and 334 transitions. [2022-07-22 22:34:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:34:10,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 82 [2022-07-22 22:34:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:10,513 INFO L225 Difference]: With dead ends: 244 [2022-07-22 22:34:10,513 INFO L226 Difference]: Without dead ends: 157 [2022-07-22 22:34:10,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:34:10,514 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 116 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:10,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 349 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:34:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-22 22:34:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 137. [2022-07-22 22:34:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 95 states have (on average 1.263157894736842) internal successors, (120), 97 states have internal predecessors, (120), 30 states have call successors, (30), 10 states have call predecessors, (30), 11 states have return successors, (31), 29 states have call predecessors, (31), 29 states have call successors, (31) [2022-07-22 22:34:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 181 transitions. [2022-07-22 22:34:10,525 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 181 transitions. Word has length 82 [2022-07-22 22:34:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:10,525 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 181 transitions. [2022-07-22 22:34:10,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-22 22:34:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2022-07-22 22:34:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-22 22:34:10,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:10,533 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:10,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 22:34:10,534 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:10,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:10,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1762265569, now seen corresponding path program 1 times [2022-07-22 22:34:10,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:10,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308551606] [2022-07-22 22:34:10,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:34:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:34:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:34:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:34:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-22 22:34:10,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:10,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308551606] [2022-07-22 22:34:10,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308551606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:10,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:10,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:34:10,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240273207] [2022-07-22 22:34:10,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:10,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:34:10,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:10,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:34:10,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:34:10,818 INFO L87 Difference]: Start difference. First operand 137 states and 181 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-22 22:34:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:11,073 INFO L93 Difference]: Finished difference Result 236 states and 321 transitions. [2022-07-22 22:34:11,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:34:11,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 82 [2022-07-22 22:34:11,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:11,075 INFO L225 Difference]: With dead ends: 236 [2022-07-22 22:34:11,075 INFO L226 Difference]: Without dead ends: 147 [2022-07-22 22:34:11,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:34:11,076 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 99 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:11,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 351 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:34:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-22 22:34:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 139. [2022-07-22 22:34:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 99 states have internal predecessors, (122), 30 states have call successors, (30), 10 states have call predecessors, (30), 11 states have return successors, (31), 29 states have call predecessors, (31), 29 states have call successors, (31) [2022-07-22 22:34:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 183 transitions. [2022-07-22 22:34:11,088 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 183 transitions. Word has length 82 [2022-07-22 22:34:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:11,088 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 183 transitions. [2022-07-22 22:34:11,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-22 22:34:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 183 transitions. [2022-07-22 22:34:11,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-22 22:34:11,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:11,089 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:11,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 22:34:11,090 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:11,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:11,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1641150429, now seen corresponding path program 1 times [2022-07-22 22:34:11,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:11,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482780024] [2022-07-22 22:34:11,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:11,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:34:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:34:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:34:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:34:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-22 22:34:11,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:11,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482780024] [2022-07-22 22:34:11,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482780024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:11,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:11,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:34:11,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337615708] [2022-07-22 22:34:11,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:11,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:34:11,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:11,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:34:11,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:34:11,371 INFO L87 Difference]: Start difference. First operand 139 states and 183 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 22:34:11,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:11,662 INFO L93 Difference]: Finished difference Result 231 states and 312 transitions. [2022-07-22 22:34:11,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:34:11,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 82 [2022-07-22 22:34:11,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:11,665 INFO L225 Difference]: With dead ends: 231 [2022-07-22 22:34:11,665 INFO L226 Difference]: Without dead ends: 186 [2022-07-22 22:34:11,666 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-22 22:34:11,666 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 71 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:11,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 347 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:34:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-22 22:34:11,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2022-07-22 22:34:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 127 states have (on average 1.2598425196850394) internal successors, (160), 129 states have internal predecessors, (160), 45 states have call successors, (45), 10 states have call predecessors, (45), 11 states have return successors, (48), 44 states have call predecessors, (48), 44 states have call successors, (48) [2022-07-22 22:34:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 253 transitions. [2022-07-22 22:34:11,682 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 253 transitions. Word has length 82 [2022-07-22 22:34:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:11,683 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 253 transitions. [2022-07-22 22:34:11,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 22:34:11,684 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 253 transitions. [2022-07-22 22:34:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-22 22:34:11,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:11,685 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-22 22:34:11,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 22:34:11,686 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:11,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:11,686 INFO L85 PathProgramCache]: Analyzing trace with hash 687616524, now seen corresponding path program 1 times [2022-07-22 22:34:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:11,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086386245] [2022-07-22 22:34:11,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:11,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:34:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:34:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:34:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:34:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-22 22:34:11,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:11,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086386245] [2022-07-22 22:34:11,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086386245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:11,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:11,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:34:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419493234] [2022-07-22 22:34:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:11,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:34:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:11,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:34:11,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:34:11,998 INFO L87 Difference]: Start difference. First operand 184 states and 253 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 22:34:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:12,406 INFO L93 Difference]: Finished difference Result 195 states and 269 transitions. [2022-07-22 22:34:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:34:12,407 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 86 [2022-07-22 22:34:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:12,409 INFO L225 Difference]: With dead ends: 195 [2022-07-22 22:34:12,409 INFO L226 Difference]: Without dead ends: 188 [2022-07-22 22:34:12,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 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-22 22:34:12,410 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 84 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:12,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 649 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:34:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-22 22:34:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-07-22 22:34:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 133 states have internal predecessors, (163), 45 states have call successors, (45), 10 states have call predecessors, (45), 12 states have return successors, (54), 44 states have call predecessors, (54), 44 states have call successors, (54) [2022-07-22 22:34:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 262 transitions. [2022-07-22 22:34:12,424 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 262 transitions. Word has length 86 [2022-07-22 22:34:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:12,424 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 262 transitions. [2022-07-22 22:34:12,425 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 22:34:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 262 transitions. [2022-07-22 22:34:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-22 22:34:12,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:12,426 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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-22 22:34:12,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 22:34:12,427 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:12,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:12,427 INFO L85 PathProgramCache]: Analyzing trace with hash -116353960, now seen corresponding path program 1 times [2022-07-22 22:34:12,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:12,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553261427] [2022-07-22 22:34:12,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:12,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:12,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:12,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:12,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:12,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:12,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:12,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:34:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:12,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:34:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:12,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:34:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:12,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:34:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-22 22:34:13,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:13,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553261427] [2022-07-22 22:34:13,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553261427] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:13,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534835118] [2022-07-22 22:34:13,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:13,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:13,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:13,010 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-22 22:34:13,039 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-22 22:34:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:13,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 2584 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 22:34:13,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 22:34:14,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:34:15,177 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 22:34:15,178 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 40 treesize of output 1 [2022-07-22 22:34:15,393 INFO L356 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2022-07-22 22:34:15,393 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 40 treesize of output 36 [2022-07-22 22:34:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:34:15,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534835118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:34:15,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:34:15,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 13] total 33 [2022-07-22 22:34:15,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167730667] [2022-07-22 22:34:15,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:34:15,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-22 22:34:15,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:15,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-22 22:34:15,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2022-07-22 22:34:15,464 INFO L87 Difference]: Start difference. First operand 188 states and 262 transitions. Second operand has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 32 states have internal predecessors, (125), 6 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2022-07-22 22:34:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:19,687 INFO L93 Difference]: Finished difference Result 540 states and 843 transitions. [2022-07-22 22:34:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-22 22:34:19,694 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 32 states have internal predecessors, (125), 6 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) Word has length 90 [2022-07-22 22:34:19,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:19,698 INFO L225 Difference]: With dead ends: 540 [2022-07-22 22:34:19,698 INFO L226 Difference]: Without dead ends: 402 [2022-07-22 22:34:19,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 171 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=822, Invalid=3734, Unknown=0, NotChecked=0, Total=4556 [2022-07-22 22:34:19,701 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 697 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 3015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 910 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:19,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1115 Invalid, 3015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1984 Invalid, 0 Unknown, 910 Unchecked, 1.9s Time] [2022-07-22 22:34:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-07-22 22:34:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 386. [2022-07-22 22:34:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 275 states have (on average 1.2763636363636364) internal successors, (351), 278 states have internal predecessors, (351), 93 states have call successors, (93), 13 states have call predecessors, (93), 17 states have return successors, (167), 94 states have call predecessors, (167), 92 states have call successors, (167) [2022-07-22 22:34:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 611 transitions. [2022-07-22 22:34:19,738 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 611 transitions. Word has length 90 [2022-07-22 22:34:19,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:19,740 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 611 transitions. [2022-07-22 22:34:19,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 32 states have internal predecessors, (125), 6 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2022-07-22 22:34:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 611 transitions. [2022-07-22 22:34:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-22 22:34:19,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:19,745 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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-22 22:34:19,778 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-22 22:34:19,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:19,969 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:19,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:19,970 INFO L85 PathProgramCache]: Analyzing trace with hash 141811478, now seen corresponding path program 1 times [2022-07-22 22:34:19,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:19,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528654768] [2022-07-22 22:34:19,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:19,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:34:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:34:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:34:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:34:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-22 22:34:20,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:20,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528654768] [2022-07-22 22:34:20,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528654768] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:20,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:20,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:34:20,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603141064] [2022-07-22 22:34:20,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:20,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:34:20,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:20,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:34:20,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:34:20,284 INFO L87 Difference]: Start difference. First operand 386 states and 611 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 22:34:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:20,669 INFO L93 Difference]: Finished difference Result 631 states and 983 transitions. [2022-07-22 22:34:20,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:34:20,669 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 90 [2022-07-22 22:34:20,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:20,673 INFO L225 Difference]: With dead ends: 631 [2022-07-22 22:34:20,673 INFO L226 Difference]: Without dead ends: 382 [2022-07-22 22:34:20,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 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-22 22:34:20,677 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 84 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:20,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 413 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:34:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-07-22 22:34:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2022-07-22 22:34:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 271 states have (on average 1.2656826568265682) internal successors, (343), 274 states have internal predecessors, (343), 93 states have call successors, (93), 13 states have call predecessors, (93), 17 states have return successors, (166), 94 states have call predecessors, (166), 92 states have call successors, (166) [2022-07-22 22:34:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 602 transitions. [2022-07-22 22:34:20,717 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 602 transitions. Word has length 90 [2022-07-22 22:34:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:20,717 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 602 transitions. [2022-07-22 22:34:20,718 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 22:34:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 602 transitions. [2022-07-22 22:34:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-22 22:34:20,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:20,723 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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-22 22:34:20,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 22:34:20,723 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:20,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:20,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1284944238, now seen corresponding path program 1 times [2022-07-22 22:34:20,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:20,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100467130] [2022-07-22 22:34:20,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:20,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:34:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:34:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:34:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:34:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:34:21,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:21,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100467130] [2022-07-22 22:34:21,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100467130] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:21,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095085791] [2022-07-22 22:34:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:21,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:21,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:21,130 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-22 22:34:21,132 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-22 22:34:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 2587 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-22 22:34:21,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:21,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 22:34:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 22:34:21,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:34:21,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095085791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:21,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:34:21,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 17 [2022-07-22 22:34:21,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308824824] [2022-07-22 22:34:21,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:21,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 22:34:21,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:21,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 22:34:21,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-07-22 22:34:21,857 INFO L87 Difference]: Start difference. First operand 382 states and 602 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 10 states have internal predecessors, (58), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 22:34:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:22,011 INFO L93 Difference]: Finished difference Result 579 states and 871 transitions. [2022-07-22 22:34:22,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:34:22,011 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 10 states have internal predecessors, (58), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 90 [2022-07-22 22:34:22,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:22,014 INFO L225 Difference]: With dead ends: 579 [2022-07-22 22:34:22,014 INFO L226 Difference]: Without dead ends: 395 [2022-07-22 22:34:22,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:34:22,016 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 78 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:22,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 775 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 63 Invalid, 0 Unknown, 98 Unchecked, 0.1s Time] [2022-07-22 22:34:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-07-22 22:34:22,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 386. [2022-07-22 22:34:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 276 states have (on average 1.2681159420289856) internal successors, (350), 277 states have internal predecessors, (350), 93 states have call successors, (93), 14 states have call predecessors, (93), 16 states have return successors, (152), 94 states have call predecessors, (152), 92 states have call successors, (152) [2022-07-22 22:34:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 595 transitions. [2022-07-22 22:34:22,044 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 595 transitions. Word has length 90 [2022-07-22 22:34:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:22,045 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 595 transitions. [2022-07-22 22:34:22,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 10 states have internal predecessors, (58), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 22:34:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 595 transitions. [2022-07-22 22:34:22,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-22 22:34:22,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:22,047 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-22 22:34:22,085 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-22 22:34:22,263 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-22 22:34:22,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1650189964, now seen corresponding path program 1 times [2022-07-22 22:34:22,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:22,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189274886] [2022-07-22 22:34:22,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:22,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:34:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 22:34:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 22:34:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 22:34:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-22 22:34:22,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:22,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189274886] [2022-07-22 22:34:22,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189274886] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:22,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139296915] [2022-07-22 22:34:22,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:22,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:22,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:22,544 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-22 22:34:22,545 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-22 22:34:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 2588 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-22 22:34:22,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-22 22:34:23,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:34:23,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139296915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:23,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:34:23,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-07-22 22:34:23,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526607786] [2022-07-22 22:34:23,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:23,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:34:23,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:23,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:34:23,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:34:23,030 INFO L87 Difference]: Start difference. First operand 386 states and 595 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 22:34:23,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:23,171 INFO L93 Difference]: Finished difference Result 717 states and 1152 transitions. [2022-07-22 22:34:23,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:34:23,172 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2022-07-22 22:34:23,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:23,174 INFO L225 Difference]: With dead ends: 717 [2022-07-22 22:34:23,174 INFO L226 Difference]: Without dead ends: 399 [2022-07-22 22:34:23,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 111 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-22 22:34:23,177 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 12 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:23,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1121 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:34:23,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-07-22 22:34:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2022-07-22 22:34:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 284 states have (on average 1.2605633802816902) internal successors, (358), 287 states have internal predecessors, (358), 93 states have call successors, (93), 14 states have call predecessors, (93), 18 states have return successors, (179), 94 states have call predecessors, (179), 92 states have call successors, (179) [2022-07-22 22:34:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 630 transitions. [2022-07-22 22:34:23,207 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 630 transitions. Word has length 94 [2022-07-22 22:34:23,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:23,208 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 630 transitions. [2022-07-22 22:34:23,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 22:34:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 630 transitions. [2022-07-22 22:34:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-22 22:34:23,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:23,210 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1] [2022-07-22 22:34:23,240 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-22 22:34:23,423 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-22 22:34:23,423 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:23,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:23,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1448066457, now seen corresponding path program 1 times [2022-07-22 22:34:23,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:23,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432443909] [2022-07-22 22:34:23,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:23,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:34:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:34:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 22:34:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:34:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-22 22:34:23,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:23,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432443909] [2022-07-22 22:34:23,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432443909] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:23,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73337692] [2022-07-22 22:34:23,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:23,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:23,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:23,936 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-22 22:34:23,938 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-22 22:34:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:24,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 2593 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-22 22:34:24,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 22:34:25,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:34:25,765 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 22:34:25,765 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 40 treesize of output 1 [2022-07-22 22:34:25,898 INFO L356 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2022-07-22 22:34:25,899 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 40 treesize of output 36 [2022-07-22 22:34:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:34:26,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73337692] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:34:26,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:34:26,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 32 [2022-07-22 22:34:26,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817614885] [2022-07-22 22:34:26,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:34:26,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-22 22:34:26,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:26,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-22 22:34:26,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2022-07-22 22:34:26,033 INFO L87 Difference]: Start difference. First operand 396 states and 630 transitions. Second operand has 32 states, 32 states have (on average 4.15625) internal successors, (133), 31 states have internal predecessors, (133), 6 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2022-07-22 22:34:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:29,096 INFO L93 Difference]: Finished difference Result 696 states and 1252 transitions. [2022-07-22 22:34:29,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-22 22:34:29,097 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.15625) internal successors, (133), 31 states have internal predecessors, (133), 6 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) Word has length 96 [2022-07-22 22:34:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:29,103 INFO L225 Difference]: With dead ends: 696 [2022-07-22 22:34:29,103 INFO L226 Difference]: Without dead ends: 681 [2022-07-22 22:34:29,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 186 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=632, Invalid=2790, Unknown=0, NotChecked=0, Total=3422 [2022-07-22 22:34:29,105 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 366 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 334 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:29,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1286 Invalid, 2352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1904 Invalid, 0 Unknown, 334 Unchecked, 1.7s Time] [2022-07-22 22:34:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-07-22 22:34:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 581. [2022-07-22 22:34:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 415 states have (on average 1.2602409638554217) internal successors, (523), 419 states have internal predecessors, (523), 141 states have call successors, (141), 17 states have call predecessors, (141), 24 states have return successors, (352), 144 states have call predecessors, (352), 140 states have call successors, (352) [2022-07-22 22:34:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1016 transitions. [2022-07-22 22:34:29,155 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1016 transitions. Word has length 96 [2022-07-22 22:34:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:29,156 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 1016 transitions. [2022-07-22 22:34:29,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.15625) internal successors, (133), 31 states have internal predecessors, (133), 6 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2022-07-22 22:34:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1016 transitions. [2022-07-22 22:34:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-22 22:34:29,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:29,160 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1] [2022-07-22 22:34:29,191 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-22 22:34:29,380 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-22 22:34:29,381 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:29,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:29,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1678310561, now seen corresponding path program 1 times [2022-07-22 22:34:29,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:29,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085149300] [2022-07-22 22:34:29,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:29,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:30,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:30,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:30,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:30,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:34:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:30,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:34:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:30,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 22:34:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:30,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:34:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-22 22:34:30,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:30,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085149300] [2022-07-22 22:34:30,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085149300] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:30,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420717070] [2022-07-22 22:34:30,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:30,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:30,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:30,348 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-22 22:34:30,349 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-22 22:34:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:30,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 2596 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-22 22:34:30,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 22:34:31,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:34:31,547 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-22 22:34:31,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2022-07-22 22:34:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:34:31,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420717070] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:34:31,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:34:31,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 24 [2022-07-22 22:34:31,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891600950] [2022-07-22 22:34:31,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:34:31,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-22 22:34:31,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:31,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 22:34:31,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2022-07-22 22:34:31,570 INFO L87 Difference]: Start difference. First operand 581 states and 1016 transitions. Second operand has 24 states, 24 states have (on average 5.291666666666667) internal successors, (127), 23 states have internal predecessors, (127), 5 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-22 22:34:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:32,833 INFO L93 Difference]: Finished difference Result 698 states and 1266 transitions. [2022-07-22 22:34:32,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 22:34:32,833 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.291666666666667) internal successors, (127), 23 states have internal predecessors, (127), 5 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) Word has length 96 [2022-07-22 22:34:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:32,839 INFO L225 Difference]: With dead ends: 698 [2022-07-22 22:34:32,839 INFO L226 Difference]: Without dead ends: 676 [2022-07-22 22:34:32,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 193 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2022-07-22 22:34:32,841 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 278 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 419 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:32,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1087 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 917 Invalid, 0 Unknown, 419 Unchecked, 0.7s Time] [2022-07-22 22:34:32,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-07-22 22:34:32,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 672. [2022-07-22 22:34:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 479 states have (on average 1.2588726513569937) internal successors, (603), 481 states have internal predecessors, (603), 165 states have call successors, (165), 21 states have call predecessors, (165), 27 states have return successors, (434), 169 states have call predecessors, (434), 164 states have call successors, (434) [2022-07-22 22:34:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1202 transitions. [2022-07-22 22:34:32,899 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1202 transitions. Word has length 96 [2022-07-22 22:34:32,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:32,900 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 1202 transitions. [2022-07-22 22:34:32,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.291666666666667) internal successors, (127), 23 states have internal predecessors, (127), 5 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-22 22:34:32,900 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1202 transitions. [2022-07-22 22:34:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-22 22:34:32,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:32,905 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1] [2022-07-22 22:34:32,928 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-22 22:34:33,111 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-22 22:34:33,112 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:33,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:33,112 INFO L85 PathProgramCache]: Analyzing trace with hash 90273573, now seen corresponding path program 1 times [2022-07-22 22:34:33,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:33,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537231354] [2022-07-22 22:34:33,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:33,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:34:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:34:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 22:34:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:34:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:34:34,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:34,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537231354] [2022-07-22 22:34:34,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537231354] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:34,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179890250] [2022-07-22 22:34:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:34,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:34,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:34,079 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-22 22:34:34,081 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-22 22:34:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:34,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 2598 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 22:34:34,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 22:34:35,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:34:36,143 INFO L356 Elim1Store]: treesize reduction 39, result has 46.6 percent of original size [2022-07-22 22:34:36,144 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 36 treesize of output 49 [2022-07-22 22:34:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:34:36,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179890250] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:34:36,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:34:36,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 30 [2022-07-22 22:34:36,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905982740] [2022-07-22 22:34:36,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:34:36,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-22 22:34:36,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:36,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-22 22:34:36,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2022-07-22 22:34:36,381 INFO L87 Difference]: Start difference. First operand 672 states and 1202 transitions. Second operand has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 29 states have internal predecessors, (128), 5 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-22 22:34:38,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:38,902 INFO L93 Difference]: Finished difference Result 776 states and 1317 transitions. [2022-07-22 22:34:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-22 22:34:38,903 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 29 states have internal predecessors, (128), 5 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) Word has length 96 [2022-07-22 22:34:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:38,908 INFO L225 Difference]: With dead ends: 776 [2022-07-22 22:34:38,908 INFO L226 Difference]: Without dead ends: 755 [2022-07-22 22:34:38,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 187 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=537, Invalid=2115, Unknown=0, NotChecked=0, Total=2652 [2022-07-22 22:34:38,910 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 345 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 540 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:38,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 834 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1063 Invalid, 0 Unknown, 540 Unchecked, 1.1s Time] [2022-07-22 22:34:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2022-07-22 22:34:38,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 690. [2022-07-22 22:34:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 496 states have (on average 1.2620967741935485) internal successors, (626), 500 states have internal predecessors, (626), 165 states have call successors, (165), 20 states have call predecessors, (165), 28 states have return successors, (339), 169 states have call predecessors, (339), 164 states have call successors, (339) [2022-07-22 22:34:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1130 transitions. [2022-07-22 22:34:38,996 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1130 transitions. Word has length 96 [2022-07-22 22:34:38,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:38,997 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 1130 transitions. [2022-07-22 22:34:38,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 29 states have internal predecessors, (128), 5 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-22 22:34:38,997 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1130 transitions. [2022-07-22 22:34:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-22 22:34:39,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:39,002 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1] [2022-07-22 22:34:39,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:39,227 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,SelfDestructingSolverStorable13 [2022-07-22 22:34:39,227 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:39,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1042757541, now seen corresponding path program 1 times [2022-07-22 22:34:39,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:39,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704639709] [2022-07-22 22:34:39,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:39,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:34:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:34:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 22:34:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:34:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-22 22:34:39,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:39,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704639709] [2022-07-22 22:34:39,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704639709] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:39,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399260248] [2022-07-22 22:34:39,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:39,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:39,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:39,474 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-22 22:34:39,476 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-22 22:34:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 22:34:39,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 22:34:40,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:34:40,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399260248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:40,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:34:40,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-07-22 22:34:40,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374149909] [2022-07-22 22:34:40,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:40,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:34:40,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:40,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:34:40,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:34:40,001 INFO L87 Difference]: Start difference. First operand 690 states and 1130 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (11), 2 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-22 22:34:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:40,173 INFO L93 Difference]: Finished difference Result 1240 states and 2146 transitions. [2022-07-22 22:34:40,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:34:40,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (11), 2 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 96 [2022-07-22 22:34:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:40,178 INFO L225 Difference]: With dead ends: 1240 [2022-07-22 22:34:40,178 INFO L226 Difference]: Without dead ends: 694 [2022-07-22 22:34:40,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:34:40,186 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 39 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:40,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 567 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-07-22 22:34:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-07-22 22:34:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 686. [2022-07-22 22:34:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 492 states have (on average 1.2560975609756098) internal successors, (618), 496 states have internal predecessors, (618), 165 states have call successors, (165), 20 states have call predecessors, (165), 28 states have return successors, (330), 169 states have call predecessors, (330), 164 states have call successors, (330) [2022-07-22 22:34:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1113 transitions. [2022-07-22 22:34:40,259 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1113 transitions. Word has length 96 [2022-07-22 22:34:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:40,259 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 1113 transitions. [2022-07-22 22:34:40,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (11), 2 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-22 22:34:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1113 transitions. [2022-07-22 22:34:40,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-22 22:34:40,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:40,264 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1] [2022-07-22 22:34:40,296 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-22 22:34:40,478 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,SelfDestructingSolverStorable14 [2022-07-22 22:34:40,479 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:40,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1865424345, now seen corresponding path program 1 times [2022-07-22 22:34:40,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:40,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865241956] [2022-07-22 22:34:40,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:40,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:34:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:34:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 22:34:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:34:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-22 22:34:40,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:40,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865241956] [2022-07-22 22:34:40,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865241956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:40,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544848377] [2022-07-22 22:34:40,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:40,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:40,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:40,680 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:34:40,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 22:34:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 2599 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 22:34:41,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 22:34:41,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:34:41,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544848377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:41,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:34:41,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-22 22:34:41,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421142998] [2022-07-22 22:34:41,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:41,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:34:41,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:41,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:34:41,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:34:41,139 INFO L87 Difference]: Start difference. First operand 686 states and 1113 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 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-22 22:34:41,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:41,179 INFO L93 Difference]: Finished difference Result 843 states and 1309 transitions. [2022-07-22 22:34:41,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:34:41,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 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 96 [2022-07-22 22:34:41,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:41,182 INFO L225 Difference]: With dead ends: 843 [2022-07-22 22:34:41,182 INFO L226 Difference]: Without dead ends: 297 [2022-07-22 22:34:41,184 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-22 22:34:41,185 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 6 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:41,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 460 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:34:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-22 22:34:41,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 289. [2022-07-22 22:34:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 205 states have (on average 1.2341463414634146) internal successors, (253), 205 states have internal predecessors, (253), 69 states have call successors, (69), 14 states have call predecessors, (69), 14 states have return successors, (87), 69 states have call predecessors, (87), 68 states have call successors, (87) [2022-07-22 22:34:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 409 transitions. [2022-07-22 22:34:41,211 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 409 transitions. Word has length 96 [2022-07-22 22:34:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:41,211 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 409 transitions. [2022-07-22 22:34:41,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 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-22 22:34:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 409 transitions. [2022-07-22 22:34:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-22 22:34:41,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:41,214 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 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] [2022-07-22 22:34:41,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:41,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-22 22:34:41,439 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:41,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:41,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1830655980, now seen corresponding path program 1 times [2022-07-22 22:34:41,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:41,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482597852] [2022-07-22 22:34:41,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:41,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:34:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:34:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 22:34:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:34:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-22 22:34:41,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:41,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482597852] [2022-07-22 22:34:41,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482597852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:41,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:41,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 22:34:41,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744346824] [2022-07-22 22:34:41,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:41,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 22:34:41,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:41,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 22:34:41,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:34:41,649 INFO L87 Difference]: Start difference. First operand 289 states and 409 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 22:34:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:42,155 INFO L93 Difference]: Finished difference Result 300 states and 426 transitions. [2022-07-22 22:34:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:34:42,155 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2022-07-22 22:34:42,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:42,157 INFO L225 Difference]: With dead ends: 300 [2022-07-22 22:34:42,157 INFO L226 Difference]: Without dead ends: 259 [2022-07-22 22:34:42,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 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-22 22:34:42,158 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 88 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:42,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 800 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:34:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-22 22:34:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2022-07-22 22:34:42,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 182 states have (on average 1.2142857142857142) internal successors, (221), 183 states have internal predecessors, (221), 58 states have call successors, (58), 14 states have call predecessors, (58), 14 states have return successors, (69), 57 states have call predecessors, (69), 56 states have call successors, (69) [2022-07-22 22:34:42,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 348 transitions. [2022-07-22 22:34:42,177 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 348 transitions. Word has length 98 [2022-07-22 22:34:42,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:42,178 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 348 transitions. [2022-07-22 22:34:42,178 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-22 22:34:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 348 transitions. [2022-07-22 22:34:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-22 22:34:42,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:42,180 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 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] [2022-07-22 22:34:42,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 22:34:42,180 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:42,180 INFO L85 PathProgramCache]: Analyzing trace with hash -887227732, now seen corresponding path program 1 times [2022-07-22 22:34:42,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:42,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430775] [2022-07-22 22:34:42,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:42,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 22:34:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:34:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:34:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 22:34:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:34:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 22:34:42,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:42,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430775] [2022-07-22 22:34:42,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:42,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:42,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-22 22:34:42,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536763320] [2022-07-22 22:34:42,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:42,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 22:34:42,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:42,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 22:34:42,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-22 22:34:42,771 INFO L87 Difference]: Start difference. First operand 255 states and 348 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-22 22:34:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:43,606 INFO L93 Difference]: Finished difference Result 265 states and 362 transitions. [2022-07-22 22:34:43,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 22:34:43,607 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 98 [2022-07-22 22:34:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:43,608 INFO L225 Difference]: With dead ends: 265 [2022-07-22 22:34:43,608 INFO L226 Difference]: Without dead ends: 201 [2022-07-22 22:34:43,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 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-22 22:34:43,609 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 169 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:43,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 900 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 22:34:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-22 22:34:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 150. [2022-07-22 22:34:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 109 states have (on average 1.1926605504587156) internal successors, (130), 110 states have internal predecessors, (130), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-07-22 22:34:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 187 transitions. [2022-07-22 22:34:43,621 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 187 transitions. Word has length 98 [2022-07-22 22:34:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:43,622 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 187 transitions. [2022-07-22 22:34:43,622 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-22 22:34:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 187 transitions. [2022-07-22 22:34:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-22 22:34:43,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:43,623 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:43,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 22:34:43,624 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:43,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash 833744277, now seen corresponding path program 1 times [2022-07-22 22:34:43,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:43,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947863852] [2022-07-22 22:34:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:43,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:44,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:44,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:44,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:44,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:34:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:44,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:34:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:44,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-22 22:34:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:44,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:44,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 22:34:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:44,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:34:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:44,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-22 22:34:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:44,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 22:34:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:44,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-22 22:34:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-22 22:34:44,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:44,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947863852] [2022-07-22 22:34:44,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947863852] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:44,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829239700] [2022-07-22 22:34:44,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:44,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:44,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:44,153 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:34:44,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 22:34:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:44,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 2728 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 22:34:44,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-22 22:34:44,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:34:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-22 22:34:44,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829239700] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:34:44,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:34:44,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 23 [2022-07-22 22:34:44,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444410119] [2022-07-22 22:34:44,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:34:44,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-22 22:34:44,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:44,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-22 22:34:44,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2022-07-22 22:34:44,877 INFO L87 Difference]: Start difference. First operand 150 states and 187 transitions. Second operand has 23 states, 21 states have (on average 4.428571428571429) internal successors, (93), 17 states have internal predecessors, (93), 9 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) [2022-07-22 22:34:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:45,386 INFO L93 Difference]: Finished difference Result 165 states and 199 transitions. [2022-07-22 22:34:45,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 22:34:45,387 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.428571428571429) internal successors, (93), 17 states have internal predecessors, (93), 9 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) Word has length 122 [2022-07-22 22:34:45,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:45,387 INFO L225 Difference]: With dead ends: 165 [2022-07-22 22:34:45,387 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 22:34:45,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2022-07-22 22:34:45,389 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:45,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 283 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:34:45,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 22:34:45,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 22:34:45,390 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-22 22:34:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 22:34:45,390 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2022-07-22 22:34:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:45,390 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 22:34:45,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.428571428571429) internal successors, (93), 17 states have internal predecessors, (93), 9 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) [2022-07-22 22:34:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 22:34:45,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 22:34:45,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 22:34:45,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:45,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:45,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 22:34:46,840 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (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|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 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-22 22:34:46,840 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-07-22 22:34:46,840 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (or (and (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|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) (not (< 0 |#StackHeapBarrier|))) [2022-07-22 22:34:46,840 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-07-22 22:34:46,841 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (or (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) .cse0) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (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|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (let ((.cse1 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (<= .cse1 (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ .cse1 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)))))) (= |old(#valid)| |#valid|))) (not (< 0 |#StackHeapBarrier|))) [2022-07-22 22:34:46,841 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-07-22 22:34:46,841 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (or (and (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|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) (not (< 0 |#StackHeapBarrier|))) [2022-07-22 22:34:46,841 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-07-22 22:34:46,841 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (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|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-07-22 22:34:46,841 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (or (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|)) (not (< 0 |#StackHeapBarrier|))) [2022-07-22 22:34:46,841 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-07-22 22:34:46,841 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-07-22 22:34:46,841 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (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|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-07-22 22:34:46,841 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-22 22:34:46,841 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-07-22 22:34:46,841 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-22 22:34:46,842 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-22 22:34:46,842 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-22 22:34:46,842 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-22 22:34:46,842 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-22 22:34:46,842 INFO L899 garLoopResultBuilder]: For program point L7364-6(line 7364) no Hoare annotation was computed. [2022-07-22 22:34:46,842 INFO L899 garLoopResultBuilder]: For program point L7364-4(line 7364) no Hoare annotation was computed. [2022-07-22 22:34:46,842 INFO L899 garLoopResultBuilder]: For program point L7364-3(line 7364) no Hoare annotation was computed. [2022-07-22 22:34:46,842 INFO L899 garLoopResultBuilder]: For program point L7364-8(line 7364) no Hoare annotation was computed. [2022-07-22 22:34:46,842 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7359 7365) the Hoare annotation is: true [2022-07-22 22:34:46,842 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7359 7365) no Hoare annotation was computed. [2022-07-22 22:34:46,842 INFO L899 garLoopResultBuilder]: For program point L7361-3(line 7361) no Hoare annotation was computed. [2022-07-22 22:34:46,842 INFO L899 garLoopResultBuilder]: For program point L7361-1(line 7361) no Hoare annotation was computed. [2022-07-22 22:34:46,842 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7359 7365) no Hoare annotation was computed. [2022-07-22 22:34:46,842 INFO L899 garLoopResultBuilder]: For program point L7361(lines 7361 7364) no Hoare annotation was computed. [2022-07-22 22:34:46,842 INFO L899 garLoopResultBuilder]: For program point L7361-7(lines 7361 7364) no Hoare annotation was computed. [2022-07-22 22:34:46,842 INFO L899 garLoopResultBuilder]: For program point L7361-6(lines 7361 7362) no Hoare annotation was computed. [2022-07-22 22:34:46,842 INFO L899 garLoopResultBuilder]: For program point L7361-4(lines 7361 7362) no Hoare annotation was computed. [2022-07-22 22:34:46,843 INFO L899 garLoopResultBuilder]: For program point L7361-11(lines 7361 7364) no Hoare annotation was computed. [2022-07-22 22:34:46,843 INFO L899 garLoopResultBuilder]: For program point L7361-9(lines 7361 7364) no Hoare annotation was computed. [2022-07-22 22:34:46,843 INFO L899 garLoopResultBuilder]: For program point L7364-2(line 7364) no Hoare annotation was computed. [2022-07-22 22:34:46,843 INFO L899 garLoopResultBuilder]: For program point L7364(line 7364) no Hoare annotation was computed. [2022-07-22 22:34:46,843 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-22 22:34:46,843 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-22 22:34:46,843 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-22 22:34:46,843 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-22 22:34:46,843 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-22 22:34:46,843 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-22 22:34:46,843 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-22 22:34:46,843 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-07-22 22:34:46,843 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-07-22 22:34:46,843 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-07-22 22:34:46,844 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-07-22 22:34:46,844 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-07-22 22:34:46,844 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-22 22:34:46,844 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-07-22 22:34:46,844 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-07-22 22:34:46,844 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-07-22 22:34:46,844 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-07-22 22:34:46,844 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-22 22:34:46,844 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-22 22:34:46,844 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-22 22:34:46,844 INFO L899 garLoopResultBuilder]: For program point L9429(lines 9429 9437) no Hoare annotation was computed. [2022-07-22 22:34:46,844 INFO L899 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2022-07-22 22:34:46,844 INFO L895 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)) [2022-07-22 22:34:46,844 INFO L899 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2022-07-22 22:34:46,847 INFO L899 garLoopResultBuilder]: For program point L9438-1(line 9438) no Hoare annotation was computed. [2022-07-22 22:34:46,847 INFO L895 garLoopResultBuilder]: At program point L9438-2(lines 9416 9439) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse1 18446744073709551616)) (* (- 1) .cse1) .cse0)) 18446744073709551616)))) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)))) [2022-07-22 22:34:46,847 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 22:34:46,847 INFO L902 garLoopResultBuilder]: At program point L9562(line 9562) the Hoare annotation is: true [2022-07-22 22:34:46,848 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 22:34:46,848 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 22:34:46,848 INFO L895 garLoopResultBuilder]: At program point L9438(line 9438) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse1 18446744073709551616)) (* (- 1) .cse1) .cse0)) 18446744073709551616)))) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)))) [2022-07-22 22:34:46,848 INFO L895 garLoopResultBuilder]: At program point L9554(line 9554) the Hoare annotation is: false [2022-07-22 22:34:46,848 INFO L895 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)) [2022-07-22 22:34:46,849 INFO L899 garLoopResultBuilder]: For program point L6610-3(lines 6610 6612) no Hoare annotation was computed. [2022-07-22 22:34:46,850 INFO L899 garLoopResultBuilder]: For program point L6610-1(lines 6610 6612) no Hoare annotation was computed. [2022-07-22 22:34:46,850 INFO L895 garLoopResultBuilder]: At program point L9546(line 9546) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)) [2022-07-22 22:34:46,850 INFO L899 garLoopResultBuilder]: For program point L9418(line 9418) no Hoare annotation was computed. [2022-07-22 22:34:46,850 INFO L895 garLoopResultBuilder]: At program point L9554-1(line 9554) the Hoare annotation is: false [2022-07-22 22:34:46,850 INFO L899 garLoopResultBuilder]: For program point L9554-2(line 9554) no Hoare annotation was computed. [2022-07-22 22:34:46,850 INFO L899 garLoopResultBuilder]: For program point L9418-5(line 9418) no Hoare annotation was computed. [2022-07-22 22:34:46,850 INFO L899 garLoopResultBuilder]: For program point L9538(lines 9538 9561) no Hoare annotation was computed. [2022-07-22 22:34:46,851 INFO L895 garLoopResultBuilder]: At program point L9546-1(line 9546) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0)) (.cse2 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0))) (.cse6 (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) (.cse8 (< 0 |#StackHeapBarrier|))) (or (let ((.cse5 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse3 (select .cse5 16))) (and .cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) .cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) .cse2 (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse4 (select .cse5 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse4 18446744073709551616)) (* (- 1) .cse4) .cse3)) 18446744073709551616)))) .cse6 (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616)))) .cse7 .cse8))) (and .cse0 (<= 0 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ret1350#1|) .cse1 (<= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ret1350#1| 0) .cse2 .cse6 .cse7 .cse8))) [2022-07-22 22:34:46,851 INFO L899 garLoopResultBuilder]: For program point L9546-2(line 9546) no Hoare annotation was computed. [2022-07-22 22:34:46,851 INFO L895 garLoopResultBuilder]: At program point L9418-2(line 9418) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse1 18446744073709551616)) (* (- 1) .cse1) .cse0)) 18446744073709551616)))) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)))) [2022-07-22 22:34:46,851 INFO L899 garLoopResultBuilder]: For program point L9418-3(line 9418) no Hoare annotation was computed. [2022-07-22 22:34:46,851 INFO L895 garLoopResultBuilder]: At program point L9418-4(line 9418) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse1 18446744073709551616)) (* (- 1) .cse1) .cse0)) 18446744073709551616)))) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)))) [2022-07-22 22:34:46,851 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 22:34:46,852 INFO L899 garLoopResultBuilder]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2022-07-22 22:34:46,852 INFO L899 garLoopResultBuilder]: For program point L9551-2(lines 9551 9552) no Hoare annotation was computed. [2022-07-22 22:34:46,852 INFO L899 garLoopResultBuilder]: For program point L9551-3(lines 9551 9558) no Hoare annotation was computed. [2022-07-22 22:34:46,852 INFO L899 garLoopResultBuilder]: For program point L9419(line 9419) no Hoare annotation was computed. [2022-07-22 22:34:46,852 INFO L895 garLoopResultBuilder]: At program point L9551-4(lines 9551 9558) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse1 18446744073709551616)) (* (- 1) .cse1) .cse0)) 18446744073709551616)))) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)))) [2022-07-22 22:34:46,852 INFO L899 garLoopResultBuilder]: For program point L9551(lines 9551 9552) no Hoare annotation was computed. [2022-07-22 22:34:46,852 INFO L895 garLoopResultBuilder]: At program point L9539(line 9539) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2022-07-22 22:34:46,853 INFO L899 garLoopResultBuilder]: For program point L9539-1(lines 9539 9540) no Hoare annotation was computed. [2022-07-22 22:34:46,853 INFO L895 garLoopResultBuilder]: At program point L9419-2(line 9419) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse1 18446744073709551616)) (* (- 1) .cse1) .cse0)) 18446744073709551616)))) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)))) [2022-07-22 22:34:46,853 INFO L899 garLoopResultBuilder]: For program point L9419-3(line 9419) no Hoare annotation was computed. [2022-07-22 22:34:46,853 INFO L895 garLoopResultBuilder]: At program point L9419-4(line 9419) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse1 18446744073709551616)) (* (- 1) .cse1) .cse0)) 18446744073709551616)))) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)))) [2022-07-22 22:34:46,853 INFO L899 garLoopResultBuilder]: For program point L9419-5(line 9419) no Hoare annotation was computed. [2022-07-22 22:34:46,853 INFO L895 garLoopResultBuilder]: At program point L9539-2(line 9539) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2022-07-22 22:34:46,854 INFO L899 garLoopResultBuilder]: For program point L9539-3(line 9539) no Hoare annotation was computed. [2022-07-22 22:34:46,854 INFO L899 garLoopResultBuilder]: For program point L9539-5(lines 9539 9540) no Hoare annotation was computed. [2022-07-22 22:34:46,854 INFO L895 garLoopResultBuilder]: At program point L9556(line 9556) the Hoare annotation is: false [2022-07-22 22:34:46,854 INFO L899 garLoopResultBuilder]: For program point L9556-1(line 9556) no Hoare annotation was computed. [2022-07-22 22:34:46,854 INFO L899 garLoopResultBuilder]: For program point L6612-1(line 6612) no Hoare annotation was computed. [2022-07-22 22:34:46,854 INFO L895 garLoopResultBuilder]: At program point L9560(line 9560) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ret1356#1|) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ret1356#1| 1) (< 0 |#StackHeapBarrier|)) [2022-07-22 22:34:46,854 INFO L895 garLoopResultBuilder]: At program point L6612(line 6612) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)) [2022-07-22 22:34:46,854 INFO L899 garLoopResultBuilder]: For program point L9560-1(line 9560) no Hoare annotation was computed. [2022-07-22 22:34:46,855 INFO L899 garLoopResultBuilder]: For program point L9420(lines 9420 9428) no Hoare annotation was computed. [2022-07-22 22:34:46,855 INFO L895 garLoopResultBuilder]: At program point L6600(lines 6598 6601) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-22 22:34:46,855 INFO L895 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-22 22:34:46,855 INFO L899 garLoopResultBuilder]: For program point L9544-1(line 9544) no Hoare annotation was computed. [2022-07-22 22:34:46,855 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-22 22:34:46,855 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-22 22:34:46,855 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-22 22:34:46,856 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-22 22:34:46,856 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-22 22:34:46,856 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-22 22:34:46,856 INFO L902 garLoopResultBuilder]: At program point aws_array_eq_ignore_caseENTRY(lines 7651 7681) the Hoare annotation is: true [2022-07-22 22:34:46,856 INFO L899 garLoopResultBuilder]: For program point aws_array_eq_ignore_caseFINAL(lines 7651 7681) no Hoare annotation was computed. [2022-07-22 22:34:46,856 INFO L899 garLoopResultBuilder]: For program point L7671(lines 7671 7675) no Hoare annotation was computed. [2022-07-22 22:34:46,856 INFO L899 garLoopResultBuilder]: For program point L7670-4(lines 7670 7676) no Hoare annotation was computed. [2022-07-22 22:34:46,857 INFO L902 garLoopResultBuilder]: At program point L7670-3(lines 7670 7676) the Hoare annotation is: true [2022-07-22 22:34:46,857 INFO L899 garLoopResultBuilder]: For program point L7670-2(lines 7670 7676) no Hoare annotation was computed. [2022-07-22 22:34:46,857 INFO L899 garLoopResultBuilder]: For program point L7659(lines 7656 7681) no Hoare annotation was computed. [2022-07-22 22:34:46,857 INFO L902 garLoopResultBuilder]: At program point L7657-1(line 7657) the Hoare annotation is: true [2022-07-22 22:34:46,857 INFO L902 garLoopResultBuilder]: At program point L7657(line 7657) the Hoare annotation is: true [2022-07-22 22:34:46,858 INFO L899 garLoopResultBuilder]: For program point aws_array_eq_ignore_caseEXIT(lines 7651 7681) no Hoare annotation was computed. [2022-07-22 22:34:46,861 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:46,863 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 22:34:46,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:34:46,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:34:46,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 10:34:46 BoogieIcfgContainer [2022-07-22 22:34:46,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 22:34:46,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 22:34:46,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 22:34:46,895 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 22:34:46,895 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:34:05" (3/4) ... [2022-07-22 22:34:46,897 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 22:34:46,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-07-22 22:34:46,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-22 22:34:46,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-22 22:34:46,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-07-22 22:34:46,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-22 22:34:46,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-22 22:34:46,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-22 22:34:46,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq_ignore_case [2022-07-22 22:34:46,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-22 22:34:46,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-22 22:34:46,922 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2022-07-22 22:34:46,923 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2022-07-22 22:34:46,924 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-07-22 22:34:46,925 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-22 22:34:46,927 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-22 22:34:46,928 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-22 22:34:46,929 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 22:34:46,930 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 22:34:46,964 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0 < unknown-#StackHeapBarrier-unknown) || ((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(\old(max_size) == 16)) [2022-07-22 22:34:47,275 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 22:34:47,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 22:34:47,276 INFO L158 Benchmark]: Toolchain (without parser) took 45732.66ms. Allocated memory was 88.1MB in the beginning and 490.7MB in the end (delta: 402.7MB). Free memory was 44.4MB in the beginning and 211.4MB in the end (delta: -167.0MB). Peak memory consumption was 233.8MB. Max. memory is 16.1GB. [2022-07-22 22:34:47,276 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 88.1MB. Free memory was 58.5MB in the beginning and 58.5MB in the end (delta: 23.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 22:34:47,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2184.47ms. Allocated memory was 88.1MB in the beginning and 146.8MB in the end (delta: 58.7MB). Free memory was 44.4MB in the beginning and 71.9MB in the end (delta: -27.5MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. [2022-07-22 22:34:47,277 INFO L158 Benchmark]: Boogie Procedure Inliner took 176.18ms. Allocated memory is still 146.8MB. Free memory was 71.9MB in the beginning and 59.9MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 22:34:47,277 INFO L158 Benchmark]: Boogie Preprocessor took 117.39ms. Allocated memory is still 146.8MB. Free memory was 59.9MB in the beginning and 89.5MB in the end (delta: -29.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 22:34:47,277 INFO L158 Benchmark]: RCFGBuilder took 1350.22ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 89.5MB in the beginning and 78.8MB in the end (delta: 10.7MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2022-07-22 22:34:47,278 INFO L158 Benchmark]: TraceAbstraction took 41516.01ms. Allocated memory was 188.7MB in the beginning and 490.7MB in the end (delta: 302.0MB). Free memory was 77.8MB in the beginning and 343.5MB in the end (delta: -265.8MB). Peak memory consumption was 242.8MB. Max. memory is 16.1GB. [2022-07-22 22:34:47,278 INFO L158 Benchmark]: Witness Printer took 381.36ms. Allocated memory is still 490.7MB. Free memory was 342.5MB in the beginning and 211.4MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-07-22 22:34:47,279 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.18ms. Allocated memory is still 88.1MB. Free memory was 58.5MB in the beginning and 58.5MB in the end (delta: 23.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2184.47ms. Allocated memory was 88.1MB in the beginning and 146.8MB in the end (delta: 58.7MB). Free memory was 44.4MB in the beginning and 71.9MB in the end (delta: -27.5MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 176.18ms. Allocated memory is still 146.8MB. Free memory was 71.9MB in the beginning and 59.9MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.39ms. Allocated memory is still 146.8MB. Free memory was 59.9MB in the beginning and 89.5MB in the end (delta: -29.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1350.22ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 89.5MB in the beginning and 78.8MB in the end (delta: 10.7MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. * TraceAbstraction took 41516.01ms. Allocated memory was 188.7MB in the beginning and 490.7MB in the end (delta: 302.0MB). Free memory was 77.8MB in the beginning and 343.5MB in the end (delta: -265.8MB). Peak memory consumption was 242.8MB. Max. memory is 16.1GB. * Witness Printer took 381.36ms. Allocated memory is still 490.7MB. Free memory was 342.5MB in the beginning and 211.4MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. 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: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.4s, OverallIterations: 19, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3317 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3183 mSDsluCounter, 12592 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2326 IncrementalHoareTripleChecker+Unchecked, 9804 mSDsCounter, 889 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10497 IncrementalHoareTripleChecker+Invalid, 13712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 889 mSolverCounterUnsat, 2788 mSDtfsCounter, 10497 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2384 GetRequests, 1954 SyntacticMatches, 42 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3484 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=690occurred in iteration=14, InterpolantAutomatonStates: 243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 311 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 41 LocationsWithAnnotation, 732 PreInvPairs, 780 NumberOfFragments, 1107 HoareAnnotationTreeSize, 732 FomulaSimplifications, 452 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 41 FomulaSimplificationsInter, 9750 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 2740 NumberOfCodeBlocks, 2740 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3351 ConstructedInterpolants, 120 QuantifiedInterpolants, 19347 SizeOfPredicates, 106 NumberOfNonLiveVariables, 28568 ConjunctsInSsa, 249 ConjunctsInUnsatCore, 37 InterpolantComputations, 13 PerfectInterpolantSequences, 1909/2127 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 && buf == 0) && str == 0) && 1 < buf) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 7670]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9416]: Loop Invariant [2022-07-22 22:34:47,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:34:47,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((buf == buf && str == 0) && buf == 0) && str == 0) && !(#memory_$Pointer$[buf][8] == 0)) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616) + -1 * unknown-#memory_int-unknown[buf][buf] + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && 1 < buf) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && buf == 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: !(0 < unknown-#StackHeapBarrier-unknown) || ((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(\old(max_size) == 16)) RESULT: Ultimate proved your program to be correct! [2022-07-22 22:34:47,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE