./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_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_byte_cursor_from_string_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 c3b06783378816ab028e38f9f4609990f4d1028238bbcb0e88638ebb644bb54d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:02:31,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:02:31,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:02:31,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:02:31,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:02:31,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:02:31,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:02:31,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:02:31,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:02:31,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:02:31,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:02:31,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:02:31,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:02:31,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:02:31,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:02:31,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:02:31,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:02:31,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:02:31,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:02:31,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:02:31,520 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:02:31,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:02:31,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:02:31,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:02:31,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:02:31,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:02:31,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:02:31,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:02:31,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:02:31,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:02:31,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:02:31,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:02:31,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:02:31,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:02:31,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:02:31,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:02:31,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:02:31,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:02:31,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:02:31,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:02:31,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:02:31,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:02:31,536 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:02:31,563 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:02:31,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:02:31,569 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:02:31,570 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:02:31,570 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:02:31,570 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:02:31,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:02:31,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:02:31,571 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:02:31,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:02:31,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:02:31,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:02:31,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:02:31,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:02:31,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:02:31,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:02:31,573 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:02:31,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:02:31,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:02:31,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:02:31,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:02:31,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:02:31,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:02:31,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:02:31,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:02:31,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:02:31,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:02:31,577 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:02:31,577 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:02:31,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:02:31,577 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 -> c3b06783378816ab028e38f9f4609990f4d1028238bbcb0e88638ebb644bb54d [2022-07-12 11:02:31,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:02:31,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:02:31,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:02:31,849 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:02:31,850 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:02:31,851 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i [2022-07-12 11:02:31,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63cff1ce2/2e5d65d669654b06b845bc199c86b71a/FLAGe358405d5 [2022-07-12 11:02:32,698 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:02:32,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i [2022-07-12 11:02:32,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63cff1ce2/2e5d65d669654b06b845bc199c86b71a/FLAGe358405d5 [2022-07-12 11:02:33,224 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63cff1ce2/2e5d65d669654b06b845bc199c86b71a [2022-07-12 11:02:33,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:02:33,228 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:02:33,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:02:33,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:02:33,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:02:33,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:02:33" (1/1) ... [2022-07-12 11:02:33,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62bc658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:02:33, skipping insertion in model container [2022-07-12 11:02:33,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:02:33" (1/1) ... [2022-07-12 11:02:33,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:02:33,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:02:33,620 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_byte_cursor_from_string_harness.i[4501,4514] [2022-07-12 11:02:33,628 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_byte_cursor_from_string_harness.i[4561,4574] [2022-07-12 11:02:34,354 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:34,355 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:34,357 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:34,359 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:34,360 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:34,371 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:34,374 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:34,382 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:34,383 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:34,641 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:02:34,642 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:02:34,643 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:02:34,644 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:02:34,645 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:02:34,646 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:02:34,646 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:02:34,647 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:02:34,647 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:02:34,648 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:02:34,788 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:02:34,870 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:34,874 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:34,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:02:35,037 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:02:35,059 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_byte_cursor_from_string_harness.i[4501,4514] [2022-07-12 11:02:35,061 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_byte_cursor_from_string_harness.i[4561,4574] [2022-07-12 11:02:35,117 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:35,118 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:35,118 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:35,118 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:35,123 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:35,131 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:35,132 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:35,133 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:35,133 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:35,158 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:02:35,159 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:02:35,160 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:02:35,160 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:02:35,162 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:02:35,163 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:02:35,164 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:02:35,164 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:02:35,165 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:02:35,165 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:02:35,185 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:02:35,248 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:35,249 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:02:35,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:02:35,514 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:02:35,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:02:35 WrapperNode [2022-07-12 11:02:35,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:02:35,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:02:35,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:02:35,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:02:35,522 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:02:35" (1/1) ... [2022-07-12 11:02:35,616 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:02:35" (1/1) ... [2022-07-12 11:02:35,692 INFO L137 Inliner]: procedures = 693, calls = 2785, calls flagged for inlining = 59, calls inlined = 7, statements flattened = 833 [2022-07-12 11:02:35,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:02:35,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:02:35,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:02:35,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:02:35,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:02:35" (1/1) ... [2022-07-12 11:02:35,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:02:35" (1/1) ... [2022-07-12 11:02:35,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:02:35" (1/1) ... [2022-07-12 11:02:35,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:02:35" (1/1) ... [2022-07-12 11:02:35,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:02:35" (1/1) ... [2022-07-12 11:02:35,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:02:35" (1/1) ... [2022-07-12 11:02:35,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:02:35" (1/1) ... [2022-07-12 11:02:35,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:02:35,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:02:35,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:02:35,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:02:35,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:02:35" (1/1) ... [2022-07-12 11:02:35,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:02:35,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:35,841 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:02:35,867 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:02:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-12 11:02:35,894 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-12 11:02:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-12 11:02:35,895 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-12 11:02:35,895 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-12 11:02:35,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-12 11:02:35,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:02:35,895 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 11:02:35,896 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 11:02:35,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:02:35,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:02:35,897 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:02:35,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:02:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:02:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:02:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:02:35,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:02:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 11:02:35,899 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 11:02:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 11:02:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_bytes [2022-07-12 11:02:35,899 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_bytes [2022-07-12 11:02:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:02:35,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:02:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:02:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:02:35,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:02:35,901 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-12 11:02:35,902 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-12 11:02:35,902 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 11:02:35,902 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 11:02:35,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:02:35,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:02:36,149 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:02:36,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:02:37,212 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:02:37,224 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:02:37,225 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 11:02:37,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:02:37 BoogieIcfgContainer [2022-07-12 11:02:37,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:02:37,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:02:37,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:02:37,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:02:37,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:02:33" (1/3) ... [2022-07-12 11:02:37,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31458e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:02:37, skipping insertion in model container [2022-07-12 11:02:37,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:02:35" (2/3) ... [2022-07-12 11:02:37,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31458e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:02:37, skipping insertion in model container [2022-07-12 11:02:37,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:02:37" (3/3) ... [2022-07-12 11:02:37,246 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_string_harness.i [2022-07-12 11:02:37,259 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:02:37,260 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:02:37,327 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:02:37,332 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@7a40a844, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6f199fc7 [2022-07-12 11:02:37,332 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:02:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-12 11:02:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-12 11:02:37,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:37,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:37,347 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1122645662, now seen corresponding path program 1 times [2022-07-12 11:02:37,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:37,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774891389] [2022-07-12 11:02:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:37,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:37,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:37,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:37,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:37,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:02:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:02:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:02:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:02:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:02:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-12 11:02:38,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:38,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774891389] [2022-07-12 11:02:38,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774891389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:38,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:38,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:02:38,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231011615] [2022-07-12 11:02:38,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:38,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:02:38,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:38,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:02:38,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:02:38,196 INFO L87 Difference]: Start difference. First operand has 104 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 11:02:38,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:38,462 INFO L93 Difference]: Finished difference Result 201 states and 264 transitions. [2022-07-12 11:02:38,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:02:38,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 85 [2022-07-12 11:02:38,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:38,473 INFO L225 Difference]: With dead ends: 201 [2022-07-12 11:02:38,473 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 11:02:38,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:02:38,479 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 92 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:38,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 140 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:02:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 11:02:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-12 11:02:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 63 states have internal predecessors, (71), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-12 11:02:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2022-07-12 11:02:38,520 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 85 [2022-07-12 11:02:38,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:38,521 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2022-07-12 11:02:38,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 11:02:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2022-07-12 11:02:38,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-12 11:02:38,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:38,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:38,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:02:38,526 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:38,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:38,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1334345696, now seen corresponding path program 1 times [2022-07-12 11:02:38,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:38,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415783340] [2022-07-12 11:02:38,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:38,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:02:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:02:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:02:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:02:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:02:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-12 11:02:38,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:38,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415783340] [2022-07-12 11:02:38,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415783340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:38,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:38,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:02:38,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535107230] [2022-07-12 11:02:38,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:38,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:02:38,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:38,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:02:38,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:02:38,913 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 11:02:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:39,231 INFO L93 Difference]: Finished difference Result 155 states and 190 transitions. [2022-07-12 11:02:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:02:39,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 85 [2022-07-12 11:02:39,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:39,235 INFO L225 Difference]: With dead ends: 155 [2022-07-12 11:02:39,235 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 11:02:39,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:02:39,236 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 111 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:39,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 268 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:02:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 11:02:39,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-12 11:02:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 64 states have (on average 1.140625) internal successors, (73), 66 states have internal predecessors, (73), 25 states have call successors, (25), 10 states have call predecessors, (25), 11 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-07-12 11:02:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2022-07-12 11:02:39,253 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 85 [2022-07-12 11:02:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:39,254 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2022-07-12 11:02:39,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 11:02:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2022-07-12 11:02:39,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 11:02:39,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:39,260 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:39,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 11:02:39,261 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:39,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash 50703397, now seen corresponding path program 1 times [2022-07-12 11:02:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:39,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583139341] [2022-07-12 11:02:39,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:39,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:39,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:39,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:39,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:39,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:39,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:39,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:02:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:39,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:39,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:02:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:39,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:02:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:39,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:39,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:39,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:02:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:39,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:02:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-12 11:02:39,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:39,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583139341] [2022-07-12 11:02:39,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583139341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:39,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:39,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:02:39,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476857175] [2022-07-12 11:02:39,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:39,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:02:39,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:39,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:02:39,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:02:39,712 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 11:02:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:40,212 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2022-07-12 11:02:40,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:02:40,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2022-07-12 11:02:40,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:40,214 INFO L225 Difference]: With dead ends: 113 [2022-07-12 11:02:40,214 INFO L226 Difference]: Without dead ends: 111 [2022-07-12 11:02:40,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:02:40,216 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:40,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 419 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:02:40,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-12 11:02:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2022-07-12 11:02:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 73 states have internal predecessors, (79), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-12 11:02:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2022-07-12 11:02:40,227 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 87 [2022-07-12 11:02:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:40,227 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2022-07-12 11:02:40,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 11:02:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2022-07-12 11:02:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 11:02:40,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:40,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:40,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:02:40,230 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:40,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:40,230 INFO L85 PathProgramCache]: Analyzing trace with hash 976473645, now seen corresponding path program 1 times [2022-07-12 11:02:40,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:40,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691440728] [2022-07-12 11:02:40,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:40,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:40,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:40,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:40,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:40,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:40,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:40,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:02:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:40,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:02:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:40,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:02:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:40,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:40,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:40,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:02:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:40,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:02:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 11:02:40,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:40,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691440728] [2022-07-12 11:02:40,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691440728] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:40,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954461357] [2022-07-12 11:02:40,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:40,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:40,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:40,904 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:02:40,905 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:02:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 2658 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-12 11:02:41,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:41,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:41,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-12 11:02:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-12 11:02:42,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:02:42,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954461357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:42,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:02:42,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [13] total 30 [2022-07-12 11:02:42,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814025557] [2022-07-12 11:02:42,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:42,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 11:02:42,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:42,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 11:02:42,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=801, Unknown=0, NotChecked=0, Total=870 [2022-07-12 11:02:42,159 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 15 states have internal predecessors, (46), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-12 11:02:42,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:42,383 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2022-07-12 11:02:42,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 11:02:42,385 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 15 states have internal predecessors, (46), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) Word has length 91 [2022-07-12 11:02:42,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:42,389 INFO L225 Difference]: With dead ends: 196 [2022-07-12 11:02:42,390 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 11:02:42,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 11:02:42,394 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 32 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:42,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1545 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 84 Unchecked, 0.1s Time] [2022-07-12 11:02:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 11:02:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-07-12 11:02:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 83 states have (on average 1.144578313253012) internal successors, (95), 86 states have internal predecessors, (95), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-12 11:02:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2022-07-12 11:02:42,409 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 91 [2022-07-12 11:02:42,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:42,409 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2022-07-12 11:02:42,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 15 states have internal predecessors, (46), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-12 11:02:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2022-07-12 11:02:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 11:02:42,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:42,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:42,446 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:02:42,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:42,634 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:42,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1234639083, now seen corresponding path program 1 times [2022-07-12 11:02:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:42,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130723988] [2022-07-12 11:02:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:02:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:02:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:02:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:02:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:02:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-12 11:02:43,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:43,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130723988] [2022-07-12 11:02:43,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130723988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:43,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:43,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:02:43,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024460323] [2022-07-12 11:02:43,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:43,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:02:43,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:43,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:02:43,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:02:43,010 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 11:02:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:43,339 INFO L93 Difference]: Finished difference Result 183 states and 222 transitions. [2022-07-12 11:02:43,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:02:43,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2022-07-12 11:02:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:43,345 INFO L225 Difference]: With dead ends: 183 [2022-07-12 11:02:43,345 INFO L226 Difference]: Without dead ends: 118 [2022-07-12 11:02:43,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:02:43,346 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 55 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:43,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 227 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:02:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-12 11:02:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2022-07-12 11:02:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 79 states have internal predecessors, (86), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (27), 25 states have call predecessors, (27), 25 states have call successors, (27) [2022-07-12 11:02:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2022-07-12 11:02:43,357 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 91 [2022-07-12 11:02:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:43,357 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2022-07-12 11:02:43,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 11:02:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2022-07-12 11:02:43,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-12 11:02:43,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:43,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 11:02:43,360 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:43,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:43,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2058076652, now seen corresponding path program 1 times [2022-07-12 11:02:43,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:43,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037760443] [2022-07-12 11:02:43,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:43,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:43,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:43,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:43,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:43,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:43,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:43,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:02:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:43,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:43,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:02:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:43,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:02:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:43,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:43,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:43,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:02:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:43,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:02:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-12 11:02:43,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:43,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037760443] [2022-07-12 11:02:43,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037760443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:43,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:43,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 11:02:43,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075511767] [2022-07-12 11:02:43,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:43,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:02:43,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:43,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:02:43,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:02:43,784 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 11:02:44,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:44,597 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2022-07-12 11:02:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 11:02:44,601 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2022-07-12 11:02:44,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:44,602 INFO L225 Difference]: With dead ends: 131 [2022-07-12 11:02:44,602 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 11:02:44,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-07-12 11:02:44,603 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 85 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:44,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 605 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 11:02:44,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 11:02:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2022-07-12 11:02:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 78 states have (on average 1.1153846153846154) internal successors, (87), 80 states have internal predecessors, (87), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-07-12 11:02:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2022-07-12 11:02:44,612 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 93 [2022-07-12 11:02:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:44,612 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2022-07-12 11:02:44,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 11:02:44,613 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2022-07-12 11:02:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 11:02:44,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:44,614 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:44,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 11:02:44,614 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:44,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1315799824, now seen corresponding path program 1 times [2022-07-12 11:02:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:44,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556703889] [2022-07-12 11:02:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:44,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:45,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:45,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:02:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:45,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:45,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:02:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:45,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:02:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:45,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:45,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:45,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:02:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:45,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:02:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:45,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:02:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:45,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:02:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 11:02:45,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:45,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556703889] [2022-07-12 11:02:45,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556703889] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:45,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976205549] [2022-07-12 11:02:45,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:45,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:45,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:45,118 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:02:45,146 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:02:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:45,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 2703 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-12 11:02:45,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:45,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:02:47,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:47,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2022-07-12 11:02:47,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-07-12 11:02:49,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:49,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:49,680 INFO L356 Elim1Store]: treesize reduction 120, result has 17.2 percent of original size [2022-07-12 11:02:49,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 16 case distinctions, treesize of input 139 treesize of output 104 [2022-07-12 11:02:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 11:02:49,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:03:05,904 WARN L233 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 41 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:03:12,175 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:03:18,368 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:03:24,630 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:03:24,646 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:03:24,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 90 [2022-07-12 11:03:25,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976205549] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:25,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:03:25,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 36] total 46 [2022-07-12 11:03:25,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008913815] [2022-07-12 11:03:25,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:03:25,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 11:03:25,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:25,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 11:03:25,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3574, Unknown=0, NotChecked=0, Total=3782 [2022-07-12 11:03:25,028 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand has 46 states, 39 states have (on average 2.717948717948718) internal successors, (106), 34 states have internal predecessors, (106), 16 states have call successors, (32), 8 states have call predecessors, (32), 12 states have return successors, (30), 16 states have call predecessors, (30), 15 states have call successors, (30) [2022-07-12 11:03:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:26,062 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2022-07-12 11:03:26,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 11:03:26,063 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 39 states have (on average 2.717948717948718) internal successors, (106), 34 states have internal predecessors, (106), 16 states have call successors, (32), 8 states have call predecessors, (32), 12 states have return successors, (30), 16 states have call predecessors, (30), 15 states have call successors, (30) Word has length 103 [2022-07-12 11:03:26,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:26,063 INFO L225 Difference]: With dead ends: 124 [2022-07-12 11:03:26,064 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 11:03:26,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=295, Invalid=5107, Unknown=0, NotChecked=0, Total=5402 [2022-07-12 11:03:26,067 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:26,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 355 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 559 Invalid, 0 Unknown, 133 Unchecked, 0.5s Time] [2022-07-12 11:03:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 11:03:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 11:03:26,068 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:03:26,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 11:03:26,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2022-07-12 11:03:26,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:26,069 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 11:03:26,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 39 states have (on average 2.717948717948718) internal successors, (106), 34 states have internal predecessors, (106), 16 states have call successors, (32), 8 states have call predecessors, (32), 12 states have return successors, (30), 16 states have call predecessors, (30), 15 states have call successors, (30) [2022-07-12 11:03:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 11:03:26,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 11:03:26,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 11:03:26,103 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:03:26,287 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,SelfDestructingSolverStorable6 [2022-07-12 11:03:26,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 11:03:26,433 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (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|) 0)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (< |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| |#StackHeapBarrier|) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (< |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| |#StackHeapBarrier|) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 0)) [2022-07-12 11:03:26,433 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-07-12 11:03:26,433 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (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|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (< |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| |#StackHeapBarrier|)) [2022-07-12 11:03:26,433 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-07-12 11:03:26,433 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (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|) (= |#memory_int| |old(#memory_int)|) (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|) 0)) (= |#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|))) [2022-07-12 11:03:26,433 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-07-12 11:03:26,433 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (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|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (< |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| |#StackHeapBarrier|)) [2022-07-12 11:03:26,433 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-07-12 11:03:26,433 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (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|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-12 11:03:26,434 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (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|)) [2022-07-12 11:03:26,434 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-07-12 11:03:26,434 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-07-12 11:03:26,434 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (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|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-12 11:03:26,434 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-12 11:03:26,434 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-07-12 11:03:26,434 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-12 11:03:26,434 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-12 11:03:26,434 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-12 11:03:26,434 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-12 11:03:26,434 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-12 11:03:26,434 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-12 11:03:26,434 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-12 11:03:26,434 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-12 11:03:26,435 INFO L902 garLoopResultBuilder]: At program point aws_string_bytesENTRY(lines 6242 6246) the Hoare annotation is: true [2022-07-12 11:03:26,435 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesEXIT(lines 6242 6246) no Hoare annotation was computed. [2022-07-12 11:03:26,435 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesFINAL(lines 6242 6246) no Hoare annotation was computed. [2022-07-12 11:03:26,435 INFO L902 garLoopResultBuilder]: At program point L6244-1(line 6244) the Hoare annotation is: true [2022-07-12 11:03:26,435 INFO L899 garLoopResultBuilder]: For program point L6244-2(line 6244) no Hoare annotation was computed. [2022-07-12 11:03:26,435 INFO L902 garLoopResultBuilder]: At program point L6244(line 6244) the Hoare annotation is: true [2022-07-12 11:03:26,435 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-12 11:03:26,435 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-12 11:03:26,435 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-12 11:03:26,435 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-12 11:03:26,435 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-07-12 11:03:26,435 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-07-12 11:03:26,435 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-07-12 11:03:26,435 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-07-12 11:03:26,435 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-07-12 11:03:26,435 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-12 11:03:26,436 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-07-12 11:03:26,436 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-07-12 11:03:26,436 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-07-12 11:03:26,436 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-07-12 11:03:26,436 INFO L902 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7368 7372) the Hoare annotation is: true [2022-07-12 11:03:26,437 INFO L899 garLoopResultBuilder]: For program point L7371(line 7371) no Hoare annotation was computed. [2022-07-12 11:03:26,437 INFO L899 garLoopResultBuilder]: For program point L7371-5(line 7371) no Hoare annotation was computed. [2022-07-12 11:03:26,437 INFO L899 garLoopResultBuilder]: For program point L7371-4(line 7371) no Hoare annotation was computed. [2022-07-12 11:03:26,437 INFO L899 garLoopResultBuilder]: For program point L7371-2(line 7371) no Hoare annotation was computed. [2022-07-12 11:03:26,437 INFO L899 garLoopResultBuilder]: For program point L7371-8(line 7371) no Hoare annotation was computed. [2022-07-12 11:03:26,438 INFO L899 garLoopResultBuilder]: For program point L7371-6(line 7371) no Hoare annotation was computed. [2022-07-12 11:03:26,439 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7368 7372) no Hoare annotation was computed. [2022-07-12 11:03:26,439 INFO L899 garLoopResultBuilder]: For program point L7371-11(line 7371) no Hoare annotation was computed. [2022-07-12 11:03:26,439 INFO L899 garLoopResultBuilder]: For program point L7371-10(line 7371) no Hoare annotation was computed. [2022-07-12 11:03:26,439 INFO L899 garLoopResultBuilder]: For program point L7370(lines 7370 7371) no Hoare annotation was computed. [2022-07-12 11:03:26,439 INFO L899 garLoopResultBuilder]: For program point L7370-2(lines 7370 7371) no Hoare annotation was computed. [2022-07-12 11:03:26,439 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7368 7372) no Hoare annotation was computed. [2022-07-12 11:03:26,439 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-12 11:03:26,440 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-12 11:03:26,440 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-12 11:03:26,440 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 11:03:26,440 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-12 11:03:26,440 INFO L899 garLoopResultBuilder]: For program point L9538-1(line 9538) no Hoare annotation was computed. [2022-07-12 11:03:26,441 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-12 11:03:26,441 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-07-12 11:03:26,441 INFO L899 garLoopResultBuilder]: For program point L9518-1(line 9518) no Hoare annotation was computed. [2022-07-12 11:03:26,441 INFO L899 garLoopResultBuilder]: For program point L8240-2(line 8240) no Hoare annotation was computed. [2022-07-12 11:03:26,441 INFO L895 garLoopResultBuilder]: At program point L8240-1(line 8240) the Hoare annotation is: false [2022-07-12 11:03:26,441 INFO L895 garLoopResultBuilder]: At program point L9518-2(lines 9516 9519) the Hoare annotation is: false [2022-07-12 11:03:26,441 INFO L895 garLoopResultBuilder]: At program point L8240(line 8240) the Hoare annotation is: false [2022-07-12 11:03:26,442 INFO L899 garLoopResultBuilder]: For program point L8236-1(line 8236) no Hoare annotation was computed. [2022-07-12 11:03:26,442 INFO L895 garLoopResultBuilder]: At program point L8236(line 8236) the Hoare annotation is: false [2022-07-12 11:03:26,442 INFO L895 garLoopResultBuilder]: At program point L9518(line 9518) the Hoare annotation is: false [2022-07-12 11:03:26,442 INFO L895 garLoopResultBuilder]: At program point L9541(line 9541) the Hoare annotation is: false [2022-07-12 11:03:26,442 INFO L895 garLoopResultBuilder]: At program point L9541-1(line 9541) the Hoare annotation is: false [2022-07-12 11:03:26,442 INFO L899 garLoopResultBuilder]: For program point L9541-2(line 9541) no Hoare annotation was computed. [2022-07-12 11:03:26,442 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-12 11:03:26,442 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-07-12 11:03:26,443 INFO L895 garLoopResultBuilder]: At program point L9543(line 9543) the Hoare annotation is: false [2022-07-12 11:03:26,443 INFO L899 garLoopResultBuilder]: For program point L9543-1(line 9543) no Hoare annotation was computed. [2022-07-12 11:03:26,443 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 11:03:26,443 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 11:03:26,443 INFO L899 garLoopResultBuilder]: For program point L9537(lines 9537 9545) no Hoare annotation was computed. [2022-07-12 11:03:26,443 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 11:03:26,443 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-12 11:03:26,444 INFO L895 garLoopResultBuilder]: At program point L9517(line 9517) the Hoare annotation is: false [2022-07-12 11:03:26,444 INFO L895 garLoopResultBuilder]: At program point L9517-1(line 9517) the Hoare annotation is: false [2022-07-12 11:03:26,444 INFO L899 garLoopResultBuilder]: For program point L9517-2(line 9517) no Hoare annotation was computed. [2022-07-12 11:03:26,444 INFO L895 garLoopResultBuilder]: At program point L8241(lines 8235 8242) the Hoare annotation is: false [2022-07-12 11:03:26,444 INFO L902 garLoopResultBuilder]: At program point L9546(line 9546) the Hoare annotation is: true [2022-07-12 11:03:26,446 INFO L899 garLoopResultBuilder]: For program point L9542-1(line 9542) no Hoare annotation was computed. [2022-07-12 11:03:26,446 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-07-12 11:03:26,446 INFO L895 garLoopResultBuilder]: At program point L9540(line 9540) the Hoare annotation is: false [2022-07-12 11:03:26,446 INFO L895 garLoopResultBuilder]: At program point L9540-1(line 9540) the Hoare annotation is: false [2022-07-12 11:03:26,446 INFO L902 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: true [2022-07-12 11:03:26,446 INFO L899 garLoopResultBuilder]: For program point L9540-2(line 9540) no Hoare annotation was computed. [2022-07-12 11:03:26,446 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-07-12 11:03:26,447 INFO L895 garLoopResultBuilder]: At program point L9542(line 9542) the Hoare annotation is: false [2022-07-12 11:03:26,447 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-12 11:03:26,447 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-12 11:03:26,447 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-12 11:03:26,447 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-12 11:03:26,447 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-12 11:03:26,447 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-12 11:03:26,448 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-12 11:03:26,451 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:26,453 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 11:03:26,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 11:03:26 BoogieIcfgContainer [2022-07-12 11:03:26,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 11:03:26,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 11:03:26,464 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 11:03:26,465 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 11:03:26,465 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:02:37" (3/4) ... [2022-07-12 11:03:26,468 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 11:03:26,473 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-07-12 11:03:26,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-12 11:03:26,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2022-07-12 11:03:26,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-12 11:03:26,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-12 11:03:26,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_bytes [2022-07-12 11:03:26,476 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-12 11:03:26,476 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-12 11:03:26,476 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-12 11:03:26,476 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-12 11:03:26,497 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 127 nodes and edges [2022-07-12 11:03:26,498 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2022-07-12 11:03:26,499 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-07-12 11:03:26,500 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-12 11:03:26,502 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-12 11:03:26,503 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-12 11:03:26,504 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 11:03:26,505 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 11:03:26,542 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(str == 0) && str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && \result < unknown-#StackHeapBarrier-unknown) && !(\old(max_size) == 16)) && str < unknown-#StackHeapBarrier-unknown) && \result == 0 [2022-07-12 11:03:27,012 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 11:03:27,013 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 11:03:27,013 INFO L158 Benchmark]: Toolchain (without parser) took 53785.69ms. Allocated memory was 96.5MB in the beginning and 413.1MB in the end (delta: 316.7MB). Free memory was 55.5MB in the beginning and 122.2MB in the end (delta: -66.6MB). Peak memory consumption was 250.8MB. Max. memory is 16.1GB. [2022-07-12 11:03:27,013 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 75.5MB. Free memory was 46.1MB in the beginning and 46.0MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:03:27,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2285.99ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 55.3MB in the beginning and 60.8MB in the end (delta: -5.5MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2022-07-12 11:03:27,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 178.99ms. Allocated memory is still 117.4MB. Free memory was 60.8MB in the beginning and 48.8MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 11:03:27,014 INFO L158 Benchmark]: Boogie Preprocessor took 113.34ms. Allocated memory is still 117.4MB. Free memory was 48.8MB in the beginning and 41.9MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 11:03:27,015 INFO L158 Benchmark]: RCFGBuilder took 1418.48ms. Allocated memory was 117.4MB in the beginning and 163.6MB in the end (delta: 46.1MB). Free memory was 41.9MB in the beginning and 72.6MB in the end (delta: -30.6MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2022-07-12 11:03:27,015 INFO L158 Benchmark]: TraceAbstraction took 49234.00ms. Allocated memory was 163.6MB in the beginning and 413.1MB in the end (delta: 249.6MB). Free memory was 72.6MB in the beginning and 253.2MB in the end (delta: -180.7MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2022-07-12 11:03:27,015 INFO L158 Benchmark]: Witness Printer took 548.46ms. Allocated memory is still 413.1MB. Free memory was 253.2MB in the beginning and 122.2MB in the end (delta: 131.1MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2022-07-12 11:03:27,016 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 75.5MB. Free memory was 46.1MB in the beginning and 46.0MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2285.99ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 55.3MB in the beginning and 60.8MB in the end (delta: -5.5MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 178.99ms. Allocated memory is still 117.4MB. Free memory was 60.8MB in the beginning and 48.8MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.34ms. Allocated memory is still 117.4MB. Free memory was 48.8MB in the beginning and 41.9MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1418.48ms. Allocated memory was 117.4MB in the beginning and 163.6MB in the end (delta: 46.1MB). Free memory was 41.9MB in the beginning and 72.6MB in the end (delta: -30.6MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * TraceAbstraction took 49234.00ms. Allocated memory was 163.6MB in the beginning and 413.1MB in the end (delta: 249.6MB). Free memory was 72.6MB in the beginning and 253.2MB in the end (delta: -180.7MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. * Witness Printer took 548.46ms. Allocated memory is still 413.1MB. Free memory was 253.2MB in the beginning and 122.2MB in the end (delta: 131.1MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * 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, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.1s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 564 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 533 mSDsluCounter, 3559 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 217 IncrementalHoareTripleChecker+Unchecked, 2892 mSDsCounter, 266 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2490 IncrementalHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 266 mSolverCounterUnsat, 667 mSDtfsCounter, 2490 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 506 GetRequests, 343 SyntacticMatches, 4 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 38.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=4, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 112 PreInvPairs, 117 NumberOfFragments, 277 HoareAnnotationTreeSize, 112 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 39 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 42.7s InterpolantComputationTime, 829 NumberOfCodeBlocks, 829 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 820 ConstructedInterpolants, 55 QuantifiedInterpolants, 6028 SizeOfPredicates, 52 NumberOfNonLiveVariables, 5361 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 398/455 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: 9516]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 8235]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: ((((((!(str == 0) && str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && \result < unknown-#StackHeapBarrier-unknown) && !(\old(max_size) == 16)) && str < unknown-#StackHeapBarrier-unknown) && \result == 0 - InvariantResult [Line: 9546]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-12 11:03:27,106 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