./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_new_from_c_str_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 d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:17:41,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:17:41,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:17:41,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:17:41,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:17:41,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:17:41,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:17:41,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:17:41,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:17:41,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:17:41,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:17:41,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:17:41,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:17:41,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:17:41,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:17:41,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:17:41,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:17:41,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:17:41,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:17:41,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:17:41,619 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:17:41,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:17:41,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:17:41,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:17:41,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:17:41,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:17:41,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:17:41,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:17:41,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:17:41,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:17:41,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:17:41,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:17:41,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:17:41,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:17:41,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:17:41,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:17:41,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:17:41,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:17:41,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:17:41,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:17:41,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:17:41,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:17:41,636 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:17:41,653 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:17:41,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:17:41,654 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:17:41,654 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:17:41,655 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:17:41,655 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:17:41,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:17:41,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:17:41,656 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:17:41,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:17:41,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:17:41,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:17:41,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:17:41,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:17:41,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:17:41,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:17:41,657 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:17:41,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:17:41,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:17:41,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:17:41,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:17:41,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:17:41,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:17:41,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:17:41,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:17:41,660 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:17:41,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:17:41,660 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:17:41,660 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:17:41,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:17:41,660 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 -> d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd [2022-07-12 11:17:41,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:17:41,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:17:41,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:17:41,842 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:17:41,842 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:17:41,843 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-07-12 11:17:41,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c59a845af/cc9b5dddacfe4b2a98b463c5a69274f1/FLAG5ada8df7c [2022-07-12 11:17:42,419 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:17:42,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-07-12 11:17:42,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c59a845af/cc9b5dddacfe4b2a98b463c5a69274f1/FLAG5ada8df7c [2022-07-12 11:17:42,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c59a845af/cc9b5dddacfe4b2a98b463c5a69274f1 [2022-07-12 11:17:42,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:17:42,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:17:42,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:17:42,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:17:42,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:17:42,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:17:42" (1/1) ... [2022-07-12 11:17:42,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d51635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:42, skipping insertion in model container [2022-07-12 11:17:42,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:17:42" (1/1) ... [2022-07-12 11:17:42,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:17:43,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:17:43,193 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_new_from_c_str_harness.i[4499,4512] [2022-07-12 11:17:43,198 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_new_from_c_str_harness.i[4559,4572] [2022-07-12 11:17:43,683 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:43,687 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:43,688 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:43,688 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:43,689 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:43,695 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:43,696 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:43,697 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:43,697 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:43,899 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:17:43,900 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:17:43,901 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:17:43,902 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:17:43,906 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:17:43,909 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:17:43,910 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:17:43,911 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:17:43,912 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:17:43,914 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:17:44,023 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:17:44,087 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:44,090 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:44,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:17:44,158 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:17:44,166 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_new_from_c_str_harness.i[4499,4512] [2022-07-12 11:17:44,167 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_new_from_c_str_harness.i[4559,4572] [2022-07-12 11:17:44,185 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:44,185 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:44,185 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:44,186 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:44,186 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:44,189 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:44,190 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:44,190 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:44,190 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:44,216 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:17:44,217 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:17:44,218 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:17:44,223 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:17:44,224 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:17:44,224 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:17:44,224 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:17:44,224 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:17:44,225 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:17:44,225 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:17:44,243 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:17:44,279 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:44,280 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:44,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:17:44,446 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:17:44,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:44 WrapperNode [2022-07-12 11:17:44,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:17:44,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:17:44,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:17:44,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:17:44,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:44" (1/1) ... [2022-07-12 11:17:44,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:44" (1/1) ... [2022-07-12 11:17:44,567 INFO L137 Inliner]: procedures = 690, calls = 2735, calls flagged for inlining = 62, calls inlined = 9, statements flattened = 812 [2022-07-12 11:17:44,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:17:44,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:17:44,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:17:44,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:17:44,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:44" (1/1) ... [2022-07-12 11:17:44,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:44" (1/1) ... [2022-07-12 11:17:44,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:44" (1/1) ... [2022-07-12 11:17:44,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:44" (1/1) ... [2022-07-12 11:17:44,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:44" (1/1) ... [2022-07-12 11:17:44,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:44" (1/1) ... [2022-07-12 11:17:44,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:44" (1/1) ... [2022-07-12 11:17:44,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:17:44,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:17:44,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:17:44,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:17:44,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:44" (1/1) ... [2022-07-12 11:17:44,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:17:44,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:44,679 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-12 11:17:44,696 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-12 11:17:44,714 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-12 11:17:44,714 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-12 11:17:44,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:17:44,714 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 11:17:44,714 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 11:17:44,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-07-12 11:17:44,715 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-07-12 11:17:44,715 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-07-12 11:17:44,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 11:17:44,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 11:17:44,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:17:44,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 11:17:44,716 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 11:17:44,717 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-12 11:17:44,717 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-12 11:17:44,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:17:44,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:17:44,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:17:44,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:17:44,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:17:44,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:17:44,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:17:44,718 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 11:17:44,718 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 11:17:44,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 11:17:44,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 11:17:44,719 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-07-12 11:17:44,719 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-07-12 11:17:44,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:17:44,720 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:17:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-07-12 11:17:44,720 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-07-12 11:17:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:17:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-12 11:17:44,721 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-12 11:17:44,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:17:44,721 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2022-07-12 11:17:44,721 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2022-07-12 11:17:44,721 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-12 11:17:44,721 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-12 11:17:44,721 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-12 11:17:44,721 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-12 11:17:44,721 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 11:17:44,722 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 11:17:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:17:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-07-12 11:17:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:17:44,905 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:17:44,908 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:17:45,030 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2022-07-12 11:17:45,552 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:17:45,560 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:17:45,560 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 11:17:45,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:17:45 BoogieIcfgContainer [2022-07-12 11:17:45,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:17:45,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:17:45,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:17:45,568 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:17:45,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:17:42" (1/3) ... [2022-07-12 11:17:45,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632d0535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:17:45, skipping insertion in model container [2022-07-12 11:17:45,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:44" (2/3) ... [2022-07-12 11:17:45,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632d0535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:17:45, skipping insertion in model container [2022-07-12 11:17:45,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:17:45" (3/3) ... [2022-07-12 11:17:45,570 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_c_str_harness.i [2022-07-12 11:17:45,579 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:17:45,579 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:17:45,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:17:45,638 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@27fbbc0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f29337a [2022-07-12 11:17:45,638 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:17:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-07-12 11:17:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-12 11:17:45,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:45,652 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:17:45,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:45,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:45,659 INFO L85 PathProgramCache]: Analyzing trace with hash -555983859, now seen corresponding path program 1 times [2022-07-12 11:17:45,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:45,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262521662] [2022-07-12 11:17:45,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:45,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:17:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:17:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:17:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:17:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 11:17:46,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:46,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262521662] [2022-07-12 11:17:46,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262521662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:46,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:46,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:17:46,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744571725] [2022-07-12 11:17:46,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:46,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:17:46,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:46,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:17:46,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:17:46,260 INFO L87 Difference]: Start difference. First operand has 136 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 11:17:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:46,560 INFO L93 Difference]: Finished difference Result 283 states and 370 transitions. [2022-07-12 11:17:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:17:46,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 74 [2022-07-12 11:17:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:46,576 INFO L225 Difference]: With dead ends: 283 [2022-07-12 11:17:46,576 INFO L226 Difference]: Without dead ends: 147 [2022-07-12 11:17:46,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:17:46,586 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 99 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:46,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 198 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:17:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-12 11:17:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2022-07-12 11:17:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.15) internal successors, (92), 81 states have internal predecessors, (92), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-07-12 11:17:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2022-07-12 11:17:46,634 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 74 [2022-07-12 11:17:46,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:46,635 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2022-07-12 11:17:46,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 11:17:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2022-07-12 11:17:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-12 11:17:46,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:46,639 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:17:46,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:17:46,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:46,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:46,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1001240943, now seen corresponding path program 1 times [2022-07-12 11:17:46,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:46,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022610275] [2022-07-12 11:17:46,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:46,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:17:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:17:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:17:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:17:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 11:17:46,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:46,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022610275] [2022-07-12 11:17:46,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022610275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:46,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:46,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:17:46,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563291437] [2022-07-12 11:17:46,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:46,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:17:46,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:46,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:17:46,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:17:46,953 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-12 11:17:47,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:47,429 INFO L93 Difference]: Finished difference Result 196 states and 238 transitions. [2022-07-12 11:17:47,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:17:47,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2022-07-12 11:17:47,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:47,432 INFO L225 Difference]: With dead ends: 196 [2022-07-12 11:17:47,432 INFO L226 Difference]: Without dead ends: 152 [2022-07-12 11:17:47,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:17:47,434 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 101 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:47,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 382 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:17:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-12 11:17:47,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 135. [2022-07-12 11:17:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 85 states have internal predecessors, (96), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (34), 34 states have call predecessors, (34), 33 states have call successors, (34) [2022-07-12 11:17:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2022-07-12 11:17:47,451 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 74 [2022-07-12 11:17:47,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:47,452 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2022-07-12 11:17:47,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-12 11:17:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2022-07-12 11:17:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 11:17:47,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:47,456 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:17:47,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 11:17:47,457 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:47,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1994019405, now seen corresponding path program 1 times [2022-07-12 11:17:47,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:47,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501188355] [2022-07-12 11:17:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:47,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:47,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:47,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:47,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:17:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:17:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:47,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:17:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:47,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:17:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:47,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:47,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:47,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:47,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:47,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:47,716 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 11:17:47,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:47,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501188355] [2022-07-12 11:17:47,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501188355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:47,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:47,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:17:47,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544387959] [2022-07-12 11:17:47,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:47,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:17:47,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:47,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:17:47,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:17:47,718 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 11:17:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:48,297 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2022-07-12 11:17:48,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:17:48,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 80 [2022-07-12 11:17:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:48,299 INFO L225 Difference]: With dead ends: 217 [2022-07-12 11:17:48,299 INFO L226 Difference]: Without dead ends: 178 [2022-07-12 11:17:48,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:17:48,300 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 180 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:48,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 470 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 11:17:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-12 11:17:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 140. [2022-07-12 11:17:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 89 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 35 states have call predecessors, (35), 33 states have call successors, (35) [2022-07-12 11:17:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2022-07-12 11:17:48,309 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 80 [2022-07-12 11:17:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:48,310 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2022-07-12 11:17:48,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 11:17:48,310 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2022-07-12 11:17:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 11:17:48,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:48,311 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:17:48,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:17:48,311 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:48,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1920697878, now seen corresponding path program 1 times [2022-07-12 11:17:48,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:48,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809531266] [2022-07-12 11:17:48,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:48,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:17:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:17:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:17:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:17:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 11:17:48,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:48,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809531266] [2022-07-12 11:17:48,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809531266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:48,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:48,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 11:17:48,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046418482] [2022-07-12 11:17:48,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:48,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 11:17:48,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:48,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 11:17:48,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:17:48,673 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 11:17:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:49,719 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2022-07-12 11:17:49,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 11:17:49,719 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 82 [2022-07-12 11:17:49,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:49,721 INFO L225 Difference]: With dead ends: 178 [2022-07-12 11:17:49,721 INFO L226 Difference]: Without dead ends: 161 [2022-07-12 11:17:49,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-07-12 11:17:49,723 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 185 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:49,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 744 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 11:17:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-12 11:17:49,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 126. [2022-07-12 11:17:49,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 78 states have internal predecessors, (86), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-12 11:17:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2022-07-12 11:17:49,731 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 82 [2022-07-12 11:17:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:49,732 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2022-07-12 11:17:49,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 11:17:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2022-07-12 11:17:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-12 11:17:49,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:49,733 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:49,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:17:49,734 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:49,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:49,734 INFO L85 PathProgramCache]: Analyzing trace with hash -870191708, now seen corresponding path program 1 times [2022-07-12 11:17:49,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:49,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825219962] [2022-07-12 11:17:49,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:49,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:17:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:17:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:17:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:17:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:17:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:17:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:17:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:17:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:17:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:17:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:17:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-12 11:17:50,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:50,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825219962] [2022-07-12 11:17:50,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825219962] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:50,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:50,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:17:50,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812356808] [2022-07-12 11:17:50,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:50,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:17:50,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:50,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:17:50,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:17:50,077 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 11:17:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:50,690 INFO L93 Difference]: Finished difference Result 206 states and 249 transitions. [2022-07-12 11:17:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:17:50,691 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2022-07-12 11:17:50,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:50,692 INFO L225 Difference]: With dead ends: 206 [2022-07-12 11:17:50,692 INFO L226 Difference]: Without dead ends: 151 [2022-07-12 11:17:50,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:17:50,693 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 159 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:50,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 464 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 11:17:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-12 11:17:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2022-07-12 11:17:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 81 states have (on average 1.1111111111111112) internal successors, (90), 82 states have internal predecessors, (90), 33 states have call successors, (33), 15 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2022-07-12 11:17:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2022-07-12 11:17:50,699 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 123 [2022-07-12 11:17:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:50,699 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2022-07-12 11:17:50,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 11:17:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2022-07-12 11:17:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-12 11:17:50,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:50,700 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:50,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 11:17:50,700 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:50,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1724885987, now seen corresponding path program 1 times [2022-07-12 11:17:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:50,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174540857] [2022-07-12 11:17:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:17:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:17:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:17:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:17:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:17:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:17:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:17:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:17:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:17:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:17:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 11:17:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,001 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-12 11:17:51,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:51,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174540857] [2022-07-12 11:17:51,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174540857] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:51,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:51,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 11:17:51,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50159177] [2022-07-12 11:17:51,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:51,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:17:51,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:51,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:17:51,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:17:51,005 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 11:17:51,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:51,767 INFO L93 Difference]: Finished difference Result 212 states and 257 transitions. [2022-07-12 11:17:51,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 11:17:51,771 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 129 [2022-07-12 11:17:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:51,772 INFO L225 Difference]: With dead ends: 212 [2022-07-12 11:17:51,773 INFO L226 Difference]: Without dead ends: 143 [2022-07-12 11:17:51,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:17:51,774 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 276 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:51,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 466 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 11:17:51,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-12 11:17:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2022-07-12 11:17:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 77 states have internal predecessors, (83), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-12 11:17:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2022-07-12 11:17:51,781 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 129 [2022-07-12 11:17:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:51,782 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2022-07-12 11:17:51,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 11:17:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2022-07-12 11:17:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 11:17:51,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:51,783 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:17:51,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 11:17:51,783 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:51,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:51,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1745997560, now seen corresponding path program 1 times [2022-07-12 11:17:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:51,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036862430] [2022-07-12 11:17:51,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:51,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:17:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:17:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:17:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:17:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:17:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:17:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:17:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:17:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:17:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:17:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:17:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-12 11:17:52,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:52,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036862430] [2022-07-12 11:17:52,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036862430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:52,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:52,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-12 11:17:52,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495288317] [2022-07-12 11:17:52,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:52,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 11:17:52,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:52,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 11:17:52,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2022-07-12 11:17:52,417 INFO L87 Difference]: Start difference. First operand 124 states and 146 transitions. Second operand has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-07-12 11:17:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:54,230 INFO L93 Difference]: Finished difference Result 190 states and 229 transitions. [2022-07-12 11:17:54,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 11:17:54,230 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) Word has length 134 [2022-07-12 11:17:54,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:54,231 INFO L225 Difference]: With dead ends: 190 [2022-07-12 11:17:54,232 INFO L226 Difference]: Without dead ends: 143 [2022-07-12 11:17:54,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560 [2022-07-12 11:17:54,233 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 87 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:54,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1084 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 11:17:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-12 11:17:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-07-12 11:17:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 88 states have internal predecessors, (93), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2022-07-12 11:17:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 162 transitions. [2022-07-12 11:17:54,241 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 162 transitions. Word has length 134 [2022-07-12 11:17:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:54,241 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 162 transitions. [2022-07-12 11:17:54,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-07-12 11:17:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 162 transitions. [2022-07-12 11:17:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-12 11:17:54,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:54,243 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:17:54,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 11:17:54,243 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:54,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:54,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1524709556, now seen corresponding path program 1 times [2022-07-12 11:17:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:54,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964722803] [2022-07-12 11:17:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:54,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:17:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:17:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:17:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:17:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:17:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:17:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:17:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:17:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:17:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 11:17:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 11:17:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-12 11:17:54,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:54,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964722803] [2022-07-12 11:17:54,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964722803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:54,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:54,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 11:17:54,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309020549] [2022-07-12 11:17:54,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:54,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 11:17:54,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:54,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 11:17:54,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:17:54,514 INFO L87 Difference]: Start difference. First operand 137 states and 162 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 11:17:55,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:55,180 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2022-07-12 11:17:55,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:17:55,180 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2022-07-12 11:17:55,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:55,181 INFO L225 Difference]: With dead ends: 225 [2022-07-12 11:17:55,181 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 11:17:55,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-07-12 11:17:55,182 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 91 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:55,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 478 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 11:17:55,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 11:17:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-12 11:17:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.082191780821918) internal successors, (79), 74 states have internal predecessors, (79), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-12 11:17:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2022-07-12 11:17:55,188 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 140 [2022-07-12 11:17:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:55,188 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2022-07-12 11:17:55,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 11:17:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-07-12 11:17:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 11:17:55,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:55,189 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:17:55,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 11:17:55,189 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:55,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:55,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1517224244, now seen corresponding path program 1 times [2022-07-12 11:17:55,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:55,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578069268] [2022-07-12 11:17:55,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:55,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:17:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:17:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:17:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:17:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:17:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:17:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:17:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:17:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:17:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:17:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:17:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-12 11:17:55,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:55,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578069268] [2022-07-12 11:17:55,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578069268] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:55,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:55,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:17:55,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935819572] [2022-07-12 11:17:55,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:55,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:17:55,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:55,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:17:55,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:17:55,498 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:17:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:55,952 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2022-07-12 11:17:55,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:17:55,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2022-07-12 11:17:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:55,953 INFO L225 Difference]: With dead ends: 166 [2022-07-12 11:17:55,953 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 11:17:55,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:17:55,954 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 117 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:55,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 296 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:17:55,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 11:17:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-12 11:17:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 75 states have internal predecessors, (80), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-12 11:17:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2022-07-12 11:17:55,960 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 135 [2022-07-12 11:17:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:55,961 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2022-07-12 11:17:55,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:17:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2022-07-12 11:17:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 11:17:55,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:55,962 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:17:55,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 11:17:55,962 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash -473758278, now seen corresponding path program 1 times [2022-07-12 11:17:55,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:55,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490562013] [2022-07-12 11:17:55,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:55,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:17:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:17:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:17:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:17:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:17:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:17:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:17:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:17:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:17:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:17:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:17:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-07-12 11:17:56,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:56,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490562013] [2022-07-12 11:17:56,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490562013] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:17:56,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116414052] [2022-07-12 11:17:56,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:56,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:56,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:56,656 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-12 11:17:56,657 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-12 11:17:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:57,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 2931 conjuncts, 121 conjunts are in the unsatisfiable core [2022-07-12 11:17:57,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:17:57,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:18:03,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:18:03,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 11:18:03,576 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 11:18:03,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-07-12 11:18:04,216 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-07-12 11:18:04,216 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-07-12 11:18:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-12 11:18:04,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:18:24,914 WARN L233 SmtUtils]: Spent 19.24s on a formula simplification. DAG size of input: 51 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:18:24,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116414052] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:18:24,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:18:24,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 38] total 58 [2022-07-12 11:18:24,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994737090] [2022-07-12 11:18:24,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:18:24,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-07-12 11:18:24,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:24,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-07-12 11:18:24,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=4249, Unknown=3, NotChecked=0, Total=4422 [2022-07-12 11:18:24,918 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand has 58 states, 51 states have (on average 2.4313725490196076) internal successors, (124), 43 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-07-12 11:18:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:35,976 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2022-07-12 11:18:35,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-12 11:18:35,976 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 51 states have (on average 2.4313725490196076) internal successors, (124), 43 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) Word has length 136 [2022-07-12 11:18:35,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:35,977 INFO L225 Difference]: With dead ends: 175 [2022-07-12 11:18:35,977 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 11:18:35,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1844 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=485, Invalid=9814, Unknown=3, NotChecked=0, Total=10302 [2022-07-12 11:18:35,980 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 223 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 4143 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 5189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 4143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 800 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:35,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1511 Invalid, 5189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 4143 Invalid, 0 Unknown, 800 Unchecked, 2.9s Time] [2022-07-12 11:18:35,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 11:18:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2022-07-12 11:18:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-12 11:18:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2022-07-12 11:18:35,987 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 136 [2022-07-12 11:18:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:35,987 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2022-07-12 11:18:35,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 51 states have (on average 2.4313725490196076) internal successors, (124), 43 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-07-12 11:18:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2022-07-12 11:18:35,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 11:18:35,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:35,989 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:18:36,010 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-12 11:18:36,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 11:18:36,202 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:36,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:36,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1103785842, now seen corresponding path program 2 times [2022-07-12 11:18:36,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:36,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002285478] [2022-07-12 11:18:36,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:36,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:18:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:18:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:18:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:18:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:18:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:18:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:18:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:18:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:18:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:18:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:18:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:18:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:18:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:18:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:36,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:18:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:37,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 11:18:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-07-12 11:18:37,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:37,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002285478] [2022-07-12 11:18:37,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002285478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:18:37,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967198113] [2022-07-12 11:18:37,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:18:37,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:18:37,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:18:37,011 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-12 11:18:37,011 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-12 11:18:38,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:18:38,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:18:38,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 3059 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-12 11:18:38,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:18:38,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:18:41,634 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1270 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_11| Int) (v_ArrVal_1263 Int)) (and (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1327_11|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_1263) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_11| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1270)) |c_#memory_int|))) is different from true [2022-07-12 11:18:45,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:18:45,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:18:45,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:18:45,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-07-12 11:18:46,032 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 11:18:46,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2022-07-12 11:18:46,542 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-07-12 11:18:46,542 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 61 [2022-07-12 11:18:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 150 trivial. 2 not checked. [2022-07-12 11:18:46,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:19:01,998 WARN L233 SmtUtils]: Spent 14.05s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:19:02,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967198113] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:19:02,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:19:02,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 50 [2022-07-12 11:19:02,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888759094] [2022-07-12 11:19:02,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:19:02,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-12 11:19:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:19:02,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-12 11:19:02,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=3163, Unknown=3, NotChecked=112, Total=3422 [2022-07-12 11:19:02,002 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-12 11:19:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:19:14,417 INFO L93 Difference]: Finished difference Result 174 states and 207 transitions. [2022-07-12 11:19:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 11:19:14,417 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 137 [2022-07-12 11:19:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:19:14,418 INFO L225 Difference]: With dead ends: 174 [2022-07-12 11:19:14,418 INFO L226 Difference]: Without dead ends: 123 [2022-07-12 11:19:14,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=333, Invalid=6805, Unknown=6, NotChecked=166, Total=7310 [2022-07-12 11:19:14,421 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 126 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 3035 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 3976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 3035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 802 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:19:14,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1655 Invalid, 3976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 3035 Invalid, 0 Unknown, 802 Unchecked, 2.4s Time] [2022-07-12 11:19:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-12 11:19:14,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2022-07-12 11:19:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 77 states have internal predecessors, (82), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-12 11:19:14,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2022-07-12 11:19:14,427 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 137 [2022-07-12 11:19:14,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:19:14,428 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2022-07-12 11:19:14,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-12 11:19:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2022-07-12 11:19:14,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 11:19:14,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:19:14,429 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:19:14,452 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-12 11:19:14,635 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,SelfDestructingSolverStorable10 [2022-07-12 11:19:14,635 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:19:14,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:19:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash 840196154, now seen corresponding path program 3 times [2022-07-12 11:19:14,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:19:14,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40818502] [2022-07-12 11:19:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:19:14,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:19:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:14,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:19:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:14,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:19:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:14,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:19:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:14,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:14,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:19:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:14,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:19:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:19:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:14,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:19:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:14,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:19:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:14,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:19:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:15,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:15,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:19:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:15,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:15,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:15,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:19:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:15,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:19:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:15,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:19:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:15,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:15,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:19:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:15,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:19:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:15,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:19:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:15,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:19:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:19:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-07-12 11:19:15,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:19:15,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40818502] [2022-07-12 11:19:15,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40818502] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:19:15,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293224051] [2022-07-12 11:19:15,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 11:19:15,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:19:15,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:19:15,490 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-12 11:19:15,491 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-12 11:19:16,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 11:19:16,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:19:16,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 2859 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-12 11:19:16,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:19:17,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:19:24,014 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1924 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_20| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_21| Int) (v_ArrVal_1937 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_19| Int) (v_ArrVal_1931 Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1327_19|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_19| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1924) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_20| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1931) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_21| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1937)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_19| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_20|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_20| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_21|))) is different from true [2022-07-12 11:19:32,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:32,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:32,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:32,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:32,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:32,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:32,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:32,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:32,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:19:32,450 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-12 11:19:32,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2022-07-12 11:19:32,519 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 11:19:32,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2022-07-12 11:19:33,141 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-07-12 11:19:33,142 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 61 [2022-07-12 11:19:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 3 refuted. 1 times theorem prover too weak. 150 trivial. 3 not checked. [2022-07-12 11:19:33,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:19:57,480 WARN L233 SmtUtils]: Spent 20.14s on a formula simplification. DAG size of input: 88 DAG size of output: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:19:57,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293224051] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:19:57,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:19:57,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 52 [2022-07-12 11:19:57,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183964482] [2022-07-12 11:19:57,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:19:57,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-12 11:19:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:19:57,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-12 11:19:57,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=3390, Unknown=7, NotChecked=116, Total=3660 [2022-07-12 11:19:57,483 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-12 11:20:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:20:19,983 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-07-12 11:20:19,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 11:20:19,983 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 138 [2022-07-12 11:20:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:20:19,984 INFO L225 Difference]: With dead ends: 174 [2022-07-12 11:20:19,985 INFO L226 Difference]: Without dead ends: 123 [2022-07-12 11:20:19,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 59.4s TimeCoverageRelationStatistics Valid=340, Invalid=7309, Unknown=11, NotChecked=172, Total=7832 [2022-07-12 11:20:19,987 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 67 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 3296 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 4287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 3296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 916 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:20:19,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1768 Invalid, 4287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 3296 Invalid, 0 Unknown, 916 Unchecked, 2.5s Time] [2022-07-12 11:20:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-12 11:20:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-07-12 11:20:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 77 states have (on average 1.077922077922078) internal successors, (83), 78 states have internal predecessors, (83), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-12 11:20:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2022-07-12 11:20:19,995 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 138 [2022-07-12 11:20:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:20:19,995 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2022-07-12 11:20:19,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-12 11:20:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2022-07-12 11:20:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-12 11:20:19,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:20:19,997 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:20:20,027 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-12 11:20:20,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:20:20,199 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:20:20,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:20:20,200 INFO L85 PathProgramCache]: Analyzing trace with hash 974095886, now seen corresponding path program 4 times [2022-07-12 11:20:20,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:20:20,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895293641] [2022-07-12 11:20:20,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:20:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:20:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:20:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:20:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:20:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:20:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:20:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:20:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:20:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:20:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:20:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:20:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:20:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:20:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:20:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:20:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:20:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:20:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:20:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:20:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:20:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:20:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:20,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:20:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:21,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:20:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:20:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-07-12 11:20:21,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:20:21,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895293641] [2022-07-12 11:20:21,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895293641] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:20:21,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034692596] [2022-07-12 11:20:21,150 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 11:20:21,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:20:21,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:20:21,151 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-12 11:20:21,152 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-12 11:20:23,140 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 11:20:23,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:20:23,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 3315 conjuncts, 157 conjunts are in the unsatisfiable core [2022-07-12 11:20:23,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:20:23,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:20:34,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:34,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:34,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:34,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:34,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:34,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:34,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:34,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:34,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:34,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:34,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:20:34,883 INFO L356 Elim1Store]: treesize reduction 82, result has 38.3 percent of original size [2022-07-12 11:20:34,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 72 [2022-07-12 11:20:34,967 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 11:20:34,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-07-12 11:20:35,717 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-07-12 11:20:35,717 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-07-12 11:20:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-12 11:20:35,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:20:52,900 WARN L233 SmtUtils]: Spent 14.07s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:20:52,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034692596] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:20:52,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:20:52,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 42] total 65 [2022-07-12 11:20:52,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389009152] [2022-07-12 11:20:52,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:20:52,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-12 11:20:52,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:20:52,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-12 11:20:52,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=5218, Unknown=2, NotChecked=0, Total=5402 [2022-07-12 11:20:52,903 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand has 65 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 48 states have internal predecessors, (121), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) [2022-07-12 11:21:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:11,004 INFO L93 Difference]: Finished difference Result 177 states and 209 transitions. [2022-07-12 11:21:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-12 11:21:11,005 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 48 states have internal predecessors, (121), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) Word has length 139 [2022-07-12 11:21:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:11,006 INFO L225 Difference]: With dead ends: 177 [2022-07-12 11:21:11,006 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 11:21:11,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2029 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=486, Invalid=11720, Unknown=4, NotChecked=0, Total=12210 [2022-07-12 11:21:11,010 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 154 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 4058 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 4822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 4058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 589 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:21:11,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1616 Invalid, 4822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 4058 Invalid, 0 Unknown, 589 Unchecked, 3.2s Time] [2022-07-12 11:21:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 11:21:11,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2022-07-12 11:21:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 79 states have internal predecessors, (84), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-12 11:21:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2022-07-12 11:21:11,020 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 139 [2022-07-12 11:21:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:11,020 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2022-07-12 11:21:11,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 48 states have internal predecessors, (121), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) [2022-07-12 11:21:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2022-07-12 11:21:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-12 11:21:11,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:11,022 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:21:11,058 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-12 11:21:11,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:21:11,231 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:11,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash 830020282, now seen corresponding path program 5 times [2022-07-12 11:21:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:11,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134199739] [2022-07-12 11:21:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:11,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:21:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:11,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:21:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:11,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:21:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:11,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:21:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:21:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:21:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:21:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:21:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:21:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:21:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:21:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:21:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:21:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:21:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:21:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:21:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:21:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:21:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:21:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:21:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:21:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 11:21:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-12 11:21:12,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:12,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134199739] [2022-07-12 11:21:12,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134199739] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:21:12,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227521025] [2022-07-12 11:21:12,831 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 11:21:12,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:21:12,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:21:12,832 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-12 11:21:12,833 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-12 11:21:28,654 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-12 11:21:28,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:21:28,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 3443 conjuncts, 168 conjunts are in the unsatisfiable core [2022-07-12 11:21:28,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:21:29,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:22:02,726 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3804 Int) (v_ArrVal_3815 Int) (v_ArrVal_3801 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_49| Int) (v_ArrVal_3809 Int) (v_ArrVal_3791 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_46| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_47| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_48| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_47| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_48|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_3791) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_46| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3801) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_47| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3804) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3809) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_49| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3815))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_49|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1327_46|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_46| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_47|))) is different from true