./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c6f394469998c48e6ef18c3b42ee2a3474a6570f40012cad15c840d16c47e9d4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:17:18,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:17:18,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:17:18,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:17:18,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:17:18,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:17:18,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:17:18,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:17:18,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:17:18,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:17:18,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:17:18,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:17:18,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:17:18,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:17:18,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:17:18,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:17:18,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:17:18,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:17:18,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:17:18,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:17:18,098 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:17:18,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:17:18,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:17:18,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:17:18,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:17:18,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:17:18,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:17:18,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:17:18,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:17:18,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:17:18,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:17:18,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:17:18,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:17:18,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:17:18,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:17:18,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:17:18,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:17:18,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:17:18,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:17:18,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:17:18,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:17:18,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:17:18,113 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:17:18,127 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:17:18,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:17:18,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:17:18,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:17:18,132 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:17:18,132 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:17:18,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:17:18,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:17:18,133 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:17:18,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:17:18,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:17:18,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:17:18,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:17:18,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:17:18,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:17:18,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:17:18,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:17:18,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:17:18,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:17:18,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:17:18,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:17:18,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:17:18,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:17:18,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:17:18,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:17:18,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:17:18,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:17:18,137 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:17:18,137 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:17:18,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:17:18,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6f394469998c48e6ef18c3b42ee2a3474a6570f40012cad15c840d16c47e9d4 [2022-07-12 11:17:18,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:17:18,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:17:18,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:17:18,336 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:17:18,337 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:17:18,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i [2022-07-12 11:17:18,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c60807d9a/3e3229c8a00f4189a8d41082d3e29ead/FLAG2f19a6bc9 [2022-07-12 11:17:18,993 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:17:18,994 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i [2022-07-12 11:17:19,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c60807d9a/3e3229c8a00f4189a8d41082d3e29ead/FLAG2f19a6bc9 [2022-07-12 11:17:19,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c60807d9a/3e3229c8a00f4189a8d41082d3e29ead [2022-07-12 11:17:19,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:17:19,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:17:19,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:17:19,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:17:19,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:17:19,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:17:19" (1/1) ... [2022-07-12 11:17:19,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e0bd47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:19, skipping insertion in model container [2022-07-12 11:17:19,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:17:19" (1/1) ... [2022-07-12 11:17:19,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:17:19,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:17:19,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i[4508,4521] [2022-07-12 11:17:19,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i[4568,4581] [2022-07-12 11:17:20,045 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,045 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,050 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,051 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,052 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,059 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,062 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,064 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,065 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,273 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:17:20,274 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:17:20,275 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:17:20,276 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:17:20,304 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:17:20,305 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:17:20,305 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:17:20,306 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:17:20,306 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:17:20,307 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:17:20,404 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:17:20,470 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,471 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:17:20,545 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:17:20,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i[4508,4521] [2022-07-12 11:17:20,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i[4568,4581] [2022-07-12 11:17:20,594 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,595 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,596 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,596 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,596 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,600 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,601 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,602 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,602 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,632 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:17:20,633 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:17:20,633 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:17:20,634 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:17:20,634 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:17:20,635 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:17:20,635 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:17:20,635 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:17:20,636 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:17:20,636 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:17:20,652 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:17:20,710 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,711 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:20,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:17:20,929 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:17:20,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:20 WrapperNode [2022-07-12 11:17:20,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:17:20,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:17:20,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:17:20,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:17:20,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:20" (1/1) ... [2022-07-12 11:17:21,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:20" (1/1) ... [2022-07-12 11:17:21,072 INFO L137 Inliner]: procedures = 693, calls = 2784, calls flagged for inlining = 60, calls inlined = 7, statements flattened = 853 [2022-07-12 11:17:21,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:17:21,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:17:21,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:17:21,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:17:21,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:20" (1/1) ... [2022-07-12 11:17:21,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:20" (1/1) ... [2022-07-12 11:17:21,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:20" (1/1) ... [2022-07-12 11:17:21,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:20" (1/1) ... [2022-07-12 11:17:21,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:20" (1/1) ... [2022-07-12 11:17:21,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:20" (1/1) ... [2022-07-12 11:17:21,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:20" (1/1) ... [2022-07-12 11:17:21,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:17:21,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:17:21,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:17:21,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:17:21,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:20" (1/1) ... [2022-07-12 11:17:21,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:17:21,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:21,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 11:17:21,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 11:17:21,212 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-12 11:17:21,212 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-12 11:17:21,212 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-12 11:17:21,212 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-12 11:17:21,212 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_ignore_case [2022-07-12 11:17:21,212 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_ignore_case [2022-07-12 11:17:21,212 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-12 11:17:21,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-12 11:17:21,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:17:21,213 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 11:17:21,213 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 11:17:21,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:17:21,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:17:21,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:17:21,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:17:21,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:17:21,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:17:21,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:17:21,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:17:21,214 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 11:17:21,214 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 11:17:21,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 11:17:21,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:17:21,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:17:21,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:17:21,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:17:21,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:17:21,215 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-12 11:17:21,215 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-12 11:17:21,215 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 11:17:21,215 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 11:17:21,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:17:21,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:17:21,437 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:17:21,448 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:17:22,269 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:17:22,274 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:17:22,274 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 11:17:22,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:17:22 BoogieIcfgContainer [2022-07-12 11:17:22,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:17:22,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:17:22,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:17:22,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:17:22,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:17:19" (1/3) ... [2022-07-12 11:17:22,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56aa79b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:17:22, skipping insertion in model container [2022-07-12 11:17:22,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:20" (2/3) ... [2022-07-12 11:17:22,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56aa79b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:17:22, skipping insertion in model container [2022-07-12 11:17:22,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:17:22" (3/3) ... [2022-07-12 11:17:22,282 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_buf_ignore_case_harness.i [2022-07-12 11:17:22,292 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:17:22,293 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:17:22,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:17:22,344 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@4504b3d2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b2e497 [2022-07-12 11:17:22,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:17:22,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 88 states have internal predecessors, (113), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-12 11:17:22,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-12 11:17:22,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:22,359 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:22,360 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:22,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash 624639396, now seen corresponding path program 1 times [2022-07-12 11:17:22,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:22,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177862306] [2022-07-12 11:17:22,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:22,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:22,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:22,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:22,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:22,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:22,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:22,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 11:17:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:22,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:17:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:22,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:17:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:22,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:17:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-12 11:17:22,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:22,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177862306] [2022-07-12 11:17:22,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177862306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:22,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:22,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:17:22,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602630906] [2022-07-12 11:17:22,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:22,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:17:22,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:22,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:17:22,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:17:22,818 INFO L87 Difference]: Start difference. First operand has 125 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 88 states have internal predecessors, (113), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:17:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:22,991 INFO L93 Difference]: Finished difference Result 238 states and 329 transitions. [2022-07-12 11:17:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:17:22,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 74 [2022-07-12 11:17:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:23,002 INFO L225 Difference]: With dead ends: 238 [2022-07-12 11:17:23,002 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 11:17:23,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:17:23,011 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 59 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:23,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 205 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:17:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 11:17:23,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-12 11:17:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 84 states have internal predecessors, (106), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-12 11:17:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 157 transitions. [2022-07-12 11:17:23,065 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 157 transitions. Word has length 74 [2022-07-12 11:17:23,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:23,067 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 157 transitions. [2022-07-12 11:17:23,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:17:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 157 transitions. [2022-07-12 11:17:23,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-12 11:17:23,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:23,078 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:23,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:17:23,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:23,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1603023894, now seen corresponding path program 1 times [2022-07-12 11:17:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:23,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694789061] [2022-07-12 11:17:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:23,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:23,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:23,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:23,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:23,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:23,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:23,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 11:17:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:23,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:17:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:23,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:17:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:23,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:17:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:17:23,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:23,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694789061] [2022-07-12 11:17:23,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694789061] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:17:23,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70168694] [2022-07-12 11:17:23,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:23,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:23,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:23,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:17:23,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 11:17:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:23,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 2545 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 11:17:23,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:17:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 11:17:23,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:17:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-12 11:17:23,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70168694] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 11:17:23,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:17:23,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2022-07-12 11:17:23,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585689034] [2022-07-12 11:17:23,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:23,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:17:23,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:23,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:17:23,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:17:23,945 INFO L87 Difference]: Start difference. First operand 120 states and 157 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-12 11:17:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:24,097 INFO L93 Difference]: Finished difference Result 185 states and 249 transitions. [2022-07-12 11:17:24,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:17:24,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 74 [2022-07-12 11:17:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:24,099 INFO L225 Difference]: With dead ends: 185 [2022-07-12 11:17:24,099 INFO L226 Difference]: Without dead ends: 145 [2022-07-12 11:17:24,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-07-12 11:17:24,100 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 218 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:24,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 529 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:17:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-12 11:17:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2022-07-12 11:17:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 92 states have internal predecessors, (116), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-07-12 11:17:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 175 transitions. [2022-07-12 11:17:24,111 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 175 transitions. Word has length 74 [2022-07-12 11:17:24,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:24,112 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 175 transitions. [2022-07-12 11:17:24,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-12 11:17:24,112 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 175 transitions. [2022-07-12 11:17:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-12 11:17:24,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:24,114 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:24,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:17:24,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:24,354 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:24,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:24,355 INFO L85 PathProgramCache]: Analyzing trace with hash -216820500, now seen corresponding path program 1 times [2022-07-12 11:17:24,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:24,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043342093] [2022-07-12 11:17:24,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:24,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:24,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:24,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:24,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:24,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:24,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:24,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 11:17:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:24,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:17:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:24,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:17:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:24,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:17:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:17:24,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:24,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043342093] [2022-07-12 11:17:24,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043342093] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:17:24,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922090122] [2022-07-12 11:17:24,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:24,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:24,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:24,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:17:24,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 11:17:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:24,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 2546 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 11:17:24,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:17:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 11:17:24,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:17:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:17:25,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922090122] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:17:25,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:17:25,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-07-12 11:17:25,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134912770] [2022-07-12 11:17:25,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:17:25,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 11:17:25,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:25,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 11:17:25,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:17:25,070 INFO L87 Difference]: Start difference. First operand 132 states and 175 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 11 states have internal predecessors, (73), 7 states have call successors, (25), 4 states have call predecessors, (25), 5 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2022-07-12 11:17:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:25,445 INFO L93 Difference]: Finished difference Result 219 states and 297 transitions. [2022-07-12 11:17:25,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:17:25,445 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 11 states have internal predecessors, (73), 7 states have call successors, (25), 4 states have call predecessors, (25), 5 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) Word has length 74 [2022-07-12 11:17:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:25,448 INFO L225 Difference]: With dead ends: 219 [2022-07-12 11:17:25,448 INFO L226 Difference]: Without dead ends: 135 [2022-07-12 11:17:25,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:17:25,449 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 320 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:25,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 521 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:17:25,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-12 11:17:25,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-07-12 11:17:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 95 states have internal predecessors, (118), 30 states have call successors, (30), 10 states have call predecessors, (30), 11 states have return successors, (31), 29 states have call predecessors, (31), 29 states have call successors, (31) [2022-07-12 11:17:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 179 transitions. [2022-07-12 11:17:25,460 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 179 transitions. Word has length 74 [2022-07-12 11:17:25,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:25,461 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 179 transitions. [2022-07-12 11:17:25,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 11 states have internal predecessors, (73), 7 states have call successors, (25), 4 states have call predecessors, (25), 5 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2022-07-12 11:17:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 179 transitions. [2022-07-12 11:17:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 11:17:25,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:25,463 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:25,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 11:17:25,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-12 11:17:25,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:25,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:25,684 INFO L85 PathProgramCache]: Analyzing trace with hash 287122273, now seen corresponding path program 1 times [2022-07-12 11:17:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:25,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562384249] [2022-07-12 11:17:25,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:25,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:25,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:25,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:25,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:25,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:25,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:25,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:25,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:17:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:25,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:17:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:25,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:17:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:25,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:17:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 11:17:25,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:25,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562384249] [2022-07-12 11:17:25,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562384249] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:25,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:25,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:17:25,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140582896] [2022-07-12 11:17:25,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:25,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:17:25,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:25,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:17:25,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:17:25,864 INFO L87 Difference]: Start difference. First operand 135 states and 179 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:17:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:26,054 INFO L93 Difference]: Finished difference Result 244 states and 334 transitions. [2022-07-12 11:17:26,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:17:26,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2022-07-12 11:17:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:26,056 INFO L225 Difference]: With dead ends: 244 [2022-07-12 11:17:26,056 INFO L226 Difference]: Without dead ends: 157 [2022-07-12 11:17:26,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:17:26,057 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 116 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:26,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 349 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:17:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-12 11:17:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 137. [2022-07-12 11:17:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 95 states have (on average 1.263157894736842) internal successors, (120), 97 states have internal predecessors, (120), 30 states have call successors, (30), 10 states have call predecessors, (30), 11 states have return successors, (31), 29 states have call predecessors, (31), 29 states have call successors, (31) [2022-07-12 11:17:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 181 transitions. [2022-07-12 11:17:26,067 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 181 transitions. Word has length 82 [2022-07-12 11:17:26,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:26,067 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 181 transitions. [2022-07-12 11:17:26,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:17:26,067 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2022-07-12 11:17:26,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 11:17:26,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:26,069 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:26,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:17:26,070 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:26,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:26,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1762265569, now seen corresponding path program 1 times [2022-07-12 11:17:26,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:26,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342164564] [2022-07-12 11:17:26,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:26,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:17:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:17:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:17:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:17:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 11:17:26,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:26,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342164564] [2022-07-12 11:17:26,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342164564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:26,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:26,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:17:26,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233743165] [2022-07-12 11:17:26,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:26,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:17:26,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:26,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:17:26,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:17:26,250 INFO L87 Difference]: Start difference. First operand 137 states and 181 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:17:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:26,428 INFO L93 Difference]: Finished difference Result 236 states and 321 transitions. [2022-07-12 11:17:26,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:17:26,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2022-07-12 11:17:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:26,430 INFO L225 Difference]: With dead ends: 236 [2022-07-12 11:17:26,430 INFO L226 Difference]: Without dead ends: 147 [2022-07-12 11:17:26,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:17:26,431 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 99 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:26,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 351 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:17:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-12 11:17:26,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 139. [2022-07-12 11:17:26,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 99 states have internal predecessors, (122), 30 states have call successors, (30), 10 states have call predecessors, (30), 11 states have return successors, (31), 29 states have call predecessors, (31), 29 states have call successors, (31) [2022-07-12 11:17:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 183 transitions. [2022-07-12 11:17:26,438 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 183 transitions. Word has length 82 [2022-07-12 11:17:26,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:26,438 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 183 transitions. [2022-07-12 11:17:26,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:17:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 183 transitions. [2022-07-12 11:17:26,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 11:17:26,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:26,440 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:26,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 11:17:26,440 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:26,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1641150429, now seen corresponding path program 1 times [2022-07-12 11:17:26,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:26,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140970475] [2022-07-12 11:17:26,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:26,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:17:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:17:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:17:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:17:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 11:17:26,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:26,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140970475] [2022-07-12 11:17:26,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140970475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:26,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:26,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:17:26,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902869595] [2022-07-12 11:17:26,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:26,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:17:26,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:26,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:17:26,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:17:26,668 INFO L87 Difference]: Start difference. First operand 139 states and 183 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 11:17:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:26,881 INFO L93 Difference]: Finished difference Result 231 states and 312 transitions. [2022-07-12 11:17:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:17:26,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 82 [2022-07-12 11:17:26,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:26,883 INFO L225 Difference]: With dead ends: 231 [2022-07-12 11:17:26,883 INFO L226 Difference]: Without dead ends: 186 [2022-07-12 11:17:26,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:17:26,884 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 71 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:26,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 347 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:17:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-12 11:17:26,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2022-07-12 11:17:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 127 states have (on average 1.2598425196850394) internal successors, (160), 129 states have internal predecessors, (160), 45 states have call successors, (45), 10 states have call predecessors, (45), 11 states have return successors, (48), 44 states have call predecessors, (48), 44 states have call successors, (48) [2022-07-12 11:17:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 253 transitions. [2022-07-12 11:17:26,895 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 253 transitions. Word has length 82 [2022-07-12 11:17:26,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:26,895 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 253 transitions. [2022-07-12 11:17:26,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 11:17:26,895 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 253 transitions. [2022-07-12 11:17:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-12 11:17:26,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:26,896 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:26,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 11:17:26,897 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:26,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash 687616524, now seen corresponding path program 1 times [2022-07-12 11:17:26,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:26,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756998507] [2022-07-12 11:17:26,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:26,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:17:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:17:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:17:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:17:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-12 11:17:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:27,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756998507] [2022-07-12 11:17:27,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756998507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:27,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:27,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:17:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987338271] [2022-07-12 11:17:27,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:27,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:17:27,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:27,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:17:27,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:17:27,120 INFO L87 Difference]: Start difference. First operand 184 states and 253 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 11:17:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:27,446 INFO L93 Difference]: Finished difference Result 195 states and 269 transitions. [2022-07-12 11:17:27,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:17:27,446 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 86 [2022-07-12 11:17:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:27,448 INFO L225 Difference]: With dead ends: 195 [2022-07-12 11:17:27,448 INFO L226 Difference]: Without dead ends: 188 [2022-07-12 11:17:27,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:17:27,449 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 84 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:27,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 649 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:17:27,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-12 11:17:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-07-12 11:17:27,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 133 states have internal predecessors, (163), 45 states have call successors, (45), 10 states have call predecessors, (45), 12 states have return successors, (54), 44 states have call predecessors, (54), 44 states have call successors, (54) [2022-07-12 11:17:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 262 transitions. [2022-07-12 11:17:27,459 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 262 transitions. Word has length 86 [2022-07-12 11:17:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:27,460 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 262 transitions. [2022-07-12 11:17:27,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 11:17:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 262 transitions. [2022-07-12 11:17:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-12 11:17:27,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:27,461 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:27,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 11:17:27,461 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:27,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:27,462 INFO L85 PathProgramCache]: Analyzing trace with hash -116353960, now seen corresponding path program 1 times [2022-07-12 11:17:27,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:27,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260102909] [2022-07-12 11:17:27,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:27,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:17:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:17:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:17:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:17:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-12 11:17:27,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:27,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260102909] [2022-07-12 11:17:27,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260102909] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:17:27,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884785563] [2022-07-12 11:17:27,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:27,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:27,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:27,812 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:17:27,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 11:17:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:28,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 2584 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 11:17:28,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:17:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 11:17:28,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:17:29,394 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 11:17:29,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 1 [2022-07-12 11:17:29,534 INFO L356 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2022-07-12 11:17:29,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 36 [2022-07-12 11:17:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:17:29,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884785563] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:17:29,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:17:29,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 13] total 33 [2022-07-12 11:17:29,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432613279] [2022-07-12 11:17:29,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:17:29,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 11:17:29,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:29,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 11:17:29,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 11:17:29,587 INFO L87 Difference]: Start difference. First operand 188 states and 262 transitions. Second operand has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 32 states have internal predecessors, (125), 6 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2022-07-12 11:17:32,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:32,970 INFO L93 Difference]: Finished difference Result 540 states and 843 transitions. [2022-07-12 11:17:32,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-12 11:17:32,971 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 32 states have internal predecessors, (125), 6 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) Word has length 90 [2022-07-12 11:17:32,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:32,973 INFO L225 Difference]: With dead ends: 540 [2022-07-12 11:17:32,973 INFO L226 Difference]: Without dead ends: 402 [2022-07-12 11:17:32,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 171 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=822, Invalid=3734, Unknown=0, NotChecked=0, Total=4556 [2022-07-12 11:17:32,975 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 697 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 3015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 910 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:32,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1115 Invalid, 3015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1984 Invalid, 0 Unknown, 910 Unchecked, 1.5s Time] [2022-07-12 11:17:32,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-07-12 11:17:32,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 386. [2022-07-12 11:17:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 275 states have (on average 1.2763636363636364) internal successors, (351), 278 states have internal predecessors, (351), 93 states have call successors, (93), 13 states have call predecessors, (93), 17 states have return successors, (167), 94 states have call predecessors, (167), 92 states have call successors, (167) [2022-07-12 11:17:33,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 611 transitions. [2022-07-12 11:17:33,000 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 611 transitions. Word has length 90 [2022-07-12 11:17:33,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:33,000 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 611 transitions. [2022-07-12 11:17:33,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 32 states have internal predecessors, (125), 6 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2022-07-12 11:17:33,001 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 611 transitions. [2022-07-12 11:17:33,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-12 11:17:33,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:33,003 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:33,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 11:17:33,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:33,222 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:33,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:33,223 INFO L85 PathProgramCache]: Analyzing trace with hash 141811478, now seen corresponding path program 1 times [2022-07-12 11:17:33,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:33,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67994135] [2022-07-12 11:17:33,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:33,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:33,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:33,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:33,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:33,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:33,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:33,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:33,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:17:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:33,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:17:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:33,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:17:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:33,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:17:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 11:17:33,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:33,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67994135] [2022-07-12 11:17:33,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67994135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:33,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:33,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:17:33,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785160668] [2022-07-12 11:17:33,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:33,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:17:33,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:33,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:17:33,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:17:33,474 INFO L87 Difference]: Start difference. First operand 386 states and 611 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 11:17:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:33,737 INFO L93 Difference]: Finished difference Result 631 states and 983 transitions. [2022-07-12 11:17:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:17:33,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 90 [2022-07-12 11:17:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:33,741 INFO L225 Difference]: With dead ends: 631 [2022-07-12 11:17:33,741 INFO L226 Difference]: Without dead ends: 382 [2022-07-12 11:17:33,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:17:33,743 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 84 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:33,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 413 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:17:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-07-12 11:17:33,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2022-07-12 11:17:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 271 states have (on average 1.2656826568265682) internal successors, (343), 274 states have internal predecessors, (343), 93 states have call successors, (93), 13 states have call predecessors, (93), 17 states have return successors, (166), 94 states have call predecessors, (166), 92 states have call successors, (166) [2022-07-12 11:17:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 602 transitions. [2022-07-12 11:17:33,793 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 602 transitions. Word has length 90 [2022-07-12 11:17:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:33,807 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 602 transitions. [2022-07-12 11:17:33,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 11:17:33,808 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 602 transitions. [2022-07-12 11:17:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-12 11:17:33,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:33,812 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:33,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 11:17:33,813 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:33,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1284944238, now seen corresponding path program 1 times [2022-07-12 11:17:33,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:33,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195085415] [2022-07-12 11:17:33,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:33,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:34,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:34,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:34,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:34,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:34,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:34,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:34,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:17:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:34,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:17:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:34,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:17:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:34,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:17:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:17:34,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:34,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195085415] [2022-07-12 11:17:34,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195085415] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:17:34,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616593059] [2022-07-12 11:17:34,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:34,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:34,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:34,333 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:17:34,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 11:17:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:34,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 2587 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-12 11:17:34,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:17:34,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 11:17:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 11:17:34,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:17:34,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616593059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:34,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:17:34,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 17 [2022-07-12 11:17:34,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938073401] [2022-07-12 11:17:34,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:34,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 11:17:34,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:34,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 11:17:34,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:17:34,888 INFO L87 Difference]: Start difference. First operand 382 states and 602 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 10 states have internal predecessors, (58), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-12 11:17:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:35,004 INFO L93 Difference]: Finished difference Result 579 states and 871 transitions. [2022-07-12 11:17:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:17:35,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 10 states have internal predecessors, (58), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 90 [2022-07-12 11:17:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:35,007 INFO L225 Difference]: With dead ends: 579 [2022-07-12 11:17:35,007 INFO L226 Difference]: Without dead ends: 395 [2022-07-12 11:17:35,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-12 11:17:35,009 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 78 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:35,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 775 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 63 Invalid, 0 Unknown, 98 Unchecked, 0.1s Time] [2022-07-12 11:17:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-07-12 11:17:35,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 386. [2022-07-12 11:17:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 276 states have (on average 1.2681159420289856) internal successors, (350), 277 states have internal predecessors, (350), 93 states have call successors, (93), 14 states have call predecessors, (93), 16 states have return successors, (152), 94 states have call predecessors, (152), 92 states have call successors, (152) [2022-07-12 11:17:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 595 transitions. [2022-07-12 11:17:35,034 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 595 transitions. Word has length 90 [2022-07-12 11:17:35,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:35,035 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 595 transitions. [2022-07-12 11:17:35,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 10 states have internal predecessors, (58), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-12 11:17:35,035 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 595 transitions. [2022-07-12 11:17:35,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 11:17:35,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:35,037 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:35,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 11:17:35,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:35,259 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:35,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:35,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1650189964, now seen corresponding path program 1 times [2022-07-12 11:17:35,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:35,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625299055] [2022-07-12 11:17:35,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:35,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:35,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:35,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:35,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:35,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:35,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:35,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:35,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:17:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:35,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:17:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:35,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:17:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:35,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:17:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:35,488 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-12 11:17:35,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:35,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625299055] [2022-07-12 11:17:35,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625299055] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:17:35,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996609136] [2022-07-12 11:17:35,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:35,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:35,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:35,516 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:17:35,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 11:17:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:35,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 2588 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:17:35,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:17:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 11:17:35,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:17:35,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996609136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:35,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:17:35,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-07-12 11:17:35,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876043204] [2022-07-12 11:17:35,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:35,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:17:35,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:35,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:17:35,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:17:35,905 INFO L87 Difference]: Start difference. First operand 386 states and 595 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 11:17:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:36,016 INFO L93 Difference]: Finished difference Result 717 states and 1152 transitions. [2022-07-12 11:17:36,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:17:36,017 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2022-07-12 11:17:36,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:36,019 INFO L225 Difference]: With dead ends: 717 [2022-07-12 11:17:36,019 INFO L226 Difference]: Without dead ends: 399 [2022-07-12 11:17:36,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:17:36,021 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 12 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:36,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1121 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:17:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-07-12 11:17:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2022-07-12 11:17:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 284 states have (on average 1.2605633802816902) internal successors, (358), 287 states have internal predecessors, (358), 93 states have call successors, (93), 14 states have call predecessors, (93), 18 states have return successors, (179), 94 states have call predecessors, (179), 92 states have call successors, (179) [2022-07-12 11:17:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 630 transitions. [2022-07-12 11:17:36,043 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 630 transitions. Word has length 94 [2022-07-12 11:17:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:36,044 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 630 transitions. [2022-07-12 11:17:36,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 11:17:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 630 transitions. [2022-07-12 11:17:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 11:17:36,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:36,046 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:36,067 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-12 11:17:36,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 11:17:36,255 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:36,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:36,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1448066457, now seen corresponding path program 1 times [2022-07-12 11:17:36,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:36,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298700356] [2022-07-12 11:17:36,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:36,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:36,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:36,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:36,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:36,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:36,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:36,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:36,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:17:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:36,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:17:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:36,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:17:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:36,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:17:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-12 11:17:36,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:36,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298700356] [2022-07-12 11:17:36,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298700356] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:17:36,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961085218] [2022-07-12 11:17:36,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:36,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:36,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:36,614 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-12 11:17:36,615 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-12 11:17:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:36,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 2593 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 11:17:36,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:17:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 11:17:37,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:17:38,033 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 11:17:38,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 1 [2022-07-12 11:17:38,127 INFO L356 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2022-07-12 11:17:38,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 36 [2022-07-12 11:17:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:17:38,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961085218] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:17:38,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:17:38,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 32 [2022-07-12 11:17:38,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766898580] [2022-07-12 11:17:38,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:17:38,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 11:17:38,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:38,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 11:17:38,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2022-07-12 11:17:38,212 INFO L87 Difference]: Start difference. First operand 396 states and 630 transitions. Second operand has 32 states, 32 states have (on average 4.15625) internal successors, (133), 31 states have internal predecessors, (133), 6 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2022-07-12 11:17:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:40,552 INFO L93 Difference]: Finished difference Result 696 states and 1252 transitions. [2022-07-12 11:17:40,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-12 11:17:40,554 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.15625) internal successors, (133), 31 states have internal predecessors, (133), 6 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) Word has length 96 [2022-07-12 11:17:40,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:40,558 INFO L225 Difference]: With dead ends: 696 [2022-07-12 11:17:40,558 INFO L226 Difference]: Without dead ends: 681 [2022-07-12 11:17:40,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 186 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=632, Invalid=2790, Unknown=0, NotChecked=0, Total=3422 [2022-07-12 11:17:40,559 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 366 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 334 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:40,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1286 Invalid, 2352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1904 Invalid, 0 Unknown, 334 Unchecked, 1.3s Time] [2022-07-12 11:17:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-07-12 11:17:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 581. [2022-07-12 11:17:40,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 415 states have (on average 1.2602409638554217) internal successors, (523), 419 states have internal predecessors, (523), 141 states have call successors, (141), 17 states have call predecessors, (141), 24 states have return successors, (352), 144 states have call predecessors, (352), 140 states have call successors, (352) [2022-07-12 11:17:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1016 transitions. [2022-07-12 11:17:40,600 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1016 transitions. Word has length 96 [2022-07-12 11:17:40,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:40,601 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 1016 transitions. [2022-07-12 11:17:40,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.15625) internal successors, (133), 31 states have internal predecessors, (133), 6 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2022-07-12 11:17:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1016 transitions. [2022-07-12 11:17:40,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 11:17:40,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:40,604 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:40,640 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-12 11:17:40,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:40,825 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:40,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1678310561, now seen corresponding path program 1 times [2022-07-12 11:17:40,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:40,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446774653] [2022-07-12 11:17:40,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:40,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:41,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:41,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:41,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:41,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:41,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:41,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:41,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:17:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:41,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:17:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:41,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:17:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:41,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:17:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 11:17:41,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:41,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446774653] [2022-07-12 11:17:41,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446774653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:17:41,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32550881] [2022-07-12 11:17:41,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:41,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:41,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:41,445 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-12 11:17:41,495 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-12 11:17:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:41,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 2596 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 11:17:41,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:17:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 11:17:42,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:17:42,536 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-12 11:17:42,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2022-07-12 11:17:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:17:42,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32550881] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:17:42,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:17:42,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 24 [2022-07-12 11:17:42,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468813209] [2022-07-12 11:17:42,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:17:42,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 11:17:42,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:42,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 11:17:42,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2022-07-12 11:17:42,558 INFO L87 Difference]: Start difference. First operand 581 states and 1016 transitions. Second operand has 24 states, 24 states have (on average 5.291666666666667) internal successors, (127), 23 states have internal predecessors, (127), 5 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-12 11:17:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:43,658 INFO L93 Difference]: Finished difference Result 698 states and 1266 transitions. [2022-07-12 11:17:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 11:17:43,658 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.291666666666667) internal successors, (127), 23 states have internal predecessors, (127), 5 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) Word has length 96 [2022-07-12 11:17:43,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:43,662 INFO L225 Difference]: With dead ends: 698 [2022-07-12 11:17:43,662 INFO L226 Difference]: Without dead ends: 676 [2022-07-12 11:17:43,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 193 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 11:17:43,663 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 278 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 419 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:43,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1087 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 917 Invalid, 0 Unknown, 419 Unchecked, 0.6s Time] [2022-07-12 11:17:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-07-12 11:17:43,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 672. [2022-07-12 11:17:43,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 479 states have (on average 1.2588726513569937) internal successors, (603), 481 states have internal predecessors, (603), 165 states have call successors, (165), 21 states have call predecessors, (165), 27 states have return successors, (434), 169 states have call predecessors, (434), 164 states have call successors, (434) [2022-07-12 11:17:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1202 transitions. [2022-07-12 11:17:43,702 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1202 transitions. Word has length 96 [2022-07-12 11:17:43,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:43,702 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 1202 transitions. [2022-07-12 11:17:43,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.291666666666667) internal successors, (127), 23 states have internal predecessors, (127), 5 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-12 11:17:43,702 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1202 transitions. [2022-07-12 11:17:43,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 11:17:43,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:43,705 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:43,733 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-12 11:17:43,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:43,923 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:43,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:43,924 INFO L85 PathProgramCache]: Analyzing trace with hash 90273573, now seen corresponding path program 1 times [2022-07-12 11:17:43,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:43,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222372345] [2022-07-12 11:17:43,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:43,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:44,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:44,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:44,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:44,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:44,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:44,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:17:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:44,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:17:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:44,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:17:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:17:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:17:44,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:44,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222372345] [2022-07-12 11:17:44,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222372345] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:17:44,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928495768] [2022-07-12 11:17:44,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:44,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:44,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:44,600 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-12 11:17:44,601 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-12 11:17:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:44,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 2598 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 11:17:44,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:17:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 11:17:45,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:17:46,172 INFO L356 Elim1Store]: treesize reduction 39, result has 46.6 percent of original size [2022-07-12 11:17:46,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 48 [2022-07-12 11:17:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:17:46,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928495768] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:17:46,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:17:46,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 30 [2022-07-12 11:17:46,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44898647] [2022-07-12 11:17:46,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:17:46,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 11:17:46,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:46,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 11:17:46,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2022-07-12 11:17:46,335 INFO L87 Difference]: Start difference. First operand 672 states and 1202 transitions. Second operand has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 29 states have internal predecessors, (128), 5 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-12 11:17:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:48,140 INFO L93 Difference]: Finished difference Result 776 states and 1317 transitions. [2022-07-12 11:17:48,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 11:17:48,140 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 29 states have internal predecessors, (128), 5 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) Word has length 96 [2022-07-12 11:17:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:48,144 INFO L225 Difference]: With dead ends: 776 [2022-07-12 11:17:48,144 INFO L226 Difference]: Without dead ends: 755 [2022-07-12 11:17:48,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 187 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=537, Invalid=2115, Unknown=0, NotChecked=0, Total=2652 [2022-07-12 11:17:48,146 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 345 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 540 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:48,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 834 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1063 Invalid, 0 Unknown, 540 Unchecked, 0.8s Time] [2022-07-12 11:17:48,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2022-07-12 11:17:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 690. [2022-07-12 11:17:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 496 states have (on average 1.2620967741935485) internal successors, (626), 500 states have internal predecessors, (626), 165 states have call successors, (165), 20 states have call predecessors, (165), 28 states have return successors, (339), 169 states have call predecessors, (339), 164 states have call successors, (339) [2022-07-12 11:17:48,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1130 transitions. [2022-07-12 11:17:48,200 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1130 transitions. Word has length 96 [2022-07-12 11:17:48,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:48,200 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 1130 transitions. [2022-07-12 11:17:48,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 29 states have internal predecessors, (128), 5 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-12 11:17:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1130 transitions. [2022-07-12 11:17:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 11:17:48,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:48,203 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:48,224 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-12 11:17:48,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 11:17:48,416 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:48,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:48,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1042757541, now seen corresponding path program 1 times [2022-07-12 11:17:48,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:48,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872091193] [2022-07-12 11:17:48,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:48,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:17:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:17:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:17:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:17:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 11:17:48,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:48,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872091193] [2022-07-12 11:17:48,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872091193] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:17:48,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673860719] [2022-07-12 11:17:48,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:48,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:48,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:48,627 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-12 11:17:48,628 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-12 11:17:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:17:48,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:17:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 11:17:49,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:17:49,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673860719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:49,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:17:49,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-07-12 11:17:49,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031324282] [2022-07-12 11:17:49,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:49,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:17:49,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:49,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:17:49,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:17:49,057 INFO L87 Difference]: Start difference. First operand 690 states and 1130 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:17:49,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:49,199 INFO L93 Difference]: Finished difference Result 1240 states and 2146 transitions. [2022-07-12 11:17:49,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:17:49,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2022-07-12 11:17:49,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:49,202 INFO L225 Difference]: With dead ends: 1240 [2022-07-12 11:17:49,202 INFO L226 Difference]: Without dead ends: 694 [2022-07-12 11:17:49,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:17:49,206 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 39 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:49,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 567 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-07-12 11:17:49,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-07-12 11:17:49,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 686. [2022-07-12 11:17:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 492 states have (on average 1.2560975609756098) internal successors, (618), 496 states have internal predecessors, (618), 165 states have call successors, (165), 20 states have call predecessors, (165), 28 states have return successors, (330), 169 states have call predecessors, (330), 164 states have call successors, (330) [2022-07-12 11:17:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1113 transitions. [2022-07-12 11:17:49,251 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1113 transitions. Word has length 96 [2022-07-12 11:17:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:49,251 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 1113 transitions. [2022-07-12 11:17:49,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:17:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1113 transitions. [2022-07-12 11:17:49,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 11:17:49,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:49,254 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:49,274 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-12 11:17:49,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 11:17:49,473 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:49,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:49,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1865424345, now seen corresponding path program 1 times [2022-07-12 11:17:49,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:49,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246081401] [2022-07-12 11:17:49,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:49,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:17:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:17:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:17:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:17:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-12 11:17:49,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:49,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246081401] [2022-07-12 11:17:49,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246081401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:17:49,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726081330] [2022-07-12 11:17:49,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:49,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:49,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:49,616 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-12 11:17:49,674 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-12 11:17:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 2599 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:17:50,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:17:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 11:17:50,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:17:50,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726081330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:50,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:17:50,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-12 11:17:50,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965081148] [2022-07-12 11:17:50,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:50,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:17:50,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:50,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:17:50,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:17:50,059 INFO L87 Difference]: Start difference. First operand 686 states and 1113 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:17:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:50,092 INFO L93 Difference]: Finished difference Result 843 states and 1309 transitions. [2022-07-12 11:17:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:17:50,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2022-07-12 11:17:50,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:50,093 INFO L225 Difference]: With dead ends: 843 [2022-07-12 11:17:50,093 INFO L226 Difference]: Without dead ends: 297 [2022-07-12 11:17:50,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:17:50,096 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 6 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:50,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 460 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:17:50,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-12 11:17:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 289. [2022-07-12 11:17:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 205 states have (on average 1.2341463414634146) internal successors, (253), 205 states have internal predecessors, (253), 69 states have call successors, (69), 14 states have call predecessors, (69), 14 states have return successors, (87), 69 states have call predecessors, (87), 68 states have call successors, (87) [2022-07-12 11:17:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 409 transitions. [2022-07-12 11:17:50,118 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 409 transitions. Word has length 96 [2022-07-12 11:17:50,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:50,119 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 409 transitions. [2022-07-12 11:17:50,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:17:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 409 transitions. [2022-07-12 11:17:50,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 11:17:50,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:50,120 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:50,140 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-12 11:17:50,340 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-12 11:17:50,340 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:50,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:50,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1830655980, now seen corresponding path program 1 times [2022-07-12 11:17:50,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:50,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384529340] [2022-07-12 11:17:50,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:50,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:17:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:17:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:17:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:17:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,567 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-12 11:17:50,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:50,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384529340] [2022-07-12 11:17:50,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384529340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:50,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:50,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 11:17:50,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050901349] [2022-07-12 11:17:50,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:50,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:17:50,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:50,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:17:50,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:17:50,570 INFO L87 Difference]: Start difference. First operand 289 states and 409 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 11:17:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:50,907 INFO L93 Difference]: Finished difference Result 300 states and 426 transitions. [2022-07-12 11:17:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:17:50,908 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2022-07-12 11:17:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:50,909 INFO L225 Difference]: With dead ends: 300 [2022-07-12 11:17:50,909 INFO L226 Difference]: Without dead ends: 259 [2022-07-12 11:17:50,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-12 11:17:50,910 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 88 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:50,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 800 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:17:50,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-12 11:17:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2022-07-12 11:17:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 182 states have (on average 1.2142857142857142) internal successors, (221), 183 states have internal predecessors, (221), 58 states have call successors, (58), 14 states have call predecessors, (58), 14 states have return successors, (69), 57 states have call predecessors, (69), 56 states have call successors, (69) [2022-07-12 11:17:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 348 transitions. [2022-07-12 11:17:50,941 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 348 transitions. Word has length 98 [2022-07-12 11:17:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:50,941 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 348 transitions. [2022-07-12 11:17:50,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 11:17:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 348 transitions. [2022-07-12 11:17:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 11:17:50,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:50,942 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:50,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 11:17:50,942 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:50,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:50,943 INFO L85 PathProgramCache]: Analyzing trace with hash -887227732, now seen corresponding path program 1 times [2022-07-12 11:17:50,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:50,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399963576] [2022-07-12 11:17:50,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:50,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:17:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:17:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:17:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:17:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:17:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:17:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:17:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:17:51,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:51,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399963576] [2022-07-12 11:17:51,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399963576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:51,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:51,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-12 11:17:51,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080009057] [2022-07-12 11:17:51,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:51,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 11:17:51,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:51,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 11:17:51,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:17:51,564 INFO L87 Difference]: Start difference. First operand 255 states and 348 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-12 11:17:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:52,088 INFO L93 Difference]: Finished difference Result 265 states and 362 transitions. [2022-07-12 11:17:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 11:17:52,089 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 98 [2022-07-12 11:17:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:52,090 INFO L225 Difference]: With dead ends: 265 [2022-07-12 11:17:52,090 INFO L226 Difference]: Without dead ends: 201 [2022-07-12 11:17:52,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2022-07-12 11:17:52,091 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 169 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:52,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 900 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:17:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-12 11:17:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 150. [2022-07-12 11:17:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 109 states have (on average 1.1926605504587156) internal successors, (130), 110 states have internal predecessors, (130), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-07-12 11:17:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 187 transitions. [2022-07-12 11:17:52,099 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 187 transitions. Word has length 98 [2022-07-12 11:17:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:52,100 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 187 transitions. [2022-07-12 11:17:52,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-12 11:17:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 187 transitions. [2022-07-12 11:17:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 11:17:52,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:52,101 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:52,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 11:17:52,101 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:52,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash 833744277, now seen corresponding path program 1 times [2022-07-12 11:17:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:52,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087606509] [2022-07-12 11:17:52,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:17:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:17:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:17:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:17:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:17:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:17:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:17:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:17:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:17:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-12 11:17:52,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:52,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087606509] [2022-07-12 11:17:52,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087606509] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:17:52,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998501144] [2022-07-12 11:17:52,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:52,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:52,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:52,673 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-12 11:17:52,711 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-12 11:17:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:53,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 2728 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 11:17:53,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:17:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-12 11:17:53,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:17:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-12 11:17:53,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998501144] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:17:53,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:17:53,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 23 [2022-07-12 11:17:53,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567524910] [2022-07-12 11:17:53,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:17:53,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 11:17:53,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:53,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 11:17:53,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2022-07-12 11:17:53,359 INFO L87 Difference]: Start difference. First operand 150 states and 187 transitions. Second operand has 23 states, 21 states have (on average 4.428571428571429) internal successors, (93), 17 states have internal predecessors, (93), 9 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) [2022-07-12 11:17:53,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:53,838 INFO L93 Difference]: Finished difference Result 165 states and 199 transitions. [2022-07-12 11:17:53,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 11:17:53,839 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.428571428571429) internal successors, (93), 17 states have internal predecessors, (93), 9 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) Word has length 122 [2022-07-12 11:17:53,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:53,839 INFO L225 Difference]: With dead ends: 165 [2022-07-12 11:17:53,839 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 11:17:53,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 11:17:53,840 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:53,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 283 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:17:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 11:17:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 11:17:53,841 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-12 11:17:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 11:17:53,841 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2022-07-12 11:17:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:53,841 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 11:17:53,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.428571428571429) internal successors, (93), 17 states have internal predecessors, (93), 9 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) [2022-07-12 11:17:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 11:17:53,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 11:17:53,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 11:17:53,872 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-12 11:17:54,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:54,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 11:17:55,147 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) [2022-07-12 11:17:55,147 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-07-12 11:17:55,147 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (or (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) (not (< 0 |#StackHeapBarrier|))) [2022-07-12 11:17:55,147 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-07-12 11:17:55,147 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (or (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) .cse0) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (let ((.cse1 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (<= .cse1 (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ .cse1 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)))))) (= |old(#valid)| |#valid|))) (not (< 0 |#StackHeapBarrier|))) [2022-07-12 11:17:55,147 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-07-12 11:17:55,147 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (or (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) (not (< 0 |#StackHeapBarrier|))) [2022-07-12 11:17:55,147 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-07-12 11:17:55,147 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-12 11:17:55,147 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-12 11:17:55,147 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-07-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-07-12 11:17:55,148 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-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-07-12 11:17:55,148 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-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-12 11:17:55,148 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-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point L7364-6(line 7364) no Hoare annotation was computed. [2022-07-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point L7364-4(line 7364) no Hoare annotation was computed. [2022-07-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point L7364-3(line 7364) no Hoare annotation was computed. [2022-07-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point L7364-8(line 7364) no Hoare annotation was computed. [2022-07-12 11:17:55,148 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7359 7365) the Hoare annotation is: true [2022-07-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7359 7365) no Hoare annotation was computed. [2022-07-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point L7361-3(line 7361) no Hoare annotation was computed. [2022-07-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point L7361-1(line 7361) no Hoare annotation was computed. [2022-07-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7359 7365) no Hoare annotation was computed. [2022-07-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point L7361(lines 7361 7364) no Hoare annotation was computed. [2022-07-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point L7361-7(lines 7361 7364) no Hoare annotation was computed. [2022-07-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point L7361-6(lines 7361 7362) no Hoare annotation was computed. [2022-07-12 11:17:55,148 INFO L899 garLoopResultBuilder]: For program point L7361-4(lines 7361 7362) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point L7361-11(lines 7361 7364) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point L7361-9(lines 7361 7364) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point L7364-2(line 7364) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point L7364(line 7364) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-07-12 11:17:55,149 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-07-12 11:17:55,149 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-12 11:17:55,150 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-12 11:17:55,150 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-12 11:17:55,150 INFO L899 garLoopResultBuilder]: For program point L9429(lines 9429 9437) no Hoare annotation was computed. [2022-07-12 11:17:55,150 INFO L899 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2022-07-12 11:17:55,150 INFO L895 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:17:55,150 INFO L899 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2022-07-12 11:17:55,150 INFO L899 garLoopResultBuilder]: For program point L9438-1(line 9438) no Hoare annotation was computed. [2022-07-12 11:17:55,150 INFO L895 garLoopResultBuilder]: At program point L9438-2(lines 9416 9439) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse1 18446744073709551616)) (* (- 1) .cse1) .cse0)) 18446744073709551616)))) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)))) [2022-07-12 11:17:55,150 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 11:17:55,150 INFO L902 garLoopResultBuilder]: At program point L9562(line 9562) the Hoare annotation is: true [2022-07-12 11:17:55,150 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 11:17:55,150 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 11:17:55,150 INFO L895 garLoopResultBuilder]: At program point L9438(line 9438) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse1 18446744073709551616)) (* (- 1) .cse1) .cse0)) 18446744073709551616)))) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)))) [2022-07-12 11:17:55,150 INFO L895 garLoopResultBuilder]: At program point L9554(line 9554) the Hoare annotation is: false [2022-07-12 11:17:55,150 INFO L895 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:17:55,150 INFO L899 garLoopResultBuilder]: For program point L6610-3(lines 6610 6612) no Hoare annotation was computed. [2022-07-12 11:17:55,150 INFO L899 garLoopResultBuilder]: For program point L6610-1(lines 6610 6612) no Hoare annotation was computed. [2022-07-12 11:17:55,150 INFO L895 garLoopResultBuilder]: At program point L9546(line 9546) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:17:55,151 INFO L899 garLoopResultBuilder]: For program point L9418(line 9418) no Hoare annotation was computed. [2022-07-12 11:17:55,151 INFO L895 garLoopResultBuilder]: At program point L9554-1(line 9554) the Hoare annotation is: false [2022-07-12 11:17:55,151 INFO L899 garLoopResultBuilder]: For program point L9554-2(line 9554) no Hoare annotation was computed. [2022-07-12 11:17:55,151 INFO L899 garLoopResultBuilder]: For program point L9418-5(line 9418) no Hoare annotation was computed. [2022-07-12 11:17:55,151 INFO L899 garLoopResultBuilder]: For program point L9538(lines 9538 9561) no Hoare annotation was computed. [2022-07-12 11:17:55,151 INFO L895 garLoopResultBuilder]: At program point L9546-1(line 9546) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0)) (.cse2 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0))) (.cse6 (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) (.cse8 (< 0 |#StackHeapBarrier|))) (or (let ((.cse5 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse3 (select .cse5 16))) (and .cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) .cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) .cse2 (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse4 (select .cse5 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse4 18446744073709551616)) (* (- 1) .cse4) .cse3)) 18446744073709551616)))) .cse6 (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616)))) .cse7 .cse8))) (and .cse0 (<= 0 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ret1350#1|) .cse1 (<= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ret1350#1| 0) .cse2 .cse6 .cse7 .cse8))) [2022-07-12 11:17:55,151 INFO L899 garLoopResultBuilder]: For program point L9546-2(line 9546) no Hoare annotation was computed. [2022-07-12 11:17:55,151 INFO L895 garLoopResultBuilder]: At program point L9418-2(line 9418) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse1 18446744073709551616)) (* (- 1) .cse1) .cse0)) 18446744073709551616)))) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)))) [2022-07-12 11:17:55,151 INFO L899 garLoopResultBuilder]: For program point L9418-3(line 9418) no Hoare annotation was computed. [2022-07-12 11:17:55,151 INFO L895 garLoopResultBuilder]: At program point L9418-4(line 9418) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse1 18446744073709551616)) (* (- 1) .cse1) .cse0)) 18446744073709551616)))) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)))) [2022-07-12 11:17:55,151 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 11:17:55,151 INFO L899 garLoopResultBuilder]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2022-07-12 11:17:55,151 INFO L899 garLoopResultBuilder]: For program point L9551-2(lines 9551 9552) no Hoare annotation was computed. [2022-07-12 11:17:55,151 INFO L899 garLoopResultBuilder]: For program point L9551-3(lines 9551 9558) no Hoare annotation was computed. [2022-07-12 11:17:55,151 INFO L899 garLoopResultBuilder]: For program point L9419(line 9419) no Hoare annotation was computed. [2022-07-12 11:17:55,151 INFO L895 garLoopResultBuilder]: At program point L9551-4(lines 9551 9558) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse1 18446744073709551616)) (* (- 1) .cse1) .cse0)) 18446744073709551616)))) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)))) [2022-07-12 11:17:55,151 INFO L899 garLoopResultBuilder]: For program point L9551(lines 9551 9552) no Hoare annotation was computed. [2022-07-12 11:17:55,151 INFO L895 garLoopResultBuilder]: At program point L9539(line 9539) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2022-07-12 11:17:55,152 INFO L899 garLoopResultBuilder]: For program point L9539-1(lines 9539 9540) no Hoare annotation was computed. [2022-07-12 11:17:55,152 INFO L895 garLoopResultBuilder]: At program point L9419-2(line 9419) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse1 18446744073709551616)) (* (- 1) .cse1) .cse0)) 18446744073709551616)))) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)))) [2022-07-12 11:17:55,152 INFO L899 garLoopResultBuilder]: For program point L9419-3(line 9419) no Hoare annotation was computed. [2022-07-12 11:17:55,152 INFO L895 garLoopResultBuilder]: At program point L9419-4(line 9419) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) 8) 0)) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset|))) (+ (* 18446744073709551616 (div .cse1 18446744073709551616)) (* (- 1) .cse1) .cse0)) 18446744073709551616)))) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)))) [2022-07-12 11:17:55,152 INFO L899 garLoopResultBuilder]: For program point L9419-5(line 9419) no Hoare annotation was computed. [2022-07-12 11:17:55,152 INFO L895 garLoopResultBuilder]: At program point L9539-2(line 9539) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2022-07-12 11:17:55,152 INFO L899 garLoopResultBuilder]: For program point L9539-3(line 9539) no Hoare annotation was computed. [2022-07-12 11:17:55,152 INFO L899 garLoopResultBuilder]: For program point L9539-5(lines 9539 9540) no Hoare annotation was computed. [2022-07-12 11:17:55,152 INFO L895 garLoopResultBuilder]: At program point L9556(line 9556) the Hoare annotation is: false [2022-07-12 11:17:55,152 INFO L899 garLoopResultBuilder]: For program point L9556-1(line 9556) no Hoare annotation was computed. [2022-07-12 11:17:55,152 INFO L899 garLoopResultBuilder]: For program point L6612-1(line 6612) no Hoare annotation was computed. [2022-07-12 11:17:55,152 INFO L895 garLoopResultBuilder]: At program point L9560(line 9560) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ret1356#1|) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (<= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ret1356#1| 1) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:17:55,152 INFO L895 garLoopResultBuilder]: At program point L6612(line 6612) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:17:55,152 INFO L899 garLoopResultBuilder]: For program point L9560-1(line 9560) no Hoare annotation was computed. [2022-07-12 11:17:55,152 INFO L899 garLoopResultBuilder]: For program point L9420(lines 9420 9428) no Hoare annotation was computed. [2022-07-12 11:17:55,152 INFO L895 garLoopResultBuilder]: At program point L6600(lines 6598 6601) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:17:55,152 INFO L895 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3#1.base| 0) (< 1 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:17:55,152 INFO L899 garLoopResultBuilder]: For program point L9544-1(line 9544) no Hoare annotation was computed. [2022-07-12 11:17:55,152 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-12 11:17:55,152 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-12 11:17:55,153 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-12 11:17:55,153 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-12 11:17:55,153 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-12 11:17:55,153 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-12 11:17:55,153 INFO L902 garLoopResultBuilder]: At program point aws_array_eq_ignore_caseENTRY(lines 7651 7681) the Hoare annotation is: true [2022-07-12 11:17:55,153 INFO L899 garLoopResultBuilder]: For program point aws_array_eq_ignore_caseFINAL(lines 7651 7681) no Hoare annotation was computed. [2022-07-12 11:17:55,153 INFO L899 garLoopResultBuilder]: For program point L7671(lines 7671 7675) no Hoare annotation was computed. [2022-07-12 11:17:55,153 INFO L899 garLoopResultBuilder]: For program point L7670-4(lines 7670 7676) no Hoare annotation was computed. [2022-07-12 11:17:55,153 INFO L902 garLoopResultBuilder]: At program point L7670-3(lines 7670 7676) the Hoare annotation is: true [2022-07-12 11:17:55,153 INFO L899 garLoopResultBuilder]: For program point L7670-2(lines 7670 7676) no Hoare annotation was computed. [2022-07-12 11:17:55,153 INFO L899 garLoopResultBuilder]: For program point L7659(lines 7656 7681) no Hoare annotation was computed. [2022-07-12 11:17:55,153 INFO L902 garLoopResultBuilder]: At program point L7657-1(line 7657) the Hoare annotation is: true [2022-07-12 11:17:55,153 INFO L902 garLoopResultBuilder]: At program point L7657(line 7657) the Hoare annotation is: true [2022-07-12 11:17:55,153 INFO L899 garLoopResultBuilder]: For program point aws_array_eq_ignore_caseEXIT(lines 7651 7681) no Hoare annotation was computed. [2022-07-12 11:17:55,158 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:55,159 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 11:17:55,173 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 11:17:55,176 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 11:17:55,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 11:17:55 BoogieIcfgContainer [2022-07-12 11:17:55,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 11:17:55,184 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 11:17:55,184 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 11:17:55,184 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 11:17:55,185 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:17:22" (3/4) ... [2022-07-12 11:17:55,187 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 11:17:55,190 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-07-12 11:17:55,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-12 11:17:55,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-12 11:17:55,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-07-12 11:17:55,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-12 11:17:55,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-12 11:17:55,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-12 11:17:55,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq_ignore_case [2022-07-12 11:17:55,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-12 11:17:55,192 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-12 11:17:55,203 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2022-07-12 11:17:55,204 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2022-07-12 11:17:55,205 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-07-12 11:17:55,206 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-12 11:17:55,207 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-12 11:17:55,208 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-12 11:17:55,209 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 11:17:55,209 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 11:17:55,235 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0 < unknown-#StackHeapBarrier-unknown) || ((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(\old(max_size) == 16)) [2022-07-12 11:17:55,490 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 11:17:55,491 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 11:17:55,491 INFO L158 Benchmark]: Toolchain (without parser) took 36351.38ms. Allocated memory was 111.1MB in the beginning and 763.4MB in the end (delta: 652.2MB). Free memory was 76.3MB in the beginning and 262.5MB in the end (delta: -186.2MB). Peak memory consumption was 464.2MB. Max. memory is 16.1GB. [2022-07-12 11:17:55,491 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 86.0MB. Free memory is still 46.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:17:55,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1788.42ms. Allocated memory was 111.1MB in the beginning and 172.0MB in the end (delta: 60.8MB). Free memory was 76.3MB in the beginning and 101.5MB in the end (delta: -25.2MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. [2022-07-12 11:17:55,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 144.96ms. Allocated memory is still 172.0MB. Free memory was 101.5MB in the beginning and 90.1MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 11:17:55,492 INFO L158 Benchmark]: Boogie Preprocessor took 80.74ms. Allocated memory is still 172.0MB. Free memory was 90.1MB in the beginning and 83.5MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 11:17:55,492 INFO L158 Benchmark]: RCFGBuilder took 1118.30ms. Allocated memory was 172.0MB in the beginning and 281.0MB in the end (delta: 109.1MB). Free memory was 82.6MB in the beginning and 152.7MB in the end (delta: -70.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-07-12 11:17:55,492 INFO L158 Benchmark]: TraceAbstraction took 32906.45ms. Allocated memory was 281.0MB in the beginning and 763.4MB in the end (delta: 482.3MB). Free memory was 151.6MB in the beginning and 393.5MB in the end (delta: -241.9MB). Peak memory consumption was 240.5MB. Max. memory is 16.1GB. [2022-07-12 11:17:55,493 INFO L158 Benchmark]: Witness Printer took 306.82ms. Allocated memory is still 763.4MB. Free memory was 393.5MB in the beginning and 262.5MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-07-12 11:17:55,494 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.14ms. Allocated memory is still 86.0MB. Free memory is still 46.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1788.42ms. Allocated memory was 111.1MB in the beginning and 172.0MB in the end (delta: 60.8MB). Free memory was 76.3MB in the beginning and 101.5MB in the end (delta: -25.2MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 144.96ms. Allocated memory is still 172.0MB. Free memory was 101.5MB in the beginning and 90.1MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.74ms. Allocated memory is still 172.0MB. Free memory was 90.1MB in the beginning and 83.5MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1118.30ms. Allocated memory was 172.0MB in the beginning and 281.0MB in the end (delta: 109.1MB). Free memory was 82.6MB in the beginning and 152.7MB in the end (delta: -70.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32906.45ms. Allocated memory was 281.0MB in the beginning and 763.4MB in the end (delta: 482.3MB). Free memory was 151.6MB in the beginning and 393.5MB in the end (delta: -241.9MB). Peak memory consumption was 240.5MB. Max. memory is 16.1GB. * Witness Printer took 306.82ms. Allocated memory is still 763.4MB. Free memory was 393.5MB in the beginning and 262.5MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.8s, OverallIterations: 19, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3317 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3183 mSDsluCounter, 12592 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2326 IncrementalHoareTripleChecker+Unchecked, 9804 mSDsCounter, 889 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10497 IncrementalHoareTripleChecker+Invalid, 13712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 889 mSolverCounterUnsat, 2788 mSDtfsCounter, 10497 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2384 GetRequests, 1954 SyntacticMatches, 42 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3487 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=690occurred in iteration=14, InterpolantAutomatonStates: 243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 311 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 41 LocationsWithAnnotation, 732 PreInvPairs, 780 NumberOfFragments, 1107 HoareAnnotationTreeSize, 732 FomulaSimplifications, 452 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 41 FomulaSimplificationsInter, 9750 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 2740 NumberOfCodeBlocks, 2740 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3351 ConstructedInterpolants, 120 QuantifiedInterpolants, 19347 SizeOfPredicates, 106 NumberOfNonLiveVariables, 28568 ConjunctsInSsa, 249 ConjunctsInUnsatCore, 37 InterpolantComputations, 13 PerfectInterpolantSequences, 1909/2127 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6598]: Loop Invariant Derived loop invariant: (((str == 0 && buf == 0) && str == 0) && 1 < buf) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 7670]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9416]: Loop Invariant [2022-07-12 11:17:55,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 11:17:55,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((buf == buf && str == 0) && buf == 0) && str == 0) && !(#memory_$Pointer$[buf][8] == 0)) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616) + -1 * unknown-#memory_int-unknown[buf][buf] + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && 1 < buf) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && buf == 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: !(0 < unknown-#StackHeapBarrier-unknown) || ((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(\old(max_size) == 16)) RESULT: Ultimate proved your program to be correct! [2022-07-12 11:17:55,515 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