./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 eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_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-?-eb692b5 [2022-07-19 22:20:27,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:20:27,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:20:27,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:20:27,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:20:27,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:20:27,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:20:27,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:20:27,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:20:27,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:20:27,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:20:27,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:20:27,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:20:27,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:20:27,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:20:27,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:20:27,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:20:27,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:20:27,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:20:27,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:20:27,410 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:20:27,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:20:27,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:20:27,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:20:27,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:20:27,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:20:27,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:20:27,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:20:27,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:20:27,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:20:27,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:20:27,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:20:27,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:20:27,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:20:27,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:20:27,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:20:27,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:20:27,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:20:27,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:20:27,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:20:27,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:20:27,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:20:27,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:20:27,445 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:20:27,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:20:27,446 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:20:27,446 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:20:27,447 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:20:27,447 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:20:27,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:20:27,447 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:20:27,447 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:20:27,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:20:27,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:20:27,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:20:27,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:20:27,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:20:27,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:20:27,449 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:20:27,449 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:20:27,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:20:27,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:20:27,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:20:27,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:20:27,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:20:27,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:20:27,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:20:27,450 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:20:27,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:20:27,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:20:27,450 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:20:27,451 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:20:27,451 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:20:27,451 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-19 22:20:27,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:20:27,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:20:27,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:20:27,671 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:20:27,671 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:20:27,672 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-19 22:20:27,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78de78298/d0d9f687b8e547c3802f62efa3aab86a/FLAGd51257fa2 [2022-07-19 22:20:28,359 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:20:28,360 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-19 22:20:28,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78de78298/d0d9f687b8e547c3802f62efa3aab86a/FLAGd51257fa2 [2022-07-19 22:20:28,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78de78298/d0d9f687b8e547c3802f62efa3aab86a [2022-07-19 22:20:28,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:20:28,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:20:28,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:20:28,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:20:28,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:20:28,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:20:28" (1/1) ... [2022-07-19 22:20:28,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b63f3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:28, skipping insertion in model container [2022-07-19 22:20:28,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:20:28" (1/1) ... [2022-07-19 22:20:28,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:20:28,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:20:29,016 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-19 22:20:29,022 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-19 22:20:29,532 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:29,534 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:29,535 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:29,535 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:29,537 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:29,547 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:29,549 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:29,551 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:29,552 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:29,758 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:20:29,759 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:20:29,760 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:20:29,761 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:20:29,764 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:20:29,766 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:20:29,767 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:20:29,767 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:20:29,769 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:20:29,771 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:20:29,859 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:20:29,950 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:29,950 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:29,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:20:30,032 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:20:30,048 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-19 22:20:30,049 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-19 22:20:30,070 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:30,071 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:30,071 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:30,071 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:30,071 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:30,074 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:30,074 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:30,075 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:30,082 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:30,108 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:20:30,108 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:20:30,109 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:20:30,109 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:20:30,110 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:20:30,110 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:20:30,110 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:20:30,111 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:20:30,111 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:20:30,111 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:20:30,121 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:20:30,161 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:30,161 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:30,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:20:30,401 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:20:30,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:30 WrapperNode [2022-07-19 22:20:30,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:20:30,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:20:30,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:20:30,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:20:30,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:30" (1/1) ... [2022-07-19 22:20:30,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:30" (1/1) ... [2022-07-19 22:20:30,562 INFO L137 Inliner]: procedures = 690, calls = 2735, calls flagged for inlining = 62, calls inlined = 9, statements flattened = 812 [2022-07-19 22:20:30,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:20:30,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:20:30,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:20:30,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:20:30,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:30" (1/1) ... [2022-07-19 22:20:30,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:30" (1/1) ... [2022-07-19 22:20:30,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:30" (1/1) ... [2022-07-19 22:20:30,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:30" (1/1) ... [2022-07-19 22:20:30,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:30" (1/1) ... [2022-07-19 22:20:30,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:30" (1/1) ... [2022-07-19 22:20:30,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:30" (1/1) ... [2022-07-19 22:20:30,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:20:30,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:20:30,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:20:30,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:20:30,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:30" (1/1) ... [2022-07-19 22:20:30,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:20:30,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:20:30,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 22:20:30,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 22:20:30,695 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-19 22:20:30,695 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-19 22:20:30,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:20:30,695 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-19 22:20:30,695 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-19 22:20:30,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-07-19 22:20:30,696 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-07-19 22:20:30,696 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-07-19 22:20:30,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-19 22:20:30,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-19 22:20:30,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:20:30,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-19 22:20:30,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-19 22:20:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-19 22:20:30,698 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-19 22:20:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 22:20:30,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 22:20:30,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:20:30,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:20:30,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:20:30,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:20:30,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:20:30,699 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 22:20:30,700 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 22:20:30,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-19 22:20:30,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 22:20:30,700 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-07-19 22:20:30,701 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-07-19 22:20:30,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 22:20:30,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 22:20:30,701 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-07-19 22:20:30,701 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-07-19 22:20:30,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:20:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-19 22:20:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-19 22:20:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:20:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2022-07-19 22:20:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2022-07-19 22:20:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-19 22:20:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-19 22:20:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-19 22:20:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-19 22:20:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-19 22:20:30,703 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-19 22:20:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 22:20:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-07-19 22:20:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:20:30,927 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:20:30,928 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:20:31,033 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2022-07-19 22:20:31,625 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:20:31,634 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:20:31,634 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 22:20:31,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:20:31 BoogieIcfgContainer [2022-07-19 22:20:31,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:20:31,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:20:31,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:20:31,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:20:31,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:20:28" (1/3) ... [2022-07-19 22:20:31,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c7e878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:20:31, skipping insertion in model container [2022-07-19 22:20:31,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:30" (2/3) ... [2022-07-19 22:20:31,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c7e878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:20:31, skipping insertion in model container [2022-07-19 22:20:31,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:20:31" (3/3) ... [2022-07-19 22:20:31,642 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_c_str_harness.i [2022-07-19 22:20:31,653 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:20:31,654 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:20:31,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:20:31,705 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@143e785b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7452c4e9 [2022-07-19 22:20:31,706 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:20:31,709 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-19 22:20:31,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-19 22:20:31,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:31,721 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-19 22:20:31,723 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:31,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:31,727 INFO L85 PathProgramCache]: Analyzing trace with hash -555983859, now seen corresponding path program 1 times [2022-07-19 22:20:31,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:31,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43471109] [2022-07-19 22:20:31,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:31,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:20:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:20:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:20:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,260 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-19 22:20:32,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:32,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43471109] [2022-07-19 22:20:32,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43471109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:32,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:32,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 22:20:32,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207022171] [2022-07-19 22:20:32,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:32,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:20:32,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:32,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:20:32,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 22:20:32,290 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-19 22:20:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:32,575 INFO L93 Difference]: Finished difference Result 283 states and 370 transitions. [2022-07-19 22:20:32,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:20:32,580 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-19 22:20:32,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:32,591 INFO L225 Difference]: With dead ends: 283 [2022-07-19 22:20:32,592 INFO L226 Difference]: Without dead ends: 147 [2022-07-19 22:20:32,594 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-19 22:20:32,596 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-19 22:20:32,596 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-19 22:20:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-19 22:20:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2022-07-19 22:20:32,647 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-19 22:20:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2022-07-19 22:20:32,653 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 74 [2022-07-19 22:20:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:32,654 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2022-07-19 22:20:32,654 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-19 22:20:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2022-07-19 22:20:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-19 22:20:32,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:32,658 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-19 22:20:32,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 22:20:32,659 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:32,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:32,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1001240943, now seen corresponding path program 1 times [2022-07-19 22:20:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:32,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493748449] [2022-07-19 22:20:32,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:32,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:20:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:20:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:20:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:32,970 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-19 22:20:32,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:32,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493748449] [2022-07-19 22:20:32,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493748449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:32,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:32,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:20:32,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649293836] [2022-07-19 22:20:32,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:32,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:20:32,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:32,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:20:32,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:20:32,973 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-19 22:20:33,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:33,468 INFO L93 Difference]: Finished difference Result 196 states and 238 transitions. [2022-07-19 22:20:33,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:20:33,469 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-19 22:20:33,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:33,470 INFO L225 Difference]: With dead ends: 196 [2022-07-19 22:20:33,470 INFO L226 Difference]: Without dead ends: 152 [2022-07-19 22:20:33,471 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-19 22:20:33,471 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.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:20:33,472 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.5s Time] [2022-07-19 22:20:33,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-19 22:20:33,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 135. [2022-07-19 22:20:33,480 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-19 22:20:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2022-07-19 22:20:33,481 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 74 [2022-07-19 22:20:33,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:33,482 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2022-07-19 22:20:33,482 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-19 22:20:33,482 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2022-07-19 22:20:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-19 22:20:33,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:33,486 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-19 22:20:33,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 22:20:33,487 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:33,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:33,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1994019405, now seen corresponding path program 1 times [2022-07-19 22:20:33,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:33,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812814528] [2022-07-19 22:20:33,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:33,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:33,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:33,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:33,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:33,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:33,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:20:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:33,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:20:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:33,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:33,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:20:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:33,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:33,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:33,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:33,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:33,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:33,734 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-19 22:20:33,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:33,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812814528] [2022-07-19 22:20:33,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812814528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:33,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:33,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 22:20:33,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841381437] [2022-07-19 22:20:33,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:33,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:20:33,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:33,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:20:33,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:20:33,735 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-19 22:20:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:34,283 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2022-07-19 22:20:34,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:20:34,284 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-19 22:20:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:34,286 INFO L225 Difference]: With dead ends: 217 [2022-07-19 22:20:34,286 INFO L226 Difference]: Without dead ends: 178 [2022-07-19 22:20:34,286 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-19 22:20:34,287 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 180 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-19 22:20:34,287 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-19 22:20:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-19 22:20:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 140. [2022-07-19 22:20:34,295 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-19 22:20:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2022-07-19 22:20:34,296 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 80 [2022-07-19 22:20:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:34,297 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2022-07-19 22:20:34,297 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-19 22:20:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2022-07-19 22:20:34,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-19 22:20:34,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:34,298 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-19 22:20:34,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 22:20:34,299 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:34,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:34,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1920697878, now seen corresponding path program 1 times [2022-07-19 22:20:34,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:34,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589406385] [2022-07-19 22:20:34,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:34,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:20:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:20:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:20:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,689 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-19 22:20:34,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:34,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589406385] [2022-07-19 22:20:34,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589406385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:34,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:34,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 22:20:34,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851831558] [2022-07-19 22:20:34,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:34,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 22:20:34,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:34,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 22:20:34,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:20:34,691 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-19 22:20:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:35,674 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2022-07-19 22:20:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 22:20:35,675 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-19 22:20:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:35,678 INFO L225 Difference]: With dead ends: 178 [2022-07-19 22:20:35,678 INFO L226 Difference]: Without dead ends: 161 [2022-07-19 22:20:35,679 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-19 22:20:35,681 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 185 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-19 22:20:35,681 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-19 22:20:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-19 22:20:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 126. [2022-07-19 22:20:35,694 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-19 22:20:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2022-07-19 22:20:35,695 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 82 [2022-07-19 22:20:35,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:35,695 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2022-07-19 22:20:35,696 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-19 22:20:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2022-07-19 22:20:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-19 22:20:35,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:35,697 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-19 22:20:35,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 22:20:35,697 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:35,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:35,698 INFO L85 PathProgramCache]: Analyzing trace with hash -870191708, now seen corresponding path program 1 times [2022-07-19 22:20:35,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:35,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58249891] [2022-07-19 22:20:35,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:35,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:20:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:20:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:20:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:20:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:20:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:20:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:20:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:20:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:20:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:20:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:20:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,983 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-19 22:20:35,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:35,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58249891] [2022-07-19 22:20:35,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58249891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:35,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:35,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 22:20:35,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325789712] [2022-07-19 22:20:35,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:35,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:20:35,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:35,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:20:35,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:20:35,984 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-19 22:20:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:36,654 INFO L93 Difference]: Finished difference Result 206 states and 249 transitions. [2022-07-19 22:20:36,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:20:36,655 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-19 22:20:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:36,656 INFO L225 Difference]: With dead ends: 206 [2022-07-19 22:20:36,656 INFO L226 Difference]: Without dead ends: 151 [2022-07-19 22:20:36,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:20:36,658 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 159 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-19 22:20:36,659 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-19 22:20:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-19 22:20:36,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2022-07-19 22:20:36,665 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-19 22:20:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2022-07-19 22:20:36,665 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 123 [2022-07-19 22:20:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:36,666 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2022-07-19 22:20:36,666 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-19 22:20:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2022-07-19 22:20:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-19 22:20:36,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:36,667 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-19 22:20:36,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 22:20:36,667 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:36,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:36,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1724885987, now seen corresponding path program 1 times [2022-07-19 22:20:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:36,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260903726] [2022-07-19 22:20:36,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:36,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:20:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:20:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:20:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:20:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:20:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:20:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:20:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:20:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:20:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:20:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 22:20:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 22:20:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:36,970 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-19 22:20:36,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:36,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260903726] [2022-07-19 22:20:36,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260903726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:36,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:36,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:20:36,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159946208] [2022-07-19 22:20:36,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:36,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:20:36,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:36,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:20:36,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:20:36,973 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-19 22:20:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:37,668 INFO L93 Difference]: Finished difference Result 212 states and 257 transitions. [2022-07-19 22:20:37,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 22:20:37,668 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-19 22:20:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:37,669 INFO L225 Difference]: With dead ends: 212 [2022-07-19 22:20:37,669 INFO L226 Difference]: Without dead ends: 143 [2022-07-19 22:20:37,670 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-19 22:20:37,670 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.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:20:37,670 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.5s Time] [2022-07-19 22:20:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-19 22:20:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2022-07-19 22:20:37,676 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-19 22:20:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2022-07-19 22:20:37,677 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 129 [2022-07-19 22:20:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:37,677 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2022-07-19 22:20:37,677 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-19 22:20:37,677 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2022-07-19 22:20:37,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-19 22:20:37,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:37,679 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-19 22:20:37,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 22:20:37,679 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:37,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:37,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1745997560, now seen corresponding path program 1 times [2022-07-19 22:20:37,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:37,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670840952] [2022-07-19 22:20:37,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:20:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:20:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:20:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:20:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:20:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:20:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:20:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:20:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:20:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:20:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 22:20:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,311 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-19 22:20:38,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:38,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670840952] [2022-07-19 22:20:38,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670840952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:38,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:38,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-19 22:20:38,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760974208] [2022-07-19 22:20:38,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:38,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 22:20:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:38,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 22:20:38,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2022-07-19 22:20:38,313 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-19 22:20:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:39,909 INFO L93 Difference]: Finished difference Result 190 states and 229 transitions. [2022-07-19 22:20:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 22:20:39,909 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-19 22:20:39,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:39,910 INFO L225 Difference]: With dead ends: 190 [2022-07-19 22:20:39,910 INFO L226 Difference]: Without dead ends: 143 [2022-07-19 22:20:39,911 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-19 22:20:39,912 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 87 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:20:39,912 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.3s Time] [2022-07-19 22:20:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-19 22:20:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-07-19 22:20:39,920 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-19 22:20:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 162 transitions. [2022-07-19 22:20:39,921 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 162 transitions. Word has length 134 [2022-07-19 22:20:39,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:39,921 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 162 transitions. [2022-07-19 22:20:39,921 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-19 22:20:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 162 transitions. [2022-07-19 22:20:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-19 22:20:39,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:39,922 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-19 22:20:39,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 22:20:39,923 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:39,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:39,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1524709556, now seen corresponding path program 1 times [2022-07-19 22:20:39,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:39,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736838563] [2022-07-19 22:20:39,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:20:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:20:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:20:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:20:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:20:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:20:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:20:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:20:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:20:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 22:20:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 22:20:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,199 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-19 22:20:40,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:40,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736838563] [2022-07-19 22:20:40,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736838563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:40,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:40,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 22:20:40,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706094745] [2022-07-19 22:20:40,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:40,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 22:20:40,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:40,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 22:20:40,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:20:40,201 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-19 22:20:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:40,811 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2022-07-19 22:20:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:20:40,811 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-19 22:20:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:40,812 INFO L225 Difference]: With dead ends: 225 [2022-07-19 22:20:40,812 INFO L226 Difference]: Without dead ends: 119 [2022-07-19 22:20:40,813 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-19 22:20:40,813 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.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:20:40,813 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.5s Time] [2022-07-19 22:20:40,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-19 22:20:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-19 22:20:40,819 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-19 22:20:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2022-07-19 22:20:40,820 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 140 [2022-07-19 22:20:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:40,820 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2022-07-19 22:20:40,821 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-19 22:20:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-07-19 22:20:40,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-19 22:20:40,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:40,821 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-19 22:20:40,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 22:20:40,822 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:40,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:40,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1517224244, now seen corresponding path program 1 times [2022-07-19 22:20:40,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:40,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410621258] [2022-07-19 22:20:40,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:40,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:20:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:20:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:20:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:20:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:20:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:20:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:20:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:20:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:20:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:20:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-19 22:20:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,188 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-19 22:20:41,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:41,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410621258] [2022-07-19 22:20:41,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410621258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:41,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:41,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:20:41,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150913443] [2022-07-19 22:20:41,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:41,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:20:41,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:41,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:20:41,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:20:41,190 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-19 22:20:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:41,619 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2022-07-19 22:20:41,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:20:41,619 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-19 22:20:41,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:41,620 INFO L225 Difference]: With dead ends: 166 [2022-07-19 22:20:41,620 INFO L226 Difference]: Without dead ends: 120 [2022-07-19 22:20:41,620 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-19 22:20:41,621 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-19 22:20:41,621 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-19 22:20:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-19 22:20:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-19 22:20:41,626 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-19 22:20:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2022-07-19 22:20:41,626 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 135 [2022-07-19 22:20:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:41,627 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2022-07-19 22:20:41,627 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-19 22:20:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2022-07-19 22:20:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 22:20:41,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:41,628 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-19 22:20:41,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 22:20:41,628 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:41,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:41,628 INFO L85 PathProgramCache]: Analyzing trace with hash -473758278, now seen corresponding path program 1 times [2022-07-19 22:20:41,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:41,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724305545] [2022-07-19 22:20:41,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:41,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:20:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:20:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:20:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:20:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:42,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:20:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:42,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:42,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:20:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:42,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:42,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:42,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:20:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:42,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:20:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:42,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:20:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:42,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:42,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:42,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:42,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:20:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:42,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:20:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:42,419 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-19 22:20:42,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:42,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724305545] [2022-07-19 22:20:42,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724305545] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:20:42,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808252463] [2022-07-19 22:20:42,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:42,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:20:42,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:20:42,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:20:42,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 22:20:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:42,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 2934 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-19 22:20:42,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:20:43,525 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-19 22:20:48,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:20:48,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:20:48,517 INFO L356 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2022-07-19 22:20:48,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 33 [2022-07-19 22:20:48,623 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-19 22:20:48,624 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-19 22:20:49,259 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-07-19 22:20:49,259 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-19 22:20:49,364 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-19 22:20:49,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:20:53,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808252463] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:20:53,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:20:53,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 37] total 57 [2022-07-19 22:20:53,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995911444] [2022-07-19 22:20:53,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:20:53,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-19 22:20:53,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:53,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-19 22:20:53,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=4118, Unknown=3, NotChecked=0, Total=4290 [2022-07-19 22:20:53,349 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 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-19 22:20:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:57,895 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-07-19 22:20:57,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-19 22:20:57,902 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 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-19 22:20:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:57,903 INFO L225 Difference]: With dead ends: 174 [2022-07-19 22:20:57,903 INFO L226 Difference]: Without dead ends: 123 [2022-07-19 22:20:57,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=464, Invalid=9039, Unknown=3, NotChecked=0, Total=9506 [2022-07-19 22:20:57,906 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 223 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 4139 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 4605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 4139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-19 22:20:57,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1414 Invalid, 4605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 4139 Invalid, 0 Unknown, 221 Unchecked, 2.6s Time] [2022-07-19 22:20:57,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-19 22:20:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2022-07-19 22:20:57,916 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-19 22:20:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2022-07-19 22:20:57,917 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 136 [2022-07-19 22:20:57,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:57,919 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2022-07-19 22:20:57,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 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-19 22:20:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2022-07-19 22:20:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-19 22:20:57,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:57,921 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-19 22:20:57,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 22:20:58,127 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-19 22:20:58,128 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:58,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:58,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1103785842, now seen corresponding path program 2 times [2022-07-19 22:20:58,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:58,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939915211] [2022-07-19 22:20:58,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:58,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:20:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:20:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:20:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:20:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:20:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:20:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:20:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:20:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:20:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:20:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 22:20:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,852 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-19 22:20:58,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:58,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939915211] [2022-07-19 22:20:58,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939915211] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:20:58,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214750752] [2022-07-19 22:20:58,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 22:20:58,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:20:58,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:20:58,876 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:20:58,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 22:21:01,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 22:21:01,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:21:01,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 3065 conjuncts, 146 conjunts are in the unsatisfiable core [2022-07-19 22:21:01,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:21:01,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:21:01,831 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 22:21:01,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-19 22:21:02,007 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 22:21:02,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-19 22:21:02,327 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 22:21:02,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-19 22:21:02,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 22:21:03,531 WARN L855 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_memcpy_src.offset| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_10| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_11| Int) (v_ArrVal_1301 (Array Int Int)) (v_ArrVal_1288 Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_10| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1288) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_11| |c_#Ultimate.C_memcpy_dest.offset|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_1301) |c_#Ultimate.C_memcpy_src.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_11| |#Ultimate.C_memcpy_src.offset|)))) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_10| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_11|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1327_10|))) is different from true [2022-07-19 22:21:03,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:03,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:03,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:03,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:03,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:03,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:03,862 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-19 22:21:03,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2022-07-19 22:21:04,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:04,017 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-19 22:21:04,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 58 [2022-07-19 22:21:07,879 INFO L356 Elim1Store]: treesize reduction 108, result has 61.0 percent of original size [2022-07-19 22:21:07,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 22 case distinctions, treesize of input 153 treesize of output 247 [2022-07-19 22:21:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 35 proven. 55 refuted. 0 times theorem prover too weak. 64 trivial. 2 not checked. [2022-07-19 22:21:08,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:21:13,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214750752] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:21:13,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:21:13,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 40] total 62 [2022-07-19 22:21:13,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299311701] [2022-07-19 22:21:13,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:21:13,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-07-19 22:21:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:13,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-07-19 22:21:13,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=4651, Unknown=4, NotChecked=136, Total=4970 [2022-07-19 22:21:13,019 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 62 states, 56 states have (on average 2.1785714285714284) internal successors, (122), 47 states have internal predecessors, (122), 17 states have call successors, (44), 12 states have call predecessors, (44), 15 states have return successors, (40), 23 states have call predecessors, (40), 16 states have call successors, (40) [2022-07-19 22:21:21,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:21,820 INFO L93 Difference]: Finished difference Result 180 states and 210 transitions. [2022-07-19 22:21:21,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-19 22:21:21,821 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 56 states have (on average 2.1785714285714284) internal successors, (122), 47 states have internal predecessors, (122), 17 states have call successors, (44), 12 states have call predecessors, (44), 15 states have return successors, (40), 23 states have call predecessors, (40), 16 states have call successors, (40) Word has length 137 [2022-07-19 22:21:21,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:21,822 INFO L225 Difference]: With dead ends: 180 [2022-07-19 22:21:21,822 INFO L226 Difference]: Without dead ends: 129 [2022-07-19 22:21:21,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 131 SyntacticMatches, 9 SemanticMatches, 106 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1919 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=501, Invalid=10838, Unknown=7, NotChecked=210, Total=11556 [2022-07-19 22:21:21,825 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 143 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 3499 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 4990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 3499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1352 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:21,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1441 Invalid, 4990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 3499 Invalid, 0 Unknown, 1352 Unchecked, 2.3s Time] [2022-07-19 22:21:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-19 22:21:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-19 22:21:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.0740740740740742) internal successors, (87), 82 states have internal predecessors, (87), 31 states have call successors, (31), 16 states have call predecessors, (31), 16 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-19 22:21:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2022-07-19 22:21:21,832 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 137 [2022-07-19 22:21:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:21,833 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2022-07-19 22:21:21,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 56 states have (on average 2.1785714285714284) internal successors, (122), 47 states have internal predecessors, (122), 17 states have call successors, (44), 12 states have call predecessors, (44), 15 states have return successors, (40), 23 states have call predecessors, (40), 16 states have call successors, (40) [2022-07-19 22:21:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2022-07-19 22:21:21,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 22:21:21,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:21,834 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-19 22:21:21,862 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-19 22:21:22,052 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-19 22:21:22,052 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash 840196154, now seen corresponding path program 3 times [2022-07-19 22:21:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:22,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609026106] [2022-07-19 22:21:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:22,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:21:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:21:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:21:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:21:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:21:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:21:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:21:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:21:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:21:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:21:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:21:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:21:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:21:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:21:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:21:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 22:21:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,873 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-19 22:21:22,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:22,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609026106] [2022-07-19 22:21:22,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609026106] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:21:22,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992528455] [2022-07-19 22:21:22,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 22:21:22,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:21:22,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:21:22,875 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:21:22,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 22:21:25,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 22:21:25,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:21:25,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 2868 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-19 22:21:25,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:21:25,837 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-19 22:21:33,235 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1327_22| Int) (v_ArrVal_1981 Int) (v_ArrVal_1992 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_23| Int) (v_ArrVal_1987 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_24| Int)) (and (= (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_22| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1981) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_23| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1987) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_24| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1992)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_23| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_24|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_22| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_23|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1327_22|))) is different from true [2022-07-19 22:21:44,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:44,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:44,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:44,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:44,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:44,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:44,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:44,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:44,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:44,289 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-19 22:21:44,289 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-19 22:21:44,353 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-19 22:21:44,354 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-19 22:21:44,921 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-07-19 22:21:44,921 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-19 22:21:45,095 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-19 22:21:45,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:21:52,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992528455] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:21:52,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:21:52,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 52 [2022-07-19 22:21:52,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909797009] [2022-07-19 22:21:52,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:21:52,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-19 22:21:52,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:52,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-19 22:21:52,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=3389, Unknown=8, NotChecked=116, Total=3660 [2022-07-19 22:21:52,459 INFO L87 Difference]: Start difference. First operand 129 states and 148 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-19 22:22:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:22:20,420 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2022-07-19 22:22:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-19 22:22:20,420 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-19 22:22:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:22:20,421 INFO L225 Difference]: With dead ends: 181 [2022-07-19 22:22:20,421 INFO L226 Difference]: Without dead ends: 130 [2022-07-19 22:22:20,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 48.1s TimeCoverageRelationStatistics Valid=338, Invalid=7306, Unknown=16, NotChecked=172, Total=7832 [2022-07-19 22:22:20,423 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 93 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 3131 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 4151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 917 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:22:20,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1751 Invalid, 4151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3131 Invalid, 0 Unknown, 917 Unchecked, 2.2s Time] [2022-07-19 22:22:20,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-19 22:22:20,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-19 22:22:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 83 states have internal predecessors, (88), 31 states have call successors, (31), 16 states have call predecessors, (31), 16 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-19 22:22:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2022-07-19 22:22:20,431 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 149 transitions. Word has length 138 [2022-07-19 22:22:20,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:22:20,431 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 149 transitions. [2022-07-19 22:22:20,431 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-19 22:22:20,431 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 149 transitions. [2022-07-19 22:22:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-19 22:22:20,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:22:20,432 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-19 22:22:20,458 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-19 22:22:20,644 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-19 22:22:20,644 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:22:20,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:22:20,644 INFO L85 PathProgramCache]: Analyzing trace with hash 974095886, now seen corresponding path program 4 times [2022-07-19 22:22:20,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:22:20,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136570619] [2022-07-19 22:22:20,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:22:20,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:22:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:22:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:22:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:22:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:22:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:22:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:22:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:22:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:22:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:21,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:22:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:21,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:21,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:21,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:22:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:21,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:22:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:21,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:22:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:21,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:21,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:22:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:21,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:21,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:22:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:21,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 22:22:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:21,544 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-19 22:22:21,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:22:21,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136570619] [2022-07-19 22:22:21,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136570619] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:22:21,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523887953] [2022-07-19 22:22:21,545 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 22:22:21,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:22:21,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:22:21,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:22:21,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 22:22:24,224 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 22:22:24,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:22:24,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 3327 conjuncts, 159 conjunts are in the unsatisfiable core [2022-07-19 22:22:24,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:22:24,976 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-19 22:22:54,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:54,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:54,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:54,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:54,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:54,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:54,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:54,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:54,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:54,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:54,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 47 [2022-07-19 22:22:54,607 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-19 22:22:54,607 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-19 22:22:55,349 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-07-19 22:22:55,349 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-19 22:22:55,524 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 20 proven. 14 refuted. 3 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-19 22:22:55,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:23:05,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523887953] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:05,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:23:05,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 43] total 66 [2022-07-19 22:23:05,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766022720] [2022-07-19 22:23:05,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:23:05,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-19 22:23:05,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:05,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-19 22:23:05,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=5357, Unknown=11, NotChecked=0, Total=5550 [2022-07-19 22:23:05,146 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. Second operand has 66 states, 57 states have (on average 2.1228070175438596) internal successors, (121), 49 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-19 22:23:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:51,522 INFO L93 Difference]: Finished difference Result 184 states and 214 transitions. [2022-07-19 22:23:51,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-19 22:23:51,522 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 57 states have (on average 2.1228070175438596) internal successors, (121), 49 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-19 22:23:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:51,523 INFO L225 Difference]: With dead ends: 184 [2022-07-19 22:23:51,523 INFO L226 Difference]: Without dead ends: 133 [2022-07-19 22:23:51,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2077 ImplicationChecksByTransitivity, 77.2s TimeCoverageRelationStatistics Valid=501, Invalid=12586, Unknown=23, NotChecked=0, Total=13110 [2022-07-19 22:23:51,527 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 126 mSDsluCounter, 1817 mSDsCounter, 0 mSdLazyCounter, 4813 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 6109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 4813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1153 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:51,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1911 Invalid, 6109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 4813 Invalid, 0 Unknown, 1153 Unchecked, 3.5s Time] [2022-07-19 22:23:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-19 22:23:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-07-19 22:23:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.072289156626506) internal successors, (89), 84 states have internal predecessors, (89), 31 states have call successors, (31), 16 states have call predecessors, (31), 16 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-19 22:23:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 150 transitions. [2022-07-19 22:23:51,535 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 150 transitions. Word has length 139 [2022-07-19 22:23:51,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:51,536 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 150 transitions. [2022-07-19 22:23:51,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 57 states have (on average 2.1228070175438596) internal successors, (121), 49 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-19 22:23:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 150 transitions. [2022-07-19 22:23:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-19 22:23:51,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:51,537 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-19 22:23:51,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-19 22:23:51,761 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-19 22:23:51,761 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:51,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:51,761 INFO L85 PathProgramCache]: Analyzing trace with hash 830020282, now seen corresponding path program 5 times [2022-07-19 22:23:51,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:51,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949087608] [2022-07-19 22:23:51,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:51,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:23:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:23:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:23:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:23:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:23:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:23:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:23:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:23:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:23:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:23:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:23:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:23:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:23:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:23:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:23:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 22:23:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:52,931 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-19 22:23:52,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:52,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949087608] [2022-07-19 22:23:52,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949087608] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:52,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895671149] [2022-07-19 22:23:52,931 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 22:23:52,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:52,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:52,933 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:52,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 22:24:10,386 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-19 22:24:10,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:24:10,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 3458 conjuncts, 300 conjunts are in the unsatisfiable core [2022-07-19 22:24:10,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:24:10,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:24:11,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:11,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 22:24:11,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 22:24:11,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:11,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 22:24:11,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 22:24:13,058 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 22:24:13,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 22:24:13,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 22:24:13,315 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1327_54| Int) (v_ArrVal_3908 (Array Int Int))) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_54| |c_#Ultimate.C_memcpy_dest.offset|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3908) |c_#Ultimate.C_memcpy_src.base|) (+ |c_#Ultimate.C_memcpy_src.offset| |v_#Ultimate.C_memcpy_#t~loopctr1327_54|)))) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1327_54|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_54| 1) |c_#Ultimate.C_memcpy_#t~loopctr1327|))) is different from true [2022-07-19 22:24:13,328 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1327_54| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_55| Int) (v_ArrVal_3908 (Array Int Int)) (v_ArrVal_3919 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_55| 1) |c_#Ultimate.C_memcpy_#t~loopctr1327|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1327_54|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_54| |c_#Ultimate.C_memcpy_dest.offset|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3908) |c_#Ultimate.C_memcpy_src.base|) (+ |c_#Ultimate.C_memcpy_src.offset| |v_#Ultimate.C_memcpy_#t~loopctr1327_54|))) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_55| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3919)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_54| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_55|))) is different from true [2022-07-19 22:24:13,378 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1327_54| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_55| Int) (v_ArrVal_3908 (Array Int Int)) (v_ArrVal_3919 Int) (v_ArrVal_3931 (Array Int Int)) (|v_#Ultimate.C_memcpy_#t~loopctr1327_56| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_56| 1) |c_#Ultimate.C_memcpy_#t~loopctr1327|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_55| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_56|) (= |c_#memory_int| (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_54| |c_#Ultimate.C_memcpy_dest.offset|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3908) |c_#Ultimate.C_memcpy_src.base|) (+ |c_#Ultimate.C_memcpy_src.offset| |v_#Ultimate.C_memcpy_#t~loopctr1327_54|))) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_55| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3919) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_56| |c_#Ultimate.C_memcpy_dest.offset|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3931) |c_#Ultimate.C_memcpy_src.base|) (+ |c_#Ultimate.C_memcpy_src.offset| |v_#Ultimate.C_memcpy_#t~loopctr1327_56|))))) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1327_54|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_54| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_55|))) is different from true [2022-07-19 22:24:13,450 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_54| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_55| Int) (v_ArrVal_3908 (Array Int Int)) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67| Int) (v_ArrVal_3919 Int) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3942 (Array Int Int)) (|v_#Ultimate.C_memcpy_#t~loopctr1327_56| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_56| 1) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67|)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_55| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_56|) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67| 1) |c_#Ultimate.C_memcpy_#t~loopctr1327|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_54| |c_#Ultimate.C_memcpy_dest.offset|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3908) |c_#Ultimate.C_memcpy_src.base|) (+ |c_#Ultimate.C_memcpy_src.offset| |v_#Ultimate.C_memcpy_#t~loopctr1327_54|))) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_55| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3919) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_56| |c_#Ultimate.C_memcpy_dest.offset|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3931) |c_#Ultimate.C_memcpy_src.base|) (+ |c_#Ultimate.C_memcpy_src.offset| |v_#Ultimate.C_memcpy_#t~loopctr1327_56|))) (+ .cse0 |c_#Ultimate.C_memcpy_dest.offset| |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3942) |c_#Ultimate.C_memcpy_src.base|) (+ .cse0 |c_#Ultimate.C_memcpy_src.offset| |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67|))))) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1327_54|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_54| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_55|)))) is different from true [2022-07-19 22:24:13,528 WARN L855 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_memcpy_src.offset| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_54| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_55| Int) (v_ArrVal_3908 (Array Int Int)) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67| Int) (v_ArrVal_3951 (Array Int Int)) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67| Int) (v_ArrVal_3919 Int) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3942 (Array Int Int)) (|v_#Ultimate.C_memcpy_#t~loopctr1327_56| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_58| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_56| 1) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67|)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_55| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_56|) (= |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|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_54| |c_#Ultimate.C_memcpy_dest.offset|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3908) |c_#Ultimate.C_memcpy_src.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_54| |#Ultimate.C_memcpy_src.offset|))) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_55| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3919) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_56| |c_#Ultimate.C_memcpy_dest.offset|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3931) |c_#Ultimate.C_memcpy_src.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_56| |#Ultimate.C_memcpy_src.offset|))) (+ .cse0 |c_#Ultimate.C_memcpy_dest.offset| |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3942) |c_#Ultimate.C_memcpy_src.base|) (+ .cse0 |#Ultimate.C_memcpy_src.offset| |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67|))) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_58| |c_#Ultimate.C_memcpy_dest.offset|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3951) |c_#Ultimate.C_memcpy_src.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_58| |#Ultimate.C_memcpy_src.offset|))))) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1327_54|) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_58|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_57_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_54| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_55|)))) is different from true [2022-07-19 22:24:14,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,679 INFO L356 Elim1Store]: treesize reduction 100, result has 11.5 percent of original size [2022-07-19 22:24:14,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 76 treesize of output 111 [2022-07-19 22:24:14,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:14,980 INFO L356 Elim1Store]: treesize reduction 118, result has 34.1 percent of original size [2022-07-19 22:24:14,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 97 treesize of output 126