./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_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 caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 09:52:17,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:52:17,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:52:17,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:52:17,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:52:17,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:52:17,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:52:17,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:52:17,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:52:17,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:52:17,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:52:17,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:52:17,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:52:17,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:52:17,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:52:17,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:52:17,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:52:17,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:52:17,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:52:17,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:52:17,598 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:52:17,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:52:17,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:52:17,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:52:17,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:52:17,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:52:17,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:52:17,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:52:17,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:52:17,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:52:17,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:52:17,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:52:17,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:52:17,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:52:17,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:52:17,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:52:17,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:52:17,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:52:17,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:52:17,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:52:17,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:52:17,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:52:17,628 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 09:52:17,659 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:52:17,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:52:17,660 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:52:17,660 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:52:17,660 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:52:17,661 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:52:17,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:52:17,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:52:17,662 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:52:17,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:52:17,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 09:52:17,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:52:17,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:52:17,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:52:17,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:52:17,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:52:17,664 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:52:17,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:52:17,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:52:17,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:52:17,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:52:17,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:52:17,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:52:17,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:52:17,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:52:17,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 09:52:17,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 09:52:17,666 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:52:17,667 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:52:17,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:52:17,667 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 -> caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a [2022-07-21 09:52:18,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:52:18,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:52:18,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:52:18,039 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:52:18,040 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:52:18,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2022-07-21 09:52:18,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01cc6a95/df73f4fbdee5488f9c3c3033e909313f/FLAG32b2f1329 [2022-07-21 09:52:18,854 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:52:18,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2022-07-21 09:52:18,888 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01cc6a95/df73f4fbdee5488f9c3c3033e909313f/FLAG32b2f1329 [2022-07-21 09:52:19,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01cc6a95/df73f4fbdee5488f9c3c3033e909313f [2022-07-21 09:52:19,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:52:19,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:52:19,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:52:19,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:52:19,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:52:19,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:52:19" (1/1) ... [2022-07-21 09:52:19,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1b73ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:19, skipping insertion in model container [2022-07-21 09:52:19,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:52:19" (1/1) ... [2022-07-21 09:52:19,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:52:19,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:52:19,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4499,4512] [2022-07-21 09:52:19,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4559,4572] [2022-07-21 09:52:20,280 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:20,280 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:20,281 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:20,282 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:20,282 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:20,292 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:20,292 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:20,294 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:20,294 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:20,627 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-21 09:52:20,628 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-21 09:52:20,628 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-21 09:52:20,629 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-21 09:52:20,632 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-21 09:52:20,634 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-21 09:52:20,635 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-21 09:52:20,636 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-21 09:52:20,637 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-21 09:52:20,638 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-21 09:52:20,780 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-21 09:52:20,873 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:20,873 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:20,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:52:20,993 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:52:21,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4499,4512] [2022-07-21 09:52:21,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4559,4572] [2022-07-21 09:52:21,029 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:21,029 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:21,030 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:21,030 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:21,045 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:21,049 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:21,050 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:21,051 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:21,051 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:21,085 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-21 09:52:21,086 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-21 09:52:21,086 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-21 09:52:21,087 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-21 09:52:21,087 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-21 09:52:21,088 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-21 09:52:21,088 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-21 09:52:21,088 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-21 09:52:21,089 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-21 09:52:21,089 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-21 09:52:21,112 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-21 09:52:21,175 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:21,177 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:52:21,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:52:21,442 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:52:21,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:21 WrapperNode [2022-07-21 09:52:21,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:52:21,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:52:21,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:52:21,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:52:21,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:21" (1/1) ... [2022-07-21 09:52:21,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:21" (1/1) ... [2022-07-21 09:52:21,675 INFO L137 Inliner]: procedures = 693, calls = 2789, calls flagged for inlining = 60, calls inlined = 7, statements flattened = 869 [2022-07-21 09:52:21,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:52:21,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:52:21,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:52:21,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:52:21,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:21" (1/1) ... [2022-07-21 09:52:21,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:21" (1/1) ... [2022-07-21 09:52:21,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:21" (1/1) ... [2022-07-21 09:52:21,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:21" (1/1) ... [2022-07-21 09:52:21,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:21" (1/1) ... [2022-07-21 09:52:21,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:21" (1/1) ... [2022-07-21 09:52:21,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:21" (1/1) ... [2022-07-21 09:52:21,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:52:21,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:52:21,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:52:21,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:52:21,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:21" (1/1) ... [2022-07-21 09:52:21,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:52:21,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:21,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 09:52:21,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 09:52:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-21 09:52:21,840 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-21 09:52:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-21 09:52:21,840 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-21 09:52:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-21 09:52:21,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-21 09:52:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-21 09:52:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:52:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-21 09:52:21,842 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-21 09:52:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 09:52:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 09:52:21,843 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 09:52:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:52:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:52:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 09:52:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:52:21,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:52:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-21 09:52:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-21 09:52:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 09:52:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 09:52:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 09:52:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:52:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 09:52:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-07-21 09:52:21,846 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-07-21 09:52:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 09:52:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-21 09:52:21,847 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-21 09:52:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-21 09:52:21,848 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-21 09:52:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 09:52:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 09:52:22,157 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:52:22,159 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:52:23,258 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:52:23,266 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:52:23,266 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 09:52:23,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:52:23 BoogieIcfgContainer [2022-07-21 09:52:23,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:52:23,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:52:23,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:52:23,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:52:23,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:52:19" (1/3) ... [2022-07-21 09:52:23,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a0d94e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:52:23, skipping insertion in model container [2022-07-21 09:52:23,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:52:21" (2/3) ... [2022-07-21 09:52:23,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a0d94e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:52:23, skipping insertion in model container [2022-07-21 09:52:23,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:52:23" (3/3) ... [2022-07-21 09:52:23,277 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_cursor_harness.i [2022-07-21 09:52:23,289 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:52:23,290 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:52:23,351 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:52:23,357 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@3e54078a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@38a4c2c1 [2022-07-21 09:52:23,357 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 09:52:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-07-21 09:52:23,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-21 09:52:23,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:23,376 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:23,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash -386411024, now seen corresponding path program 1 times [2022-07-21 09:52:23,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:23,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229969769] [2022-07-21 09:52:23,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:23,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:23,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:23,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:23,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 09:52:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:52:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:52:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,089 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-21 09:52:24,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:24,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229969769] [2022-07-21 09:52:24,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229969769] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:24,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781920376] [2022-07-21 09:52:24,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:24,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:24,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:24,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:52:24,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 09:52:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:24,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 09:52:24,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-21 09:52:24,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:52:24,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781920376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:24,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:52:24,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2022-07-21 09:52:24,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147713039] [2022-07-21 09:52:24,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:24,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 09:52:24,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:24,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 09:52:24,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:52:24,620 INFO L87 Difference]: Start difference. First operand has 125 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 09:52:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:24,649 INFO L93 Difference]: Finished difference Result 241 states and 335 transitions. [2022-07-21 09:52:24,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 09:52:24,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2022-07-21 09:52:24,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:24,659 INFO L225 Difference]: With dead ends: 241 [2022-07-21 09:52:24,659 INFO L226 Difference]: Without dead ends: 120 [2022-07-21 09:52:24,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:52:24,665 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:24,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:52:24,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-21 09:52:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-21 09:52:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 80 states have (on average 1.275) internal successors, (102), 81 states have internal predecessors, (102), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-07-21 09:52:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 159 transitions. [2022-07-21 09:52:24,706 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 159 transitions. Word has length 61 [2022-07-21 09:52:24,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:24,707 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 159 transitions. [2022-07-21 09:52:24,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 09:52:24,708 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 159 transitions. [2022-07-21 09:52:24,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-21 09:52:24,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:24,711 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:24,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 09:52:24,924 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,SelfDestructingSolverStorable0 [2022-07-21 09:52:24,925 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:24,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:24,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1156835566, now seen corresponding path program 1 times [2022-07-21 09:52:24,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:24,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105989056] [2022-07-21 09:52:24,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:24,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 09:52:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:52:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:52:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-21 09:52:25,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:25,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105989056] [2022-07-21 09:52:25,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105989056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:25,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051456587] [2022-07-21 09:52:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:25,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:25,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:25,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:52:25,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 09:52:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:25,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 09:52:25,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 09:52:25,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:52:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-21 09:52:25,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051456587] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:25,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:52:25,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 13 [2022-07-21 09:52:25,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792349229] [2022-07-21 09:52:25,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:25,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:52:25,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:25,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:52:25,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:52:25,923 INFO L87 Difference]: Start difference. First operand 120 states and 159 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-21 09:52:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:26,185 INFO L93 Difference]: Finished difference Result 208 states and 282 transitions. [2022-07-21 09:52:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:52:26,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2022-07-21 09:52:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:26,192 INFO L225 Difference]: With dead ends: 208 [2022-07-21 09:52:26,192 INFO L226 Difference]: Without dead ends: 155 [2022-07-21 09:52:26,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-07-21 09:52:26,197 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 241 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:26,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 535 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:52:26,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-21 09:52:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2022-07-21 09:52:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-21 09:52:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 177 transitions. [2022-07-21 09:52:26,218 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 177 transitions. Word has length 61 [2022-07-21 09:52:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:26,219 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 177 transitions. [2022-07-21 09:52:26,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-21 09:52:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 177 transitions. [2022-07-21 09:52:26,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-21 09:52:26,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:26,222 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:26,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 09:52:26,435 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,SelfDestructingSolverStorable1 [2022-07-21 09:52:26,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1751928336, now seen corresponding path program 1 times [2022-07-21 09:52:26,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:26,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435775003] [2022-07-21 09:52:26,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:52:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 09:52:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:52:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:52:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-21 09:52:26,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:26,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435775003] [2022-07-21 09:52:26,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435775003] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:26,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892100252] [2022-07-21 09:52:26,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:26,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:26,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:26,691 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:52:26,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 09:52:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 09:52:27,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 09:52:27,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:52:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-21 09:52:27,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892100252] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:52:27,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:52:27,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-07-21 09:52:27,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966118752] [2022-07-21 09:52:27,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:52:27,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 09:52:27,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:27,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 09:52:27,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:52:27,333 INFO L87 Difference]: Start difference. First operand 132 states and 177 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2022-07-21 09:52:27,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:27,527 INFO L93 Difference]: Finished difference Result 230 states and 312 transitions. [2022-07-21 09:52:27,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:52:27,528 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) Word has length 61 [2022-07-21 09:52:27,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:27,530 INFO L225 Difference]: With dead ends: 230 [2022-07-21 09:52:27,530 INFO L226 Difference]: Without dead ends: 135 [2022-07-21 09:52:27,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:52:27,532 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 336 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:27,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 584 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:52:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-21 09:52:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-07-21 09:52:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 92 states have internal predecessors, (114), 33 states have call successors, (33), 10 states have call predecessors, (33), 11 states have return successors, (34), 32 states have call predecessors, (34), 32 states have call successors, (34) [2022-07-21 09:52:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 181 transitions. [2022-07-21 09:52:27,546 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 181 transitions. Word has length 61 [2022-07-21 09:52:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:27,546 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 181 transitions. [2022-07-21 09:52:27,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2022-07-21 09:52:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 181 transitions. [2022-07-21 09:52:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 09:52:27,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:27,549 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:27,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 09:52:27,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:27,756 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:27,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:27,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1531369667, now seen corresponding path program 1 times [2022-07-21 09:52:27,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:27,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685606091] [2022-07-21 09:52:27,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:27,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:52:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:52:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:27,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:52:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 09:52:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-21 09:52:28,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:28,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685606091] [2022-07-21 09:52:28,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685606091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:28,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:28,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:52:28,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033201767] [2022-07-21 09:52:28,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:28,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:52:28,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:28,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:52:28,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:52:28,021 INFO L87 Difference]: Start difference. First operand 135 states and 181 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 09:52:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:28,048 INFO L93 Difference]: Finished difference Result 233 states and 317 transitions. [2022-07-21 09:52:28,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 09:52:28,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 65 [2022-07-21 09:52:28,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:28,052 INFO L225 Difference]: With dead ends: 233 [2022-07-21 09:52:28,052 INFO L226 Difference]: Without dead ends: 179 [2022-07-21 09:52:28,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:52:28,054 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 12 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:28,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 481 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:52:28,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-21 09:52:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2022-07-21 09:52:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 118 states have (on average 1.271186440677966) internal successors, (150), 120 states have internal predecessors, (150), 47 states have call successors, (47), 10 states have call predecessors, (47), 11 states have return successors, (50), 46 states have call predecessors, (50), 46 states have call successors, (50) [2022-07-21 09:52:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 247 transitions. [2022-07-21 09:52:28,070 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 247 transitions. Word has length 65 [2022-07-21 09:52:28,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:28,070 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 247 transitions. [2022-07-21 09:52:28,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 09:52:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 247 transitions. [2022-07-21 09:52:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 09:52:28,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:28,073 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:28,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 09:52:28,073 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:28,074 INFO L85 PathProgramCache]: Analyzing trace with hash -84293126, now seen corresponding path program 1 times [2022-07-21 09:52:28,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:28,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120062295] [2022-07-21 09:52:28,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:28,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:52:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:52:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:52:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 09:52:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 09:52:28,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:28,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120062295] [2022-07-21 09:52:28,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120062295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:28,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:28,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:52:28,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219563320] [2022-07-21 09:52:28,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:28,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:52:28,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:28,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:52:28,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:52:28,401 INFO L87 Difference]: Start difference. First operand 177 states and 247 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-21 09:52:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:28,466 INFO L93 Difference]: Finished difference Result 188 states and 263 transitions. [2022-07-21 09:52:28,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:52:28,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 65 [2022-07-21 09:52:28,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:28,469 INFO L225 Difference]: With dead ends: 188 [2022-07-21 09:52:28,469 INFO L226 Difference]: Without dead ends: 181 [2022-07-21 09:52:28,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:52:28,470 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 16 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:28,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1070 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:52:28,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-21 09:52:28,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-07-21 09:52:28,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 124 states have internal predecessors, (153), 47 states have call successors, (47), 10 states have call predecessors, (47), 12 states have return successors, (56), 46 states have call predecessors, (56), 46 states have call successors, (56) [2022-07-21 09:52:28,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 256 transitions. [2022-07-21 09:52:28,491 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 256 transitions. Word has length 65 [2022-07-21 09:52:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:28,492 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 256 transitions. [2022-07-21 09:52:28,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-21 09:52:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2022-07-21 09:52:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 09:52:28,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:28,494 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:28,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 09:52:28,495 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:28,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:28,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1359362750, now seen corresponding path program 1 times [2022-07-21 09:52:28,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:28,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001010735] [2022-07-21 09:52:28,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:28,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:52:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:52:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:52:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 09:52:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-21 09:52:28,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:28,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001010735] [2022-07-21 09:52:28,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001010735] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:28,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259761168] [2022-07-21 09:52:28,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:28,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:28,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:28,953 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:52:28,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 09:52:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:29,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 2507 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-21 09:52:29,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 09:52:30,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:52:30,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-21 09:52:30,337 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-21 09:52:30,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-21 09:52:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-21 09:52:30,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259761168] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:52:30,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:52:30,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2022-07-21 09:52:30,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102657276] [2022-07-21 09:52:30,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:52:30,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 09:52:30,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:30,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 09:52:30,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:52:30,351 INFO L87 Difference]: Start difference. First operand 181 states and 256 transitions. Second operand has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-21 09:52:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:31,107 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2022-07-21 09:52:31,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 09:52:31,108 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 69 [2022-07-21 09:52:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:31,111 INFO L225 Difference]: With dead ends: 334 [2022-07-21 09:52:31,111 INFO L226 Difference]: Without dead ends: 306 [2022-07-21 09:52:31,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 133 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2022-07-21 09:52:31,112 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 96 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:31,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1856 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 383 Invalid, 0 Unknown, 141 Unchecked, 0.4s Time] [2022-07-21 09:52:31,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-21 09:52:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 270. [2022-07-21 09:52:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 184 states have (on average 1.2934782608695652) internal successors, (238), 188 states have internal predecessors, (238), 71 states have call successors, (71), 12 states have call predecessors, (71), 14 states have return successors, (82), 69 states have call predecessors, (82), 70 states have call successors, (82) [2022-07-21 09:52:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 391 transitions. [2022-07-21 09:52:31,140 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 391 transitions. Word has length 69 [2022-07-21 09:52:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:31,141 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 391 transitions. [2022-07-21 09:52:31,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-21 09:52:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 391 transitions. [2022-07-21 09:52:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-21 09:52:31,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:31,146 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:31,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 09:52:31,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:31,364 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:31,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:31,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1404727030, now seen corresponding path program 1 times [2022-07-21 09:52:31,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:31,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562423722] [2022-07-21 09:52:31,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:31,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 09:52:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:52:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 09:52:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 09:52:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-21 09:52:31,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:31,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562423722] [2022-07-21 09:52:31,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562423722] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:31,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682670289] [2022-07-21 09:52:31,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:31,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:31,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:31,658 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:52:31,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 09:52:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:32,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 2519 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 09:52:32,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 09:52:32,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:52:32,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682670289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:32,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:52:32,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2022-07-21 09:52:32,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994898368] [2022-07-21 09:52:32,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:32,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:52:32,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:32,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:52:32,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:52:32,131 INFO L87 Difference]: Start difference. First operand 270 states and 391 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 09:52:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:32,266 INFO L93 Difference]: Finished difference Result 411 states and 598 transitions. [2022-07-21 09:52:32,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:52:32,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-07-21 09:52:32,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:32,269 INFO L225 Difference]: With dead ends: 411 [2022-07-21 09:52:32,270 INFO L226 Difference]: Without dead ends: 275 [2022-07-21 09:52:32,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:52:32,271 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:32,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1146 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:52:32,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-21 09:52:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2022-07-21 09:52:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 188 states have (on average 1.2872340425531914) internal successors, (242), 193 states have internal predecessors, (242), 71 states have call successors, (71), 12 states have call predecessors, (71), 15 states have return successors, (87), 69 states have call predecessors, (87), 70 states have call successors, (87) [2022-07-21 09:52:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 400 transitions. [2022-07-21 09:52:32,305 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 400 transitions. Word has length 73 [2022-07-21 09:52:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:32,306 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 400 transitions. [2022-07-21 09:52:32,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 09:52:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 400 transitions. [2022-07-21 09:52:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-21 09:52:32,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:32,310 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:32,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 09:52:32,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:32,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:32,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:32,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1686084061, now seen corresponding path program 1 times [2022-07-21 09:52:32,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:32,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432216894] [2022-07-21 09:52:32,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:32,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:32,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:32,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:32,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:32,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:32,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:52:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:32,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:52:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:32,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:52:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:32,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:32,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:52:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-21 09:52:32,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:32,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432216894] [2022-07-21 09:52:32,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432216894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:32,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:32,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:52:32,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85414372] [2022-07-21 09:52:32,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:32,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:52:32,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:32,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:52:32,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:52:32,759 INFO L87 Difference]: Start difference. First operand 275 states and 400 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 09:52:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:32,831 INFO L93 Difference]: Finished difference Result 397 states and 565 transitions. [2022-07-21 09:52:32,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:52:32,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 76 [2022-07-21 09:52:32,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:32,834 INFO L225 Difference]: With dead ends: 397 [2022-07-21 09:52:32,834 INFO L226 Difference]: Without dead ends: 296 [2022-07-21 09:52:32,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:52:32,835 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 35 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:32,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 688 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:52:32,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-07-21 09:52:32,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2022-07-21 09:52:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 183 states have (on average 1.2513661202185793) internal successors, (229), 188 states have internal predecessors, (229), 67 states have call successors, (67), 12 states have call predecessors, (67), 15 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2022-07-21 09:52:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2022-07-21 09:52:32,863 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 76 [2022-07-21 09:52:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:32,863 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2022-07-21 09:52:32,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 09:52:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2022-07-21 09:52:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-21 09:52:32,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:32,870 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:32,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 09:52:32,870 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:32,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:32,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1559219441, now seen corresponding path program 1 times [2022-07-21 09:52:32,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:32,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653313830] [2022-07-21 09:52:32,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:32,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:33,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:33,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:33,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:33,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:52:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:33,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:52:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:33,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:52:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:33,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:52:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:33,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:52:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:33,131 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-21 09:52:33,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:33,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653313830] [2022-07-21 09:52:33,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653313830] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:33,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710868126] [2022-07-21 09:52:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:33,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:33,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:33,134 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:52:33,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 09:52:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:33,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 09:52:33,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:33,646 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 09:52:33,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:52:33,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710868126] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:33,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:52:33,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-07-21 09:52:33,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818356485] [2022-07-21 09:52:33,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:33,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:52:33,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:33,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:52:33,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:52:33,648 INFO L87 Difference]: Start difference. First operand 266 states and 373 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 09:52:33,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:33,814 INFO L93 Difference]: Finished difference Result 405 states and 571 transitions. [2022-07-21 09:52:33,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:52:33,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2022-07-21 09:52:33,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:33,816 INFO L225 Difference]: With dead ends: 405 [2022-07-21 09:52:33,816 INFO L226 Difference]: Without dead ends: 266 [2022-07-21 09:52:33,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:52:33,818 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 15 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:33,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 564 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-07-21 09:52:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-21 09:52:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-07-21 09:52:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 183 states have (on average 1.2459016393442623) internal successors, (228), 188 states have internal predecessors, (228), 67 states have call successors, (67), 12 states have call predecessors, (67), 15 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2022-07-21 09:52:33,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 372 transitions. [2022-07-21 09:52:33,861 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 372 transitions. Word has length 75 [2022-07-21 09:52:33,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:33,862 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 372 transitions. [2022-07-21 09:52:33,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 09:52:33,862 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 372 transitions. [2022-07-21 09:52:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-21 09:52:33,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:33,864 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:33,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 09:52:34,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:34,092 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1115318767, now seen corresponding path program 1 times [2022-07-21 09:52:34,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:34,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640194539] [2022-07-21 09:52:34,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:34,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:34,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:34,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:34,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:34,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:52:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:34,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:52:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:34,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:52:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:34,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:52:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:34,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:52:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-21 09:52:34,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:34,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640194539] [2022-07-21 09:52:34,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640194539] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:34,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688359342] [2022-07-21 09:52:34,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:34,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:34,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:34,574 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:52:34,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 09:52:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:34,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 2529 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-21 09:52:34,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:35,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 09:52:35,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 09:52:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 09:52:35,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:52:35,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688359342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:35,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:52:35,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2022-07-21 09:52:35,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194779302] [2022-07-21 09:52:35,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:35,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 09:52:35,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:35,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 09:52:35,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-07-21 09:52:35,452 INFO L87 Difference]: Start difference. First operand 266 states and 372 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-21 09:52:35,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:35,534 INFO L93 Difference]: Finished difference Result 422 states and 584 transitions. [2022-07-21 09:52:35,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 09:52:35,535 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 75 [2022-07-21 09:52:35,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:35,536 INFO L225 Difference]: With dead ends: 422 [2022-07-21 09:52:35,537 INFO L226 Difference]: Without dead ends: 273 [2022-07-21 09:52:35,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-07-21 09:52:35,538 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 46 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:35,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 704 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 31 Unchecked, 0.0s Time] [2022-07-21 09:52:35,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-21 09:52:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2022-07-21 09:52:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 187 states have (on average 1.2459893048128343) internal successors, (233), 191 states have internal predecessors, (233), 67 states have call successors, (67), 13 states have call predecessors, (67), 15 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2022-07-21 09:52:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 377 transitions. [2022-07-21 09:52:35,556 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 377 transitions. Word has length 75 [2022-07-21 09:52:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:35,557 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 377 transitions. [2022-07-21 09:52:35,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-21 09:52:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 377 transitions. [2022-07-21 09:52:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-21 09:52:35,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:35,558 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:35,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 09:52:35,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:35,780 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:35,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:35,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1074644017, now seen corresponding path program 1 times [2022-07-21 09:52:35,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:35,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143230505] [2022-07-21 09:52:35,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:35,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:35,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:35,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:35,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:35,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:52:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:35,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:52:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:35,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:52:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:35,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:52:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:35,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:52:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-21 09:52:35,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:35,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143230505] [2022-07-21 09:52:35,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143230505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:35,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317978483] [2022-07-21 09:52:35,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:35,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:35,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:36,000 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:52:36,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 09:52:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:52:36,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 09:52:36,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:52:36,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317978483] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:36,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:52:36,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-07-21 09:52:36,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700346892] [2022-07-21 09:52:36,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:36,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:52:36,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:36,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:52:36,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:52:36,407 INFO L87 Difference]: Start difference. First operand 270 states and 377 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 09:52:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:36,437 INFO L93 Difference]: Finished difference Result 414 states and 578 transitions. [2022-07-21 09:52:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:52:36,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2022-07-21 09:52:36,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:36,440 INFO L225 Difference]: With dead ends: 414 [2022-07-21 09:52:36,440 INFO L226 Difference]: Without dead ends: 274 [2022-07-21 09:52:36,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:52:36,441 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 9 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:36,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 462 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:52:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-07-21 09:52:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2022-07-21 09:52:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 188 states have (on average 1.2393617021276595) internal successors, (233), 192 states have internal predecessors, (233), 67 states have call successors, (67), 13 states have call predecessors, (67), 15 states have return successors, (75), 65 states have call predecessors, (75), 66 states have call successors, (75) [2022-07-21 09:52:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 375 transitions. [2022-07-21 09:52:36,459 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 375 transitions. Word has length 75 [2022-07-21 09:52:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:36,459 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 375 transitions. [2022-07-21 09:52:36,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 09:52:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 375 transitions. [2022-07-21 09:52:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-21 09:52:36,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:36,461 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:36,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 09:52:36,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-21 09:52:36,676 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:36,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:36,676 INFO L85 PathProgramCache]: Analyzing trace with hash -453034012, now seen corresponding path program 1 times [2022-07-21 09:52:36,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:36,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388842408] [2022-07-21 09:52:36,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:36,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:52:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:52:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:52:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:52:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:52:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:36,918 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 09:52:36,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:36,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388842408] [2022-07-21 09:52:36,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388842408] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:36,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316785804] [2022-07-21 09:52:36,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:36,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:36,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:36,920 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:52:36,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 09:52:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:37,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 09:52:37,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 09:52:37,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:52:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 09:52:37,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316785804] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:52:37,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:52:37,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2022-07-21 09:52:37,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622728381] [2022-07-21 09:52:37,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:52:37,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 09:52:37,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:37,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 09:52:37,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-07-21 09:52:37,592 INFO L87 Difference]: Start difference. First operand 271 states and 375 transitions. Second operand has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2022-07-21 09:52:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:37,957 INFO L93 Difference]: Finished difference Result 385 states and 522 transitions. [2022-07-21 09:52:37,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:52:37,958 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) Word has length 77 [2022-07-21 09:52:37,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:37,959 INFO L225 Difference]: With dead ends: 385 [2022-07-21 09:52:37,960 INFO L226 Difference]: Without dead ends: 292 [2022-07-21 09:52:37,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2022-07-21 09:52:37,961 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 406 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:37,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1241 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 09:52:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-07-21 09:52:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 268. [2022-07-21 09:52:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 186 states have (on average 1.2365591397849462) internal successors, (230), 189 states have internal predecessors, (230), 67 states have call successors, (67), 13 states have call predecessors, (67), 14 states have return successors, (73), 65 states have call predecessors, (73), 66 states have call successors, (73) [2022-07-21 09:52:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2022-07-21 09:52:37,980 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 77 [2022-07-21 09:52:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:37,980 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2022-07-21 09:52:37,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2022-07-21 09:52:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2022-07-21 09:52:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-21 09:52:37,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:37,982 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:38,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 09:52:38,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:38,195 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:38,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:38,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1814152958, now seen corresponding path program 1 times [2022-07-21 09:52:38,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:38,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514446101] [2022-07-21 09:52:38,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:38,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:52:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:52:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:52:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 09:52:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:52:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 09:52:38,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:38,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514446101] [2022-07-21 09:52:38,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514446101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:38,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:38,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:52:38,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109073317] [2022-07-21 09:52:38,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:38,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:52:38,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:38,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:52:38,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:52:38,441 INFO L87 Difference]: Start difference. First operand 268 states and 370 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:52:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:38,529 INFO L93 Difference]: Finished difference Result 360 states and 496 transitions. [2022-07-21 09:52:38,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:52:38,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 78 [2022-07-21 09:52:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:38,531 INFO L225 Difference]: With dead ends: 360 [2022-07-21 09:52:38,531 INFO L226 Difference]: Without dead ends: 290 [2022-07-21 09:52:38,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:52:38,532 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 54 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:38,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 827 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:52:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-21 09:52:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 263. [2022-07-21 09:52:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 183 states have (on average 1.2295081967213115) internal successors, (225), 187 states have internal predecessors, (225), 64 states have call successors, (64), 13 states have call predecessors, (64), 15 states have return successors, (73), 62 states have call predecessors, (73), 63 states have call successors, (73) [2022-07-21 09:52:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 362 transitions. [2022-07-21 09:52:38,550 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 362 transitions. Word has length 78 [2022-07-21 09:52:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:38,551 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 362 transitions. [2022-07-21 09:52:38,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:52:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 362 transitions. [2022-07-21 09:52:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-21 09:52:38,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:38,552 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:38,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 09:52:38,553 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:38,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:38,553 INFO L85 PathProgramCache]: Analyzing trace with hash 635447172, now seen corresponding path program 1 times [2022-07-21 09:52:38,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:38,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143636097] [2022-07-21 09:52:38,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:38,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:52:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:52:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:52:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 09:52:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:52:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 09:52:38,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:38,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143636097] [2022-07-21 09:52:38,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143636097] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:38,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:38,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:52:38,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365301234] [2022-07-21 09:52:38,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:38,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:52:38,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:38,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:52:38,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:52:38,736 INFO L87 Difference]: Start difference. First operand 263 states and 362 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 09:52:38,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:38,764 INFO L93 Difference]: Finished difference Result 379 states and 518 transitions. [2022-07-21 09:52:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:52:38,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 78 [2022-07-21 09:52:38,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:38,766 INFO L225 Difference]: With dead ends: 379 [2022-07-21 09:52:38,766 INFO L226 Difference]: Without dead ends: 264 [2022-07-21 09:52:38,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:52:38,767 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 2 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:38,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 462 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:52:38,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-07-21 09:52:38,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2022-07-21 09:52:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 183 states have (on average 1.2240437158469946) internal successors, (224), 187 states have internal predecessors, (224), 64 states have call successors, (64), 13 states have call predecessors, (64), 15 states have return successors, (73), 62 states have call predecessors, (73), 63 states have call successors, (73) [2022-07-21 09:52:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 361 transitions. [2022-07-21 09:52:38,784 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 361 transitions. Word has length 78 [2022-07-21 09:52:38,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:38,784 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 361 transitions. [2022-07-21 09:52:38,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 09:52:38,784 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 361 transitions. [2022-07-21 09:52:38,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-21 09:52:38,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:38,787 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:38,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 09:52:38,787 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:38,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:38,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1294978694, now seen corresponding path program 1 times [2022-07-21 09:52:38,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:38,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603106235] [2022-07-21 09:52:38,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:38,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:52:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:52:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:52:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 09:52:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:52:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 09:52:38,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:38,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603106235] [2022-07-21 09:52:38,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603106235] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:38,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:38,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:52:38,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127256244] [2022-07-21 09:52:38,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:38,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:52:38,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:38,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:52:38,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:52:38,971 INFO L87 Difference]: Start difference. First operand 263 states and 361 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 09:52:39,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:39,014 INFO L93 Difference]: Finished difference Result 334 states and 445 transitions. [2022-07-21 09:52:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:52:39,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2022-07-21 09:52:39,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:39,016 INFO L225 Difference]: With dead ends: 334 [2022-07-21 09:52:39,016 INFO L226 Difference]: Without dead ends: 263 [2022-07-21 09:52:39,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:52:39,019 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 16 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:39,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 627 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:52:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-21 09:52:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 254. [2022-07-21 09:52:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 177 states have (on average 1.1977401129943503) internal successors, (212), 180 states have internal predecessors, (212), 62 states have call successors, (62), 13 states have call predecessors, (62), 14 states have return successors, (68), 60 states have call predecessors, (68), 61 states have call successors, (68) [2022-07-21 09:52:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 342 transitions. [2022-07-21 09:52:39,036 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 342 transitions. Word has length 78 [2022-07-21 09:52:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:39,038 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 342 transitions. [2022-07-21 09:52:39,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 09:52:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 342 transitions. [2022-07-21 09:52:39,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-21 09:52:39,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:39,039 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:39,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 09:52:39,040 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:39,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1823272801, now seen corresponding path program 1 times [2022-07-21 09:52:39,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:39,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208537818] [2022-07-21 09:52:39,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:39,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:39,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:39,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:39,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 09:52:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:39,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:52:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:39,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:52:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:39,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:52:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:39,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 09:52:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:39,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:52:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:39,381 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-21 09:52:39,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:39,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208537818] [2022-07-21 09:52:39,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208537818] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:39,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879789466] [2022-07-21 09:52:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:39,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:39,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:39,384 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:52:39,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 09:52:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:39,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 2523 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-21 09:52:39,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 09:52:40,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:52:40,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-21 09:52:40,703 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-21 09:52:40,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-21 09:52:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 09:52:40,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879789466] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:52:40,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:52:40,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2022-07-21 09:52:40,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686150077] [2022-07-21 09:52:40,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:52:40,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 09:52:40,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:40,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 09:52:40,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:52:40,715 INFO L87 Difference]: Start difference. First operand 254 states and 342 transitions. Second operand has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-21 09:52:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:41,459 INFO L93 Difference]: Finished difference Result 371 states and 505 transitions. [2022-07-21 09:52:41,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 09:52:41,460 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 79 [2022-07-21 09:52:41,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:41,461 INFO L225 Difference]: With dead ends: 371 [2022-07-21 09:52:41,461 INFO L226 Difference]: Without dead ends: 318 [2022-07-21 09:52:41,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 16 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-07-21 09:52:41,462 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 196 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:41,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1250 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 351 Invalid, 0 Unknown, 125 Unchecked, 0.4s Time] [2022-07-21 09:52:41,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-07-21 09:52:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 253. [2022-07-21 09:52:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 176 states have (on average 1.1875) internal successors, (209), 179 states have internal predecessors, (209), 61 states have call successors, (61), 14 states have call predecessors, (61), 15 states have return successors, (66), 59 states have call predecessors, (66), 59 states have call successors, (66) [2022-07-21 09:52:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 336 transitions. [2022-07-21 09:52:41,478 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 336 transitions. Word has length 79 [2022-07-21 09:52:41,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:41,478 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 336 transitions. [2022-07-21 09:52:41,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-21 09:52:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 336 transitions. [2022-07-21 09:52:41,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-21 09:52:41,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:41,480 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:41,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 09:52:41,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-21 09:52:41,699 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:41,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:41,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1762517655, now seen corresponding path program 1 times [2022-07-21 09:52:41,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:41,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522730534] [2022-07-21 09:52:41,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:41,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:52:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:41,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 09:52:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:52:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:52:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:52:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:52:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:52:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-21 09:52:42,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:42,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522730534] [2022-07-21 09:52:42,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522730534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:42,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:42,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 09:52:42,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997861526] [2022-07-21 09:52:42,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:42,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 09:52:42,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:42,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 09:52:42,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-21 09:52:42,122 INFO L87 Difference]: Start difference. First operand 253 states and 336 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 09:52:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:42,897 INFO L93 Difference]: Finished difference Result 319 states and 428 transitions. [2022-07-21 09:52:42,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 09:52:42,898 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2022-07-21 09:52:42,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:42,899 INFO L225 Difference]: With dead ends: 319 [2022-07-21 09:52:42,899 INFO L226 Difference]: Without dead ends: 312 [2022-07-21 09:52:42,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:52:42,900 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 157 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:42,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 870 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 09:52:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-21 09:52:42,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 258. [2022-07-21 09:52:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 180 states have (on average 1.1833333333333333) internal successors, (213), 184 states have internal predecessors, (213), 61 states have call successors, (61), 14 states have call predecessors, (61), 16 states have return successors, (68), 59 states have call predecessors, (68), 59 states have call successors, (68) [2022-07-21 09:52:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 342 transitions. [2022-07-21 09:52:42,920 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 342 transitions. Word has length 86 [2022-07-21 09:52:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:42,920 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 342 transitions. [2022-07-21 09:52:42,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 09:52:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 342 transitions. [2022-07-21 09:52:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-21 09:52:42,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:42,922 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:42,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 09:52:42,922 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:42,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:42,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1504352217, now seen corresponding path program 1 times [2022-07-21 09:52:42,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:42,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252137345] [2022-07-21 09:52:42,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:42,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:52:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 09:52:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:52:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:52:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:52:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:52:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:52:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-21 09:52:43,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:43,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252137345] [2022-07-21 09:52:43,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252137345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:43,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:43,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:52:43,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162064667] [2022-07-21 09:52:43,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:43,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:52:43,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:43,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:52:43,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:52:43,138 INFO L87 Difference]: Start difference. First operand 258 states and 342 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 09:52:43,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:43,401 INFO L93 Difference]: Finished difference Result 377 states and 487 transitions. [2022-07-21 09:52:43,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:52:43,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 86 [2022-07-21 09:52:43,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:43,403 INFO L225 Difference]: With dead ends: 377 [2022-07-21 09:52:43,403 INFO L226 Difference]: Without dead ends: 251 [2022-07-21 09:52:43,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:52:43,404 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 55 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:43,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 358 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:52:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-21 09:52:43,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2022-07-21 09:52:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 172 states have (on average 1.180232558139535) internal successors, (203), 175 states have internal predecessors, (203), 61 states have call successors, (61), 14 states have call predecessors, (61), 15 states have return successors, (65), 59 states have call predecessors, (65), 59 states have call successors, (65) [2022-07-21 09:52:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 329 transitions. [2022-07-21 09:52:43,422 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 329 transitions. Word has length 86 [2022-07-21 09:52:43,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:43,422 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 329 transitions. [2022-07-21 09:52:43,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 09:52:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 329 transitions. [2022-07-21 09:52:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-21 09:52:43,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:43,424 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:43,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 09:52:43,424 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:43,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:43,425 INFO L85 PathProgramCache]: Analyzing trace with hash 858492976, now seen corresponding path program 1 times [2022-07-21 09:52:43,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:43,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776893927] [2022-07-21 09:52:43,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:43,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 09:52:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:52:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 09:52:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:52:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:52:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:52:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:52:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:52:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-21 09:52:43,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:43,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776893927] [2022-07-21 09:52:43,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776893927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:43,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:43,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-21 09:52:43,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832170990] [2022-07-21 09:52:43,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:43,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 09:52:43,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:43,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 09:52:43,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:52:43,736 INFO L87 Difference]: Start difference. First operand 249 states and 329 transitions. Second operand has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 09:52:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:44,383 INFO L93 Difference]: Finished difference Result 259 states and 338 transitions. [2022-07-21 09:52:44,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 09:52:44,384 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 88 [2022-07-21 09:52:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:44,387 INFO L225 Difference]: With dead ends: 259 [2022-07-21 09:52:44,387 INFO L226 Difference]: Without dead ends: 215 [2022-07-21 09:52:44,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-21 09:52:44,389 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 76 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:44,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1032 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 09:52:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-21 09:52:44,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 185. [2022-07-21 09:52:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 129 states have (on average 1.1627906976744187) internal successors, (150), 133 states have internal predecessors, (150), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43) [2022-07-21 09:52:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2022-07-21 09:52:44,407 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 88 [2022-07-21 09:52:44,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:44,408 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2022-07-21 09:52:44,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 09:52:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2022-07-21 09:52:44,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-21 09:52:44,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:44,410 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:44,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 09:52:44,410 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:44,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:44,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1641071482, now seen corresponding path program 1 times [2022-07-21 09:52:44,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:44,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295997711] [2022-07-21 09:52:44,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:44,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:44,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:44,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:52:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:44,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:44,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:52:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:44,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:52:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:44,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:44,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:44,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:52:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:44,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:52:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:44,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:44,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:52:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:52:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:44,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 09:52:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:44,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 09:52:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-21 09:52:44,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:44,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295997711] [2022-07-21 09:52:44,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295997711] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:44,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969097361] [2022-07-21 09:52:44,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:44,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:44,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:44,876 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:52:44,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 09:52:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:45,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 09:52:45,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:45,431 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-21 09:52:45,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:52:45,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969097361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:45,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:52:45,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 22 [2022-07-21 09:52:45,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258859663] [2022-07-21 09:52:45,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:45,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 09:52:45,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:45,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 09:52:45,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-07-21 09:52:45,433 INFO L87 Difference]: Start difference. First operand 185 states and 233 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-21 09:52:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:45,600 INFO L93 Difference]: Finished difference Result 223 states and 275 transitions. [2022-07-21 09:52:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 09:52:45,601 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 99 [2022-07-21 09:52:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:45,602 INFO L225 Difference]: With dead ends: 223 [2022-07-21 09:52:45,602 INFO L226 Difference]: Without dead ends: 185 [2022-07-21 09:52:45,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2022-07-21 09:52:45,602 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 50 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:45,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1198 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:52:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-21 09:52:45,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-07-21 09:52:45,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 129 states have (on average 1.1550387596899225) internal successors, (149), 133 states have internal predecessors, (149), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43) [2022-07-21 09:52:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 232 transitions. [2022-07-21 09:52:45,614 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 232 transitions. Word has length 99 [2022-07-21 09:52:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:45,614 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 232 transitions. [2022-07-21 09:52:45,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-21 09:52:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 232 transitions. [2022-07-21 09:52:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 09:52:45,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:45,616 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:45,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 09:52:45,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:45,844 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:45,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1774035915, now seen corresponding path program 1 times [2022-07-21 09:52:45,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:45,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612069409] [2022-07-21 09:52:45,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:45,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:45,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:52:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:46,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:46,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:52:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:46,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:52:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:46,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:46,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:46,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:52:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:46,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:52:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:46,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:46,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:52:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:46,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:52:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:46,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 09:52:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:46,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 09:52:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-21 09:52:46,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:46,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612069409] [2022-07-21 09:52:46,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612069409] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:46,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088510720] [2022-07-21 09:52:46,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:46,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:46,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:46,348 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:52:46,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 09:52:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:46,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 2639 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 09:52:46,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-21 09:52:46,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:52:46,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088510720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:46,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:52:46,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2022-07-21 09:52:46,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357864164] [2022-07-21 09:52:46,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:46,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:52:46,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:46,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:52:46,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2022-07-21 09:52:46,943 INFO L87 Difference]: Start difference. First operand 185 states and 232 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-21 09:52:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:47,067 INFO L93 Difference]: Finished difference Result 279 states and 359 transitions. [2022-07-21 09:52:47,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:52:47,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 100 [2022-07-21 09:52:47,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:47,069 INFO L225 Difference]: With dead ends: 279 [2022-07-21 09:52:47,069 INFO L226 Difference]: Without dead ends: 216 [2022-07-21 09:52:47,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2022-07-21 09:52:47,071 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 19 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:47,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 728 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:52:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-21 09:52:47,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 195. [2022-07-21 09:52:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 139 states have internal predecessors, (153), 44 states have call successors, (44), 14 states have call predecessors, (44), 15 states have return successors, (50), 41 states have call predecessors, (50), 43 states have call successors, (50) [2022-07-21 09:52:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 247 transitions. [2022-07-21 09:52:47,087 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 247 transitions. Word has length 100 [2022-07-21 09:52:47,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:47,087 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 247 transitions. [2022-07-21 09:52:47,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-21 09:52:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 247 transitions. [2022-07-21 09:52:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-21 09:52:47,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:47,089 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2022-07-21 09:52:47,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-21 09:52:47,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-21 09:52:47,303 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:47,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:47,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1103291491, now seen corresponding path program 1 times [2022-07-21 09:52:47,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:47,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297690260] [2022-07-21 09:52:47,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:47,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:52:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:52:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:52:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:52:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:52:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:52:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:52:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:52:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 09:52:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 09:52:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-21 09:52:47,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:47,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297690260] [2022-07-21 09:52:47,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297690260] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:47,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125681845] [2022-07-21 09:52:47,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:47,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:47,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:47,776 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:52:47,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-21 09:52:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:48,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 2667 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 09:52:48,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 23 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 09:52:48,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:52:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 09:52:48,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125681845] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:48,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:52:48,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18, 7] total 27 [2022-07-21 09:52:48,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775842362] [2022-07-21 09:52:48,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:48,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:52:48,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:48,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:52:48,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2022-07-21 09:52:48,597 INFO L87 Difference]: Start difference. First operand 195 states and 247 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-21 09:52:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:48,802 INFO L93 Difference]: Finished difference Result 272 states and 342 transitions. [2022-07-21 09:52:48,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:52:48,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 109 [2022-07-21 09:52:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:48,804 INFO L225 Difference]: With dead ends: 272 [2022-07-21 09:52:48,804 INFO L226 Difference]: Without dead ends: 216 [2022-07-21 09:52:48,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2022-07-21 09:52:48,805 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 210 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:48,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 579 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:52:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-21 09:52:48,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 195. [2022-07-21 09:52:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 135 states have (on average 1.1185185185185185) internal successors, (151), 139 states have internal predecessors, (151), 44 states have call successors, (44), 14 states have call predecessors, (44), 15 states have return successors, (50), 41 states have call predecessors, (50), 43 states have call successors, (50) [2022-07-21 09:52:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 245 transitions. [2022-07-21 09:52:48,820 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 245 transitions. Word has length 109 [2022-07-21 09:52:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:48,820 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 245 transitions. [2022-07-21 09:52:48,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-21 09:52:48,820 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 245 transitions. [2022-07-21 09:52:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-21 09:52:48,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:48,822 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2022-07-21 09:52:48,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-21 09:52:49,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-21 09:52:49,040 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:49,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:49,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2087155491, now seen corresponding path program 1 times [2022-07-21 09:52:49,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:49,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194266926] [2022-07-21 09:52:49,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:49,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:52:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:52:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:52:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:52:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:52:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:52:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:52:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 09:52:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 09:52:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 09:52:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-21 09:52:49,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:49,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194266926] [2022-07-21 09:52:49,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194266926] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:49,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884114115] [2022-07-21 09:52:49,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:49,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:49,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:49,480 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:52:49,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-21 09:52:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:49,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 2662 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 09:52:49,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-21 09:52:50,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:52:50,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884114115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:50,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:52:50,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 25 [2022-07-21 09:52:50,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588708953] [2022-07-21 09:52:50,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:50,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 09:52:50,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:50,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 09:52:50,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2022-07-21 09:52:50,086 INFO L87 Difference]: Start difference. First operand 195 states and 245 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-21 09:52:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:50,214 INFO L93 Difference]: Finished difference Result 275 states and 330 transitions. [2022-07-21 09:52:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 09:52:50,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 109 [2022-07-21 09:52:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:50,216 INFO L225 Difference]: With dead ends: 275 [2022-07-21 09:52:50,216 INFO L226 Difference]: Without dead ends: 185 [2022-07-21 09:52:50,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-07-21 09:52:50,217 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 33 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:50,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1246 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:52:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-21 09:52:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-07-21 09:52:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 129 states have (on average 1.1085271317829457) internal successors, (143), 133 states have internal predecessors, (143), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43) [2022-07-21 09:52:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 226 transitions. [2022-07-21 09:52:50,231 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 226 transitions. Word has length 109 [2022-07-21 09:52:50,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:50,231 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 226 transitions. [2022-07-21 09:52:50,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-21 09:52:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 226 transitions. [2022-07-21 09:52:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-21 09:52:50,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:50,233 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2022-07-21 09:52:50,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-21 09:52:50,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:50,449 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:50,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:50,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1526938213, now seen corresponding path program 1 times [2022-07-21 09:52:50,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:50,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268898165] [2022-07-21 09:52:50,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:50,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:52:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:52:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:52:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:52:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:52:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:52:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:52:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:52:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 09:52:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 09:52:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 09:52:50,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:50,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268898165] [2022-07-21 09:52:50,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268898165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:50,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:50,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:52:50,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158601828] [2022-07-21 09:52:50,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:50,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:52:50,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:50,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:52:50,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:52:50,656 INFO L87 Difference]: Start difference. First operand 185 states and 226 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 09:52:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:50,883 INFO L93 Difference]: Finished difference Result 223 states and 268 transitions. [2022-07-21 09:52:50,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:52:50,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2022-07-21 09:52:50,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:50,885 INFO L225 Difference]: With dead ends: 223 [2022-07-21 09:52:50,885 INFO L226 Difference]: Without dead ends: 166 [2022-07-21 09:52:50,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:52:50,886 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 93 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:50,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 310 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:52:50,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-21 09:52:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-07-21 09:52:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 119 states have internal predecessors, (127), 34 states have call successors, (34), 14 states have call predecessors, (34), 15 states have return successors, (37), 32 states have call predecessors, (37), 33 states have call successors, (37) [2022-07-21 09:52:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 198 transitions. [2022-07-21 09:52:50,899 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 198 transitions. Word has length 109 [2022-07-21 09:52:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:50,899 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 198 transitions. [2022-07-21 09:52:50,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 09:52:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 198 transitions. [2022-07-21 09:52:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-21 09:52:50,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:50,901 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:50,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-21 09:52:50,901 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:50,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:50,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2132558451, now seen corresponding path program 1 times [2022-07-21 09:52:50,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:50,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875594454] [2022-07-21 09:52:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:52:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:52:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:52:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:52:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:52:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:52:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:52:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:52:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 09:52:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 09:52:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 09:52:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:52:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 09:52:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-21 09:52:51,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:51,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875594454] [2022-07-21 09:52:51,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875594454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:52:51,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:52:51,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:52:51,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839120860] [2022-07-21 09:52:51,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:52:51,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:52:51,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:51,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:52:51,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:52:51,184 INFO L87 Difference]: Start difference. First operand 166 states and 198 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 09:52:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:51,483 INFO L93 Difference]: Finished difference Result 207 states and 243 transitions. [2022-07-21 09:52:51,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:52:51,483 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 134 [2022-07-21 09:52:51,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:51,484 INFO L225 Difference]: With dead ends: 207 [2022-07-21 09:52:51,485 INFO L226 Difference]: Without dead ends: 166 [2022-07-21 09:52:51,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:52:51,485 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 95 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:51,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 431 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 09:52:51,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-21 09:52:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-07-21 09:52:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 116 states have (on average 1.0862068965517242) internal successors, (126), 119 states have internal predecessors, (126), 34 states have call successors, (34), 14 states have call predecessors, (34), 15 states have return successors, (37), 32 states have call predecessors, (37), 33 states have call successors, (37) [2022-07-21 09:52:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 197 transitions. [2022-07-21 09:52:51,498 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 197 transitions. Word has length 134 [2022-07-21 09:52:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:51,498 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 197 transitions. [2022-07-21 09:52:51,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 09:52:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 197 transitions. [2022-07-21 09:52:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-21 09:52:51,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:52:51,500 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:52:51,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 09:52:51,500 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:52:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:52:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash 284756267, now seen corresponding path program 1 times [2022-07-21 09:52:51,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:52:51,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682965085] [2022-07-21 09:52:51,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:51,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:52:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:52:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:52:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:52:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:52:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:52:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:52:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:52:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:52:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:52:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:52:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:52:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 09:52:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 09:52:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 09:52:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:52:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:52:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 09:52:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-21 09:52:51,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:52:51,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682965085] [2022-07-21 09:52:51,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682965085] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:51,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590201885] [2022-07-21 09:52:51,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:52:51,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:52:51,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:52:51,909 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:52:51,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-21 09:52:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:52:52,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 2752 conjuncts, 101 conjunts are in the unsatisfiable core [2022-07-21 09:52:52,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:52:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-21 09:52:55,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:52:58,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590201885] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:52:58,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:52:58,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 34] total 44 [2022-07-21 09:52:58,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684188493] [2022-07-21 09:52:58,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:52:58,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-21 09:52:58,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:52:58,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-21 09:52:58,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2992, Unknown=0, NotChecked=0, Total=3192 [2022-07-21 09:52:58,892 INFO L87 Difference]: Start difference. First operand 166 states and 197 transitions. Second operand has 44 states, 38 states have (on average 3.236842105263158) internal successors, (123), 33 states have internal predecessors, (123), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) [2022-07-21 09:52:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:52:59,712 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2022-07-21 09:52:59,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 09:52:59,713 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 38 states have (on average 3.236842105263158) internal successors, (123), 33 states have internal predecessors, (123), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) Word has length 135 [2022-07-21 09:52:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:52:59,713 INFO L225 Difference]: With dead ends: 181 [2022-07-21 09:52:59,713 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 09:52:59,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 143 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=287, Invalid=4405, Unknown=0, NotChecked=0, Total=4692 [2022-07-21 09:52:59,715 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:52:59,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 388 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 560 Invalid, 0 Unknown, 54 Unchecked, 0.4s Time] [2022-07-21 09:52:59,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 09:52:59,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 09:52:59,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:52:59,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 09:52:59,716 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2022-07-21 09:52:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:52:59,716 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 09:52:59,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 38 states have (on average 3.236842105263158) internal successors, (123), 33 states have internal predecessors, (123), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) [2022-07-21 09:52:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 09:52:59,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 09:52:59,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 09:52:59,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-21 09:52:59,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-21 09:52:59,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 09:53:01,902 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 0))) [2022-07-21 09:53:01,902 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-07-21 09:53:01,902 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) [2022-07-21 09:53:01,902 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-07-21 09:53:01,902 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (or .cse0 (<= (+ (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (let ((.cse1 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (<= (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ 18446744073709551615 .cse1 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616))) (+ .cse1 15)))) (= |old(#valid)| |#valid|)))) [2022-07-21 09:53:01,902 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-07-21 09:53:01,902 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) [2022-07-21 09:53:01,902 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-07-21 09:53:01,902 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-07-21 09:53:01,902 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (not (< 0 |#StackHeapBarrier|))) [2022-07-21 09:53:01,903 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-07-21 09:53:01,903 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-07-21 09:53:01,903 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-07-21 09:53:01,903 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-21 09:53:01,903 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-07-21 09:53:01,903 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-21 09:53:01,903 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-21 09:53:01,903 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-21 09:53:01,903 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-21 09:53:01,903 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-21 09:53:01,903 INFO L902 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2022-07-21 09:53:01,903 INFO L899 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2022-07-21 09:53:01,903 INFO L899 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2022-07-21 09:53:01,903 INFO L902 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2022-07-21 09:53:01,903 INFO L899 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2022-07-21 09:53:01,903 INFO L899 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2022-07-21 09:53:01,903 INFO L902 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2022-07-21 09:53:01,903 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-21 09:53:01,903 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-21 09:53:01,904 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-21 09:53:01,904 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-21 09:53:01,904 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-21 09:53:01,904 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-21 09:53:01,904 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-21 09:53:01,904 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-07-21 09:53:01,904 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-07-21 09:53:01,904 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-07-21 09:53:01,904 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-07-21 09:53:01,904 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-07-21 09:53:01,905 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-21 09:53:01,905 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-07-21 09:53:01,905 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-07-21 09:53:01,905 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-07-21 09:53:01,905 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-07-21 09:53:01,905 INFO L902 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7368 7372) the Hoare annotation is: true [2022-07-21 09:53:01,905 INFO L899 garLoopResultBuilder]: For program point L7371(line 7371) no Hoare annotation was computed. [2022-07-21 09:53:01,905 INFO L899 garLoopResultBuilder]: For program point L7371-5(line 7371) no Hoare annotation was computed. [2022-07-21 09:53:01,906 INFO L899 garLoopResultBuilder]: For program point L7371-4(line 7371) no Hoare annotation was computed. [2022-07-21 09:53:01,906 INFO L899 garLoopResultBuilder]: For program point L7371-2(line 7371) no Hoare annotation was computed. [2022-07-21 09:53:01,906 INFO L899 garLoopResultBuilder]: For program point L7371-8(line 7371) no Hoare annotation was computed. [2022-07-21 09:53:01,906 INFO L899 garLoopResultBuilder]: For program point L7371-6(line 7371) no Hoare annotation was computed. [2022-07-21 09:53:01,906 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7368 7372) no Hoare annotation was computed. [2022-07-21 09:53:01,906 INFO L899 garLoopResultBuilder]: For program point L7371-11(line 7371) no Hoare annotation was computed. [2022-07-21 09:53:01,906 INFO L899 garLoopResultBuilder]: For program point L7371-10(line 7371) no Hoare annotation was computed. [2022-07-21 09:53:01,906 INFO L899 garLoopResultBuilder]: For program point L7370(lines 7370 7371) no Hoare annotation was computed. [2022-07-21 09:53:01,906 INFO L899 garLoopResultBuilder]: For program point L7370-2(lines 7370 7371) no Hoare annotation was computed. [2022-07-21 09:53:01,906 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7368 7372) no Hoare annotation was computed. [2022-07-21 09:53:01,906 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-21 09:53:01,906 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-21 09:53:01,906 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-21 09:53:01,907 INFO L899 garLoopResultBuilder]: For program point L6675-1(line 6675) no Hoare annotation was computed. [2022-07-21 09:53:01,907 INFO L895 garLoopResultBuilder]: At program point L6675(line 6675) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (< 0 |#StackHeapBarrier|)) [2022-07-21 09:53:01,907 INFO L899 garLoopResultBuilder]: For program point L9549(lines 9549 9550) no Hoare annotation was computed. [2022-07-21 09:53:01,907 INFO L899 garLoopResultBuilder]: For program point L9549-2(lines 9549 9550) no Hoare annotation was computed. [2022-07-21 09:53:01,907 INFO L899 garLoopResultBuilder]: For program point L9549-3(lines 9549 9559) no Hoare annotation was computed. [2022-07-21 09:53:01,907 INFO L895 garLoopResultBuilder]: At program point L9549-4(lines 9549 9559) the Hoare annotation is: (let ((.cse1 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse2 (< 0 |#StackHeapBarrier|))) (or (and (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse1 .cse2))) [2022-07-21 09:53:01,907 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 09:53:01,907 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 09:53:01,907 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-07-21 09:53:01,907 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-21 09:53:01,907 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-21 09:53:01,907 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-07-21 09:53:01,907 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-21 09:53:01,907 INFO L895 garLoopResultBuilder]: At program point L9560(line 9560) the Hoare annotation is: (and (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1360#1| 1) (<= 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1360#1|) (< 0 |#StackHeapBarrier|)) [2022-07-21 09:53:01,908 INFO L899 garLoopResultBuilder]: For program point L9560-1(line 9560) no Hoare annotation was computed. [2022-07-21 09:53:01,908 INFO L895 garLoopResultBuilder]: At program point L9329-4(line 9329) the Hoare annotation is: (let ((.cse18 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.offset| 0)) (.cse15 (not .cse7)) (.cse16 (not .cse9)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base| 0)) (.cse12 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse13 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse17 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse2 (<= .cse18 (* (div .cse18 18446744073709551616) 18446744073709551616))) (.cse10 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset| 0)) (.cse11 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse19 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base|)) (.cse20 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse14 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse5 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse8 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1291#1| .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse11 .cse12 .cse13 .cse14 .cse5 .cse8) (and .cse0 .cse17 .cse1 (<= 0 (+ (* (div (* (- 1) .cse18) 18446744073709551616) 18446744073709551616) .cse18)) .cse15 .cse16 .cse3 .cse4 .cse11 .cse14 .cse5 .cse8) (and .cse9 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1291#1| .cse10 .cse11 .cse19 .cse20 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse17 .cse2 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1291#1| .cse10 .cse11 .cse19 .cse20 .cse14 .cse5 .cse6 .cse7 .cse8)))) [2022-07-21 09:53:01,908 INFO L899 garLoopResultBuilder]: For program point L9329-5(line 9329) no Hoare annotation was computed. [2022-07-21 09:53:01,908 INFO L899 garLoopResultBuilder]: For program point L9329(line 9329) no Hoare annotation was computed. [2022-07-21 09:53:01,908 INFO L895 garLoopResultBuilder]: At program point L9552(line 9552) the Hoare annotation is: false [2022-07-21 09:53:01,908 INFO L895 garLoopResultBuilder]: At program point L9329-2(line 9329) the Hoare annotation is: (let ((.cse13 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (let ((.cse4 (not .cse13))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.offset| 0)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base| 0)) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse8 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse9 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse10 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse11 (let ((.cse14 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset| 0))) (or (and .cse13 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1291#1| .cse14) (and (not |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1291#1|) (or .cse4 (not .cse14)))))) (.cse12 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 (<= 0 (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616) .cse2))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse9 .cse10 .cse11 .cse12))))) [2022-07-21 09:53:01,909 INFO L895 garLoopResultBuilder]: At program point L9552-1(line 9552) the Hoare annotation is: false [2022-07-21 09:53:01,909 INFO L899 garLoopResultBuilder]: For program point L9329-3(line 9329) no Hoare annotation was computed. [2022-07-21 09:53:01,909 INFO L899 garLoopResultBuilder]: For program point L9552-2(line 9552) no Hoare annotation was computed. [2022-07-21 09:53:01,909 INFO L895 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse2 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse5 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 8)) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse1 .cse2 .cse3 .cse4 .cse5))) [2022-07-21 09:53:01,909 INFO L895 garLoopResultBuilder]: At program point L9544-1(line 9544) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse2 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse3 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse6 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1350#1| 0) (<= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1350#1|) .cse3 .cse6))) [2022-07-21 09:53:01,909 INFO L899 garLoopResultBuilder]: For program point L9544-2(line 9544) no Hoare annotation was computed. [2022-07-21 09:53:01,909 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-21 09:53:01,910 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-07-21 09:53:01,910 INFO L899 garLoopResultBuilder]: For program point L9330(line 9330) no Hoare annotation was computed. [2022-07-21 09:53:01,910 INFO L899 garLoopResultBuilder]: For program point L9330-5(line 9330) no Hoare annotation was computed. [2022-07-21 09:53:01,910 INFO L899 garLoopResultBuilder]: For program point L9553(lines 9553 9558) no Hoare annotation was computed. [2022-07-21 09:53:01,910 INFO L895 garLoopResultBuilder]: At program point L9330-2(line 9330) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)) (.cse1 (< 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse5 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base|)) (.cse6 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse8 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse10 (< 0 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse11 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse12 (< 0 |#StackHeapBarrier|))) (or (and .cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) .cse1 (<= 0 (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616) .cse2))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-07-21 09:53:01,910 INFO L899 garLoopResultBuilder]: For program point L9330-3(line 9330) no Hoare annotation was computed. [2022-07-21 09:53:01,910 INFO L895 garLoopResultBuilder]: At program point L9330-4(line 9330) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)) (.cse10 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse20 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (let ((.cse5 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset| 0)) (.cse3 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base|)) (.cse4 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse12 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse19 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.offset| 0)) (.cse18 (<= .cse20 (* (div .cse20 18446744073709551616) 18446744073709551616))) (.cse16 (not .cse10)) (.cse17 (not .cse0)) (.cse14 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse15 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse8 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse11 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse13 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1293#1| .cse1 .cse14 .cse15 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse13 .cse16 .cse17 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1293#1| .cse14 .cse15 .cse2 .cse5 .cse6 .cse7 .cse8 .cse11) (and .cse12 .cse13 .cse18 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1293#1| .cse14 .cse15 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse19 (<= 0 (+ (* (div (* (- 1) .cse20) 18446744073709551616) 18446744073709551616) .cse20)) .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse19 .cse13 .cse18 .cse16 .cse17 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1293#1| .cse14 .cse15 .cse2 .cse7 .cse8 .cse11)))) [2022-07-21 09:53:01,910 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 09:53:01,910 INFO L902 garLoopResultBuilder]: At program point L9562(line 9562) the Hoare annotation is: true [2022-07-21 09:53:01,910 INFO L899 garLoopResultBuilder]: For program point L9537(lines 9537 9561) no Hoare annotation was computed. [2022-07-21 09:53:01,910 INFO L899 garLoopResultBuilder]: For program point L9331(lines 9331 9339) no Hoare annotation was computed. [2022-07-21 09:53:01,910 INFO L895 garLoopResultBuilder]: At program point L9554(line 9554) the Hoare annotation is: false [2022-07-21 09:53:01,910 INFO L899 garLoopResultBuilder]: For program point L6672(lines 6672 6676) no Hoare annotation was computed. [2022-07-21 09:53:01,910 INFO L899 garLoopResultBuilder]: For program point L9554-1(line 9554) no Hoare annotation was computed. [2022-07-21 09:53:01,910 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-07-21 09:53:01,910 INFO L895 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2022-07-21 09:53:01,910 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-21 09:53:01,910 INFO L899 garLoopResultBuilder]: For program point L9538-5(lines 9538 9539) no Hoare annotation was computed. [2022-07-21 09:53:01,911 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 09:53:01,911 INFO L899 garLoopResultBuilder]: For program point L9340(lines 9340 9348) no Hoare annotation was computed. [2022-07-21 09:53:01,911 INFO L899 garLoopResultBuilder]: For program point L9538-1(lines 9538 9539) no Hoare annotation was computed. [2022-07-21 09:53:01,911 INFO L895 garLoopResultBuilder]: At program point L9538-2(line 9538) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2022-07-21 09:53:01,911 INFO L899 garLoopResultBuilder]: For program point L9538-3(line 9538) no Hoare annotation was computed. [2022-07-21 09:53:01,911 INFO L899 garLoopResultBuilder]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2022-07-21 09:53:01,911 INFO L899 garLoopResultBuilder]: For program point L6673-3(lines 6673 6675) no Hoare annotation was computed. [2022-07-21 09:53:01,911 INFO L899 garLoopResultBuilder]: For program point L6673-1(lines 6673 6675) no Hoare annotation was computed. [2022-07-21 09:53:01,911 INFO L895 garLoopResultBuilder]: At program point L6673(line 6673) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (< 0 |#StackHeapBarrier|)) [2022-07-21 09:53:01,911 INFO L895 garLoopResultBuilder]: At program point L9349(line 9349) the Hoare annotation is: false [2022-07-21 09:53:01,911 INFO L899 garLoopResultBuilder]: For program point L9349-1(line 9349) no Hoare annotation was computed. [2022-07-21 09:53:01,911 INFO L895 garLoopResultBuilder]: At program point L9349-2(lines 9327 9350) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse5 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse6 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse7 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_#res#1| 0) (not .cse0) (not .cse1) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse2 (<= 0 (+ (* (div (* (- 1) .cse8) 18446744073709551616) 18446744073709551616) .cse8)) .cse3 .cse5 .cse6 .cse7))) (and (<= .cse8 (* (div .cse8 18446744073709551616) 18446744073709551616)) .cse6 .cse9 .cse0 .cse7) (and .cse1 .cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset| 0) .cse3 .cse4 .cse5 .cse6 .cse9 .cse0 .cse7))) [2022-07-21 09:53:01,911 INFO L895 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse2 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse3 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse6 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-07-21 09:53:01,911 INFO L899 garLoopResultBuilder]: For program point L9548-1(line 9548) no Hoare annotation was computed. [2022-07-21 09:53:01,911 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-21 09:53:01,911 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-21 09:53:01,911 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-21 09:53:01,911 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-21 09:53:01,911 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-21 09:53:01,912 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-21 09:53:01,914 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:53:01,915 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 09:53:01,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:53:01,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:53:01,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:53:01,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:53:01,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 09:53:01 BoogieIcfgContainer [2022-07-21 09:53:01,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 09:53:01,932 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 09:53:01,932 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 09:53:01,932 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 09:53:01,932 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:52:23" (3/4) ... [2022-07-21 09:53:01,935 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 09:53:01,940 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-07-21 09:53:01,940 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-21 09:53:01,940 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2022-07-21 09:53:01,940 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2022-07-21 09:53:01,940 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-21 09:53:01,940 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-21 09:53:01,940 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-21 09:53:01,940 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-21 09:53:01,940 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-21 09:53:01,940 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-21 09:53:01,955 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 127 nodes and edges [2022-07-21 09:53:01,957 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2022-07-21 09:53:01,958 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-07-21 09:53:01,959 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-21 09:53:01,960 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-21 09:53:01,961 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-21 09:53:01,962 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 09:53:01,963 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 09:53:01,991 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 0 && !(str == 0)) && !(str == 0)) && ((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) || (((((cursor == 0 && 0 <= -1 * unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown))) || ((((unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown)) || (((((((((str == 0 && cursor == 0) && str == 0) && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown) [2022-07-21 09:53:01,992 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0 < unknown-#StackHeapBarrier-unknown) || ((((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && str == 0) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0) [2022-07-21 09:53:02,316 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 09:53:02,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 09:53:02,317 INFO L158 Benchmark]: Toolchain (without parser) took 43238.77ms. Allocated memory was 56.6MB in the beginning and 545.3MB in the end (delta: 488.6MB). Free memory was 35.4MB in the beginning and 335.9MB in the end (delta: -300.5MB). Peak memory consumption was 188.8MB. Max. memory is 16.1GB. [2022-07-21 09:53:02,317 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.2MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 09:53:02,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2363.36ms. Allocated memory was 56.6MB in the beginning and 117.4MB in the end (delta: 60.8MB). Free memory was 35.3MB in the beginning and 55.4MB in the end (delta: -20.1MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2022-07-21 09:53:02,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 232.77ms. Allocated memory is still 117.4MB. Free memory was 55.4MB in the beginning and 65.8MB in the end (delta: -10.4MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2022-07-21 09:53:02,318 INFO L158 Benchmark]: Boogie Preprocessor took 69.20ms. Allocated memory is still 117.4MB. Free memory was 65.8MB in the beginning and 58.8MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-21 09:53:02,318 INFO L158 Benchmark]: RCFGBuilder took 1522.30ms. Allocated memory was 117.4MB in the beginning and 144.7MB in the end (delta: 27.3MB). Free memory was 58.8MB in the beginning and 88.8MB in the end (delta: -29.9MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2022-07-21 09:53:02,318 INFO L158 Benchmark]: TraceAbstraction took 38660.80ms. Allocated memory was 144.7MB in the beginning and 545.3MB in the end (delta: 400.6MB). Free memory was 87.7MB in the beginning and 468.0MB in the end (delta: -380.3MB). Peak memory consumption was 314.9MB. Max. memory is 16.1GB. [2022-07-21 09:53:02,319 INFO L158 Benchmark]: Witness Printer took 384.86ms. Allocated memory is still 545.3MB. Free memory was 468.0MB in the beginning and 335.9MB in the end (delta: 132.1MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2022-07-21 09:53:02,320 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.2MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2363.36ms. Allocated memory was 56.6MB in the beginning and 117.4MB in the end (delta: 60.8MB). Free memory was 35.3MB in the beginning and 55.4MB in the end (delta: -20.1MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 232.77ms. Allocated memory is still 117.4MB. Free memory was 55.4MB in the beginning and 65.8MB in the end (delta: -10.4MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.20ms. Allocated memory is still 117.4MB. Free memory was 65.8MB in the beginning and 58.8MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1522.30ms. Allocated memory was 117.4MB in the beginning and 144.7MB in the end (delta: 27.3MB). Free memory was 58.8MB in the beginning and 88.8MB in the end (delta: -29.9MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * TraceAbstraction took 38660.80ms. Allocated memory was 144.7MB in the beginning and 545.3MB in the end (delta: 400.6MB). Free memory was 87.7MB in the beginning and 468.0MB in the end (delta: -380.3MB). Peak memory consumption was 314.9MB. Max. memory is 16.1GB. * Witness Printer took 384.86ms. Allocated memory is still 545.3MB. Free memory was 468.0MB in the beginning and 335.9MB in the end (delta: 132.1MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.6s, OverallIterations: 26, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2480 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2334 mSDsluCounter, 19801 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 375 IncrementalHoareTripleChecker+Unchecked, 15916 mSDsCounter, 743 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5157 IncrementalHoareTripleChecker+Invalid, 6275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 743 mSolverCounterUnsat, 3885 mSDtfsCounter, 5157 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2575 GetRequests, 2142 SyntacticMatches, 34 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1904 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=7, InterpolantAutomatonStates: 231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 351 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 502 PreInvPairs, 554 NumberOfFragments, 1562 HoareAnnotationTreeSize, 502 FomulaSimplifications, 717 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 42 FomulaSimplificationsInter, 19117 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 3459 NumberOfCodeBlocks, 3459 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3868 ConstructedInterpolants, 106 QuantifiedInterpolants, 16543 SizeOfPredicates, 117 NumberOfNonLiveVariables, 38463 ConjunctsInSsa, 315 ConjunctsInUnsatCore, 47 InterpolantComputations, 21 PerfectInterpolantSequences, 1790/2063 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 9327]: Loop Invariant [2022-07-21 09:53:02,325 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:53:02,325 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:53:02,326 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:53:02,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((\result == 0 && !(str == 0)) && !(str == 0)) && ((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) || (((((cursor == 0 && 0 <= -1 * unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown))) || ((((unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown)) || (((((((((str == 0 && cursor == 0) && str == 0) && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 9562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: !(0 < unknown-#StackHeapBarrier-unknown) || ((((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && str == 0) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0) RESULT: Ultimate proved your program to be correct! [2022-07-21 09:53:02,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE