./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 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_buf_from_array_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 bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 19:32:41,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 19:32:41,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 19:32:41,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 19:32:41,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 19:32:41,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 19:32:41,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 19:32:41,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 19:32:41,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 19:32:41,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 19:32:41,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 19:32:41,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 19:32:41,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 19:32:41,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 19:32:41,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 19:32:41,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 19:32:41,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 19:32:41,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 19:32:41,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 19:32:41,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 19:32:41,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 19:32:41,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 19:32:41,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 19:32:41,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 19:32:41,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 19:32:41,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 19:32:41,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 19:32:41,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 19:32:41,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 19:32:41,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 19:32:41,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 19:32:41,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 19:32:41,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 19:32:41,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 19:32:41,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 19:32:41,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 19:32:41,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 19:32:41,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 19:32:41,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 19:32:41,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 19:32:41,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 19:32:41,581 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 19:32:41,610 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 19:32:41,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 19:32:41,611 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 19:32:41,612 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 19:32:41,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 19:32:41,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 19:32:41,613 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 19:32:41,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 19:32:41,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 19:32:41,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 19:32:41,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 19:32:41,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 19:32:41,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 19:32:41,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 19:32:41,615 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 19:32:41,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 19:32:41,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 19:32:41,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 19:32:41,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 19:32:41,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:32:41,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 19:32:41,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 19:32:41,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 19:32:41,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 19:32:41,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 19:32:41,617 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 19:32:41,617 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 19:32:41,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 19:32:41,618 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 19:32:41,618 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 -> bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c [2021-11-22 19:32:41,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 19:32:41,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 19:32:41,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 19:32:41,876 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 19:32:41,877 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 19:32:41,877 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2021-11-22 19:32:41,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14eedef96/1acc2bbc5fc04065902a6fdfabd7d4b6/FLAG2c5b06a8e [2021-11-22 19:32:42,604 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 19:32:42,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2021-11-22 19:32:42,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14eedef96/1acc2bbc5fc04065902a6fdfabd7d4b6/FLAG2c5b06a8e [2021-11-22 19:32:42,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14eedef96/1acc2bbc5fc04065902a6fdfabd7d4b6 [2021-11-22 19:32:42,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 19:32:42,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 19:32:42,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 19:32:42,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 19:32:42,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 19:32:42,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:32:42" (1/1) ... [2021-11-22 19:32:42,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633632dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:42, skipping insertion in model container [2021-11-22 19:32:42,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:32:42" (1/1) ... [2021-11-22 19:32:42,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 19:32:42,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 19:32:43,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_buf_from_array_harness.i[4497,4510] [2021-11-22 19:32:43,068 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_buf_from_array_harness.i[4557,4570] [2021-11-22 19:32:43,681 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:43,682 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:43,682 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:43,683 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:43,683 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:43,694 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:43,700 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:43,701 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:43,702 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:43,948 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:32:43,954 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:32:43,955 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:32:43,956 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:32:43,959 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:32:43,960 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:32:43,964 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:32:43,965 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:32:43,965 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:32:43,968 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:32:44,064 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:32:44,134 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:44,134 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:44,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:32:44,240 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 19:32:44,251 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_buf_from_array_harness.i[4497,4510] [2021-11-22 19:32:44,252 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_buf_from_array_harness.i[4557,4570] [2021-11-22 19:32:44,275 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:44,276 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:44,276 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:44,277 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:44,277 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:44,282 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:44,283 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:44,283 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:44,284 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:44,324 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:32:44,326 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:32:44,326 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:32:44,327 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:32:44,327 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:32:44,328 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:32:44,330 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:32:44,330 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:32:44,331 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:32:44,332 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:32:44,365 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:32:44,413 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:44,416 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:44,459 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:32:44,688 INFO L208 MainTranslator]: Completed translation [2021-11-22 19:32:44,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:44 WrapperNode [2021-11-22 19:32:44,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 19:32:44,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 19:32:44,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 19:32:44,690 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 19:32:44,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:44" (1/1) ... [2021-11-22 19:32:44,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:44" (1/1) ... [2021-11-22 19:32:44,879 INFO L137 Inliner]: procedures = 690, calls = 2615, calls flagged for inlining = 946, calls inlined = 19, statements flattened = 935 [2021-11-22 19:32:44,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 19:32:44,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 19:32:44,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 19:32:44,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 19:32:44,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:44" (1/1) ... [2021-11-22 19:32:44,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:44" (1/1) ... [2021-11-22 19:32:44,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:44" (1/1) ... [2021-11-22 19:32:44,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:44" (1/1) ... [2021-11-22 19:32:44,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:44" (1/1) ... [2021-11-22 19:32:44,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:44" (1/1) ... [2021-11-22 19:32:44,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:44" (1/1) ... [2021-11-22 19:32:44,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 19:32:44,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 19:32:44,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 19:32:44,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 19:32:44,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:44" (1/1) ... [2021-11-22 19:32:44,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:32:44,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:32:45,008 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) [2021-11-22 19:32:45,019 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 [2021-11-22 19:32:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 19:32:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 19:32:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 19:32:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 19:32:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 19:32:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 19:32:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 19:32:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 19:32:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 19:32:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 19:32:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 19:32:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 19:32:45,268 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 19:32:45,269 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 19:32:46,176 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 19:32:46,181 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 19:32:46,182 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-22 19:32:46,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:32:46 BoogieIcfgContainer [2021-11-22 19:32:46,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 19:32:46,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 19:32:46,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 19:32:46,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 19:32:46,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:32:42" (1/3) ... [2021-11-22 19:32:46,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbeef89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:32:46, skipping insertion in model container [2021-11-22 19:32:46,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:44" (2/3) ... [2021-11-22 19:32:46,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbeef89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:32:46, skipping insertion in model container [2021-11-22 19:32:46,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:32:46" (3/3) ... [2021-11-22 19:32:46,190 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_array_harness.i [2021-11-22 19:32:46,194 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 19:32:46,195 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-11-22 19:32:46,232 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 19:32:46,241 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 19:32:46,242 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-22 19:32:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 78 states have internal predecessors, (105), 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) [2021-11-22 19:32:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 19:32:46,286 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:46,286 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:46,287 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:46,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:46,292 INFO L85 PathProgramCache]: Analyzing trace with hash 810375617, now seen corresponding path program 1 times [2021-11-22 19:32:46,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:46,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172804482] [2021-11-22 19:32:46,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:46,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:46,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:46,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172804482] [2021-11-22 19:32:46,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172804482] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:46,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:46,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 19:32:46,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611835487] [2021-11-22 19:32:46,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:46,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 19:32:46,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:46,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 19:32:46,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:32:46,817 INFO L87 Difference]: Start difference. First operand has 79 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 78 states have internal predecessors, (105), 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2021-11-22 19:32:46,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:46,838 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2021-11-22 19:32:46,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 19:32:46,841 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) Word has length 14 [2021-11-22 19:32:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:46,849 INFO L225 Difference]: With dead ends: 155 [2021-11-22 19:32:46,849 INFO L226 Difference]: Without dead ends: 72 [2021-11-22 19:32:46,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:32:46,859 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:46,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:32:46,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-22 19:32:46,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-11-22 19:32:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.323076923076923) internal successors, (86), 71 states have internal predecessors, (86), 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) [2021-11-22 19:32:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2021-11-22 19:32:46,888 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 14 [2021-11-22 19:32:46,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:46,888 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2021-11-22 19:32:46,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2021-11-22 19:32:46,888 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2021-11-22 19:32:46,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 19:32:46,889 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:46,889 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:46,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 19:32:46,890 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:46,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:46,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1068541055, now seen corresponding path program 1 times [2021-11-22 19:32:46,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:46,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001475142] [2021-11-22 19:32:46,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:46,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:47,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:47,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001475142] [2021-11-22 19:32:47,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001475142] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:47,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:47,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:32:47,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700616803] [2021-11-22 19:32:47,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:47,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:32:47,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:47,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:32:47,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:32:47,143 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2021-11-22 19:32:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:47,195 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2021-11-22 19:32:47,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:32:47,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 14 [2021-11-22 19:32:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:47,197 INFO L225 Difference]: With dead ends: 122 [2021-11-22 19:32:47,197 INFO L226 Difference]: Without dead ends: 72 [2021-11-22 19:32:47,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:32:47,198 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 61 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:47,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 178 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:32:47,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-22 19:32:47,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-11-22 19:32:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 71 states have internal predecessors, (85), 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) [2021-11-22 19:32:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2021-11-22 19:32:47,208 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 14 [2021-11-22 19:32:47,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:47,208 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2021-11-22 19:32:47,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2021-11-22 19:32:47,209 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2021-11-22 19:32:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-22 19:32:47,209 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:47,210 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:47,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 19:32:47,210 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash -715146382, now seen corresponding path program 1 times [2021-11-22 19:32:47,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:47,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275272346] [2021-11-22 19:32:47,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:47,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:47,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:47,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275272346] [2021-11-22 19:32:47,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275272346] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:47,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:47,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:32:47,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894697825] [2021-11-22 19:32:47,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:47,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:32:47,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:47,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:32:47,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:32:47,405 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-11-22 19:32:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:47,481 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2021-11-22 19:32:47,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:32:47,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 20 [2021-11-22 19:32:47,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:47,482 INFO L225 Difference]: With dead ends: 175 [2021-11-22 19:32:47,483 INFO L226 Difference]: Without dead ends: 116 [2021-11-22 19:32:47,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:32:47,484 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 70 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:47,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 278 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:32:47,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-22 19:32:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 76. [2021-11-22 19:32:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.289855072463768) internal successors, (89), 75 states have internal predecessors, (89), 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) [2021-11-22 19:32:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2021-11-22 19:32:47,492 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 20 [2021-11-22 19:32:47,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:47,492 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2021-11-22 19:32:47,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-11-22 19:32:47,493 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2021-11-22 19:32:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-22 19:32:47,493 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:47,494 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:47,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 19:32:47,494 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:47,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:47,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1524493008, now seen corresponding path program 1 times [2021-11-22 19:32:47,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:47,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252603805] [2021-11-22 19:32:47,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:47,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:47,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:47,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:47,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252603805] [2021-11-22 19:32:47,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252603805] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:47,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:47,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:32:47,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299136146] [2021-11-22 19:32:47,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:47,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:32:47,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:47,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:32:47,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:32:47,726 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-11-22 19:32:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:47,807 INFO L93 Difference]: Finished difference Result 149 states and 176 transitions. [2021-11-22 19:32:47,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:32:47,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 20 [2021-11-22 19:32:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:47,810 INFO L225 Difference]: With dead ends: 149 [2021-11-22 19:32:47,810 INFO L226 Difference]: Without dead ends: 96 [2021-11-22 19:32:47,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:32:47,813 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 49 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:47,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 224 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-11-22 19:32:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 80. [2021-11-22 19:32:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.273972602739726) internal successors, (93), 79 states have internal predecessors, (93), 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) [2021-11-22 19:32:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2021-11-22 19:32:47,834 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 20 [2021-11-22 19:32:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:47,834 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2021-11-22 19:32:47,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-11-22 19:32:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2021-11-22 19:32:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-22 19:32:47,836 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:47,836 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:47,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 19:32:47,839 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:47,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:47,841 INFO L85 PathProgramCache]: Analyzing trace with hash -322119372, now seen corresponding path program 1 times [2021-11-22 19:32:47,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:47,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639389051] [2021-11-22 19:32:47,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:47,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:48,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:48,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639389051] [2021-11-22 19:32:48,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639389051] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:48,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:48,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:32:48,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152141438] [2021-11-22 19:32:48,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:48,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:32:48,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:48,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:32:48,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:32:48,065 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2021-11-22 19:32:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:48,204 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2021-11-22 19:32:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:32:48,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) Word has length 20 [2021-11-22 19:32:48,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:48,206 INFO L225 Difference]: With dead ends: 141 [2021-11-22 19:32:48,206 INFO L226 Difference]: Without dead ends: 137 [2021-11-22 19:32:48,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:32:48,207 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 105 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:48,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 410 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-11-22 19:32:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 88. [2021-11-22 19:32:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 87 states have internal predecessors, (101), 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) [2021-11-22 19:32:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2021-11-22 19:32:48,213 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 20 [2021-11-22 19:32:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:48,213 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2021-11-22 19:32:48,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2021-11-22 19:32:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2021-11-22 19:32:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 19:32:48,214 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:48,214 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:48,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 19:32:48,215 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:48,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2144800216, now seen corresponding path program 1 times [2021-11-22 19:32:48,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:48,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335388203] [2021-11-22 19:32:48,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:48,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:48,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:48,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335388203] [2021-11-22 19:32:48,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335388203] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:48,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:48,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:32:48,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15639782] [2021-11-22 19:32:48,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:48,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:32:48,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:48,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:32:48,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:32:48,701 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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) [2021-11-22 19:32:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:48,927 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2021-11-22 19:32:48,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:32:48,928 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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) Word has length 24 [2021-11-22 19:32:48,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:48,929 INFO L225 Difference]: With dead ends: 155 [2021-11-22 19:32:48,929 INFO L226 Difference]: Without dead ends: 95 [2021-11-22 19:32:48,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:32:48,930 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 159 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:48,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 334 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-22 19:32:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2021-11-22 19:32:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 89 states have internal predecessors, (103), 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) [2021-11-22 19:32:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2021-11-22 19:32:48,935 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 24 [2021-11-22 19:32:48,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:48,935 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2021-11-22 19:32:48,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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) [2021-11-22 19:32:48,935 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2021-11-22 19:32:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 19:32:48,936 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:48,936 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:48,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 19:32:48,936 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:48,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1464741846, now seen corresponding path program 1 times [2021-11-22 19:32:48,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:48,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941724486] [2021-11-22 19:32:48,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:48,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:49,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:49,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:49,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941724486] [2021-11-22 19:32:49,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941724486] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:49,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:49,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:32:49,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816526159] [2021-11-22 19:32:49,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:49,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:32:49,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:49,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:32:49,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:32:49,088 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) [2021-11-22 19:32:49,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:49,260 INFO L93 Difference]: Finished difference Result 209 states and 234 transitions. [2021-11-22 19:32:49,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:32:49,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 24 [2021-11-22 19:32:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:49,261 INFO L225 Difference]: With dead ends: 209 [2021-11-22 19:32:49,261 INFO L226 Difference]: Without dead ends: 145 [2021-11-22 19:32:49,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:32:49,263 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 115 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:49,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 280 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:32:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-11-22 19:32:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2021-11-22 19:32:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 95 states have internal predecessors, (109), 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) [2021-11-22 19:32:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2021-11-22 19:32:49,276 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 24 [2021-11-22 19:32:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:49,276 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2021-11-22 19:32:49,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) [2021-11-22 19:32:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2021-11-22 19:32:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 19:32:49,278 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:49,278 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:49,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 19:32:49,278 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:49,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash -711790034, now seen corresponding path program 1 times [2021-11-22 19:32:49,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:49,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21310991] [2021-11-22 19:32:49,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:49,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:49,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:49,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21310991] [2021-11-22 19:32:49,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21310991] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:49,521 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:49,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:32:49,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240388364] [2021-11-22 19:32:49,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:49,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:32:49,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:49,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:32:49,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:32:49,523 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) [2021-11-22 19:32:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:49,863 INFO L93 Difference]: Finished difference Result 301 states and 349 transitions. [2021-11-22 19:32:49,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:32:49,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) Word has length 24 [2021-11-22 19:32:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:49,865 INFO L225 Difference]: With dead ends: 301 [2021-11-22 19:32:49,865 INFO L226 Difference]: Without dead ends: 225 [2021-11-22 19:32:49,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:32:49,866 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 291 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:49,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 666 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:32:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-11-22 19:32:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 101. [2021-11-22 19:32:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 100 states have internal predecessors, (115), 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) [2021-11-22 19:32:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2021-11-22 19:32:49,870 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 24 [2021-11-22 19:32:49,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:49,871 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2021-11-22 19:32:49,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) [2021-11-22 19:32:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2021-11-22 19:32:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 19:32:49,871 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:49,872 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:49,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 19:32:49,872 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:49,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash -453624596, now seen corresponding path program 1 times [2021-11-22 19:32:49,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:49,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820851301] [2021-11-22 19:32:49,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:49,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:50,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:50,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:50,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820851301] [2021-11-22 19:32:50,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820851301] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:50,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:50,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:32:50,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976981985] [2021-11-22 19:32:50,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:50,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:32:50,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:50,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:32:50,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:32:50,213 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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) [2021-11-22 19:32:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:50,549 INFO L93 Difference]: Finished difference Result 191 states and 215 transitions. [2021-11-22 19:32:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:32:50,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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) Word has length 24 [2021-11-22 19:32:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:50,550 INFO L225 Difference]: With dead ends: 191 [2021-11-22 19:32:50,550 INFO L226 Difference]: Without dead ends: 117 [2021-11-22 19:32:50,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:32:50,551 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 238 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:50,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 344 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:32:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-22 19:32:50,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2021-11-22 19:32:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 98 states have internal predecessors, (112), 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) [2021-11-22 19:32:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2021-11-22 19:32:50,555 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 24 [2021-11-22 19:32:50,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:50,556 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2021-11-22 19:32:50,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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) [2021-11-22 19:32:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2021-11-22 19:32:50,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 19:32:50,557 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:50,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:50,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 19:32:50,557 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:50,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:50,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1994829360, now seen corresponding path program 1 times [2021-11-22 19:32:50,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:50,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571093341] [2021-11-22 19:32:50,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:50,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:50,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:50,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571093341] [2021-11-22 19:32:50,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571093341] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:50,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:50,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:32:50,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153298208] [2021-11-22 19:32:50,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:50,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:32:50,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:50,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:32:50,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:32:50,825 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) [2021-11-22 19:32:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:51,046 INFO L93 Difference]: Finished difference Result 187 states and 210 transitions. [2021-11-22 19:32:51,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:32:51,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) Word has length 24 [2021-11-22 19:32:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:51,047 INFO L225 Difference]: With dead ends: 187 [2021-11-22 19:32:51,047 INFO L226 Difference]: Without dead ends: 117 [2021-11-22 19:32:51,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:32:51,048 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 64 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:51,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 354 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:32:51,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-22 19:32:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2021-11-22 19:32:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 98 states have internal predecessors, (111), 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) [2021-11-22 19:32:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-11-22 19:32:51,052 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 24 [2021-11-22 19:32:51,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:51,052 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-11-22 19:32:51,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) [2021-11-22 19:32:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-11-22 19:32:51,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 19:32:51,053 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:51,053 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:51,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 19:32:51,054 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:51,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2041972498, now seen corresponding path program 1 times [2021-11-22 19:32:51,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:51,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102913440] [2021-11-22 19:32:51,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:51,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:51,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:51,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102913440] [2021-11-22 19:32:51,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102913440] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:51,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:51,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:32:51,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143855627] [2021-11-22 19:32:51,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:51,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:32:51,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:51,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:32:51,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:32:51,212 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) [2021-11-22 19:32:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:51,429 INFO L93 Difference]: Finished difference Result 238 states and 264 transitions. [2021-11-22 19:32:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:32:51,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) Word has length 24 [2021-11-22 19:32:51,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:51,430 INFO L225 Difference]: With dead ends: 238 [2021-11-22 19:32:51,430 INFO L226 Difference]: Without dead ends: 166 [2021-11-22 19:32:51,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:32:51,431 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 234 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:51,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 363 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:32:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-22 19:32:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 94. [2021-11-22 19:32:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 93 states have internal predecessors, (103), 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) [2021-11-22 19:32:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2021-11-22 19:32:51,434 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 24 [2021-11-22 19:32:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:51,434 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-11-22 19:32:51,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) [2021-11-22 19:32:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2021-11-22 19:32:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 19:32:51,435 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:51,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:51,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 19:32:51,435 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:51,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1548380899, now seen corresponding path program 1 times [2021-11-22 19:32:51,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:51,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086228971] [2021-11-22 19:32:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:51,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:51,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:51,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:51,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086228971] [2021-11-22 19:32:51,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086228971] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:51,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:51,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:32:51,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835692316] [2021-11-22 19:32:51,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:51,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:32:51,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:51,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:32:51,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:32:51,625 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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) [2021-11-22 19:32:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:51,871 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2021-11-22 19:32:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:32:51,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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) Word has length 26 [2021-11-22 19:32:51,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:51,873 INFO L225 Difference]: With dead ends: 167 [2021-11-22 19:32:51,873 INFO L226 Difference]: Without dead ends: 163 [2021-11-22 19:32:51,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:32:51,874 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 116 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:51,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 568 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:51,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-11-22 19:32:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 98. [2021-11-22 19:32:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 97 states have internal predecessors, (107), 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) [2021-11-22 19:32:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2021-11-22 19:32:51,878 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 26 [2021-11-22 19:32:51,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:51,878 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2021-11-22 19:32:51,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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) [2021-11-22 19:32:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2021-11-22 19:32:51,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 19:32:51,879 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:51,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:51,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 19:32:51,883 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:51,883 INFO L85 PathProgramCache]: Analyzing trace with hash 739034273, now seen corresponding path program 1 times [2021-11-22 19:32:51,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:51,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213302334] [2021-11-22 19:32:51,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:51,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:52,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:52,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213302334] [2021-11-22 19:32:52,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213302334] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:52,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:52,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:32:52,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440310515] [2021-11-22 19:32:52,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:52,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:32:52,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:52,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:32:52,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:32:52,201 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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) [2021-11-22 19:32:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:52,929 INFO L93 Difference]: Finished difference Result 182 states and 198 transitions. [2021-11-22 19:32:52,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-22 19:32:52,930 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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) Word has length 26 [2021-11-22 19:32:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:52,931 INFO L225 Difference]: With dead ends: 182 [2021-11-22 19:32:52,931 INFO L226 Difference]: Without dead ends: 180 [2021-11-22 19:32:52,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=389, Invalid=1503, Unknown=0, NotChecked=0, Total=1892 [2021-11-22 19:32:52,933 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 364 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:52,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 764 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:32:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-11-22 19:32:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 106. [2021-11-22 19:32:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 105 states have internal predecessors, (116), 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) [2021-11-22 19:32:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2021-11-22 19:32:52,938 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 26 [2021-11-22 19:32:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:52,938 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2021-11-22 19:32:52,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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) [2021-11-22 19:32:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2021-11-22 19:32:52,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 19:32:52,938 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:52,939 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:52,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 19:32:52,939 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:52,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash -949909469, now seen corresponding path program 1 times [2021-11-22 19:32:52,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:52,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041903828] [2021-11-22 19:32:52,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:52,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:53,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:53,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041903828] [2021-11-22 19:32:53,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041903828] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:53,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:53,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:32:53,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109511230] [2021-11-22 19:32:53,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:53,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:32:53,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:53,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:32:53,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:32:53,130 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2021-11-22 19:32:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:53,305 INFO L93 Difference]: Finished difference Result 238 states and 260 transitions. [2021-11-22 19:32:53,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:32:53,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) Word has length 26 [2021-11-22 19:32:53,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:53,306 INFO L225 Difference]: With dead ends: 238 [2021-11-22 19:32:53,306 INFO L226 Difference]: Without dead ends: 172 [2021-11-22 19:32:53,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:32:53,307 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 230 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:53,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 281 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-11-22 19:32:53,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 98. [2021-11-22 19:32:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 97 states have internal predecessors, (107), 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) [2021-11-22 19:32:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2021-11-22 19:32:53,312 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 26 [2021-11-22 19:32:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:53,312 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2021-11-22 19:32:53,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2021-11-22 19:32:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2021-11-22 19:32:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 19:32:53,313 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:53,313 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:53,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 19:32:53,314 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:53,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:53,314 INFO L85 PathProgramCache]: Analyzing trace with hash -365390039, now seen corresponding path program 1 times [2021-11-22 19:32:53,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:53,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044228295] [2021-11-22 19:32:53,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:53,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:53,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:53,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044228295] [2021-11-22 19:32:53,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044228295] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:53,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:53,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:32:53,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003394612] [2021-11-22 19:32:53,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:53,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:32:53,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:53,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:32:53,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:32:53,428 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2021-11-22 19:32:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:53,455 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2021-11-22 19:32:53,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 19:32:53,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) Word has length 26 [2021-11-22 19:32:53,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:53,456 INFO L225 Difference]: With dead ends: 128 [2021-11-22 19:32:53,456 INFO L226 Difference]: Without dead ends: 98 [2021-11-22 19:32:53,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:32:53,457 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 93 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:53,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 111 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:32:53,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-22 19:32:53,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-11-22 19:32:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 92 states have (on average 1.1521739130434783) internal successors, (106), 97 states have internal predecessors, (106), 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) [2021-11-22 19:32:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-11-22 19:32:53,462 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 26 [2021-11-22 19:32:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:53,462 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-11-22 19:32:53,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2021-11-22 19:32:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2021-11-22 19:32:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 19:32:53,463 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:53,463 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:53,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 19:32:53,464 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:53,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1400671456, now seen corresponding path program 1 times [2021-11-22 19:32:53,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:53,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444784825] [2021-11-22 19:32:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:53,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:53,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:53,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444784825] [2021-11-22 19:32:53,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444784825] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:53,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:53,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:32:53,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564278147] [2021-11-22 19:32:53,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:53,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:32:53,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:53,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:32:53,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:32:53,813 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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) [2021-11-22 19:32:54,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:54,094 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions. [2021-11-22 19:32:54,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:32:54,095 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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) Word has length 34 [2021-11-22 19:32:54,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:54,096 INFO L225 Difference]: With dead ends: 162 [2021-11-22 19:32:54,096 INFO L226 Difference]: Without dead ends: 160 [2021-11-22 19:32:54,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:32:54,096 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 426 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:54,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 380 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:32:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-11-22 19:32:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 137. [2021-11-22 19:32:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 131 states have (on average 1.1603053435114503) internal successors, (152), 136 states have internal predecessors, (152), 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) [2021-11-22 19:32:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2021-11-22 19:32:54,103 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 34 [2021-11-22 19:32:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:54,103 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2021-11-22 19:32:54,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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) [2021-11-22 19:32:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2021-11-22 19:32:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 19:32:54,104 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:54,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:54,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 19:32:54,105 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:54,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:54,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1720376510, now seen corresponding path program 1 times [2021-11-22 19:32:54,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:54,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332574005] [2021-11-22 19:32:54,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:54,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:54,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:54,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332574005] [2021-11-22 19:32:54,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332574005] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:54,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:54,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:32:54,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936509679] [2021-11-22 19:32:54,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:54,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:32:54,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:54,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:32:54,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:32:54,443 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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) [2021-11-22 19:32:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:54,831 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2021-11-22 19:32:54,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:32:54,832 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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) Word has length 36 [2021-11-22 19:32:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:54,833 INFO L225 Difference]: With dead ends: 160 [2021-11-22 19:32:54,833 INFO L226 Difference]: Without dead ends: 158 [2021-11-22 19:32:54,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:32:54,834 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 438 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:54,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 370 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:32:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-11-22 19:32:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 139. [2021-11-22 19:32:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 133 states have (on average 1.1578947368421053) internal successors, (154), 138 states have internal predecessors, (154), 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) [2021-11-22 19:32:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2021-11-22 19:32:54,841 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 36 [2021-11-22 19:32:54,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:54,842 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2021-11-22 19:32:54,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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) [2021-11-22 19:32:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2021-11-22 19:32:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 19:32:54,842 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:54,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:54,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 19:32:54,843 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:54,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:54,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1549467370, now seen corresponding path program 1 times [2021-11-22 19:32:54,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:54,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623199931] [2021-11-22 19:32:54,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:54,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:55,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:55,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623199931] [2021-11-22 19:32:55,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623199931] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:55,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:55,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:32:55,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431335791] [2021-11-22 19:32:55,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:55,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:32:55,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:55,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:32:55,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:32:55,017 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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) [2021-11-22 19:32:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:55,223 INFO L93 Difference]: Finished difference Result 271 states and 296 transitions. [2021-11-22 19:32:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:32:55,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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) Word has length 36 [2021-11-22 19:32:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:55,225 INFO L225 Difference]: With dead ends: 271 [2021-11-22 19:32:55,225 INFO L226 Difference]: Without dead ends: 230 [2021-11-22 19:32:55,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:32:55,226 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 173 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:55,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 249 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:55,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-22 19:32:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 145. [2021-11-22 19:32:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 139 states have (on average 1.1654676258992807) internal successors, (162), 144 states have internal predecessors, (162), 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) [2021-11-22 19:32:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 162 transitions. [2021-11-22 19:32:55,233 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 162 transitions. Word has length 36 [2021-11-22 19:32:55,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:55,233 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 162 transitions. [2021-11-22 19:32:55,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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) [2021-11-22 19:32:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 162 transitions. [2021-11-22 19:32:55,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 19:32:55,233 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:55,234 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:55,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 19:32:55,234 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:55,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:55,234 INFO L85 PathProgramCache]: Analyzing trace with hash -869409000, now seen corresponding path program 1 times [2021-11-22 19:32:55,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:55,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176097075] [2021-11-22 19:32:55,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:55,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:55,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:55,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176097075] [2021-11-22 19:32:55,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176097075] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:55,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:55,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:32:55,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359645868] [2021-11-22 19:32:55,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:55,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:32:55,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:55,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:32:55,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:32:55,505 INFO L87 Difference]: Start difference. First operand 145 states and 162 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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) [2021-11-22 19:32:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:55,766 INFO L93 Difference]: Finished difference Result 204 states and 220 transitions. [2021-11-22 19:32:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:32:55,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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) Word has length 36 [2021-11-22 19:32:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:55,768 INFO L225 Difference]: With dead ends: 204 [2021-11-22 19:32:55,768 INFO L226 Difference]: Without dead ends: 163 [2021-11-22 19:32:55,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:32:55,769 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 231 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:55,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 450 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:32:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-11-22 19:32:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 142. [2021-11-22 19:32:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 136 states have (on average 1.1544117647058822) internal successors, (157), 141 states have internal predecessors, (157), 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) [2021-11-22 19:32:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2021-11-22 19:32:55,776 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 36 [2021-11-22 19:32:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:55,776 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2021-11-22 19:32:55,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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) [2021-11-22 19:32:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2021-11-22 19:32:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 19:32:55,777 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:55,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:55,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 19:32:55,777 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:55,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:55,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1291301932, now seen corresponding path program 1 times [2021-11-22 19:32:55,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:55,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966982662] [2021-11-22 19:32:55,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:55,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:55,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:55,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966982662] [2021-11-22 19:32:55,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966982662] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:55,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:55,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:32:55,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099833712] [2021-11-22 19:32:55,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:55,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:32:55,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:55,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:32:55,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:32:55,908 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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) [2021-11-22 19:32:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:56,026 INFO L93 Difference]: Finished difference Result 274 states and 297 transitions. [2021-11-22 19:32:56,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:32:56,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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) Word has length 36 [2021-11-22 19:32:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:56,027 INFO L225 Difference]: With dead ends: 274 [2021-11-22 19:32:56,027 INFO L226 Difference]: Without dead ends: 211 [2021-11-22 19:32:56,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:32:56,028 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 137 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:56,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 165 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:56,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-11-22 19:32:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 139. [2021-11-22 19:32:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 133 states have (on average 1.1353383458646618) internal successors, (151), 138 states have internal predecessors, (151), 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) [2021-11-22 19:32:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2021-11-22 19:32:56,035 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 36 [2021-11-22 19:32:56,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:56,035 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2021-11-22 19:32:56,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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) [2021-11-22 19:32:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2021-11-22 19:32:56,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 19:32:56,036 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:56,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:56,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 19:32:56,036 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:56,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash -611243562, now seen corresponding path program 1 times [2021-11-22 19:32:56,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:56,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830397745] [2021-11-22 19:32:56,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:56,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:56,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:56,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830397745] [2021-11-22 19:32:56,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830397745] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:56,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:56,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:32:56,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825199407] [2021-11-22 19:32:56,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:56,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:32:56,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:56,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:32:56,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:32:56,232 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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) [2021-11-22 19:32:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:56,549 INFO L93 Difference]: Finished difference Result 200 states and 211 transitions. [2021-11-22 19:32:56,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:32:56,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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) Word has length 36 [2021-11-22 19:32:56,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:56,550 INFO L225 Difference]: With dead ends: 200 [2021-11-22 19:32:56,550 INFO L226 Difference]: Without dead ends: 159 [2021-11-22 19:32:56,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:32:56,551 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 332 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:56,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 484 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:32:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-22 19:32:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 136. [2021-11-22 19:32:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 130 states have (on average 1.1307692307692307) internal successors, (147), 135 states have internal predecessors, (147), 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) [2021-11-22 19:32:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2021-11-22 19:32:56,557 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 36 [2021-11-22 19:32:56,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:56,557 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2021-11-22 19:32:56,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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) [2021-11-22 19:32:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2021-11-22 19:32:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 19:32:56,558 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:56,558 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:56,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 19:32:56,558 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:56,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1992548114, now seen corresponding path program 1 times [2021-11-22 19:32:56,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:56,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578011410] [2021-11-22 19:32:56,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:56,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:56,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:56,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578011410] [2021-11-22 19:32:56,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578011410] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:56,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:56,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:32:56,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629700732] [2021-11-22 19:32:56,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:56,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:32:56,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:56,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:32:56,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:32:56,775 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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) [2021-11-22 19:32:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:57,249 INFO L93 Difference]: Finished difference Result 187 states and 195 transitions. [2021-11-22 19:32:57,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 19:32:57,249 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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) Word has length 36 [2021-11-22 19:32:57,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:57,250 INFO L225 Difference]: With dead ends: 187 [2021-11-22 19:32:57,250 INFO L226 Difference]: Without dead ends: 159 [2021-11-22 19:32:57,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2021-11-22 19:32:57,251 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 355 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:57,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 468 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:32:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-22 19:32:57,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 136. [2021-11-22 19:32:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 130 states have (on average 1.123076923076923) internal successors, (146), 135 states have internal predecessors, (146), 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) [2021-11-22 19:32:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2021-11-22 19:32:57,258 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 36 [2021-11-22 19:32:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:57,258 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2021-11-22 19:32:57,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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) [2021-11-22 19:32:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2021-11-22 19:32:57,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-22 19:32:57,259 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:57,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:57,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-22 19:32:57,260 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:57,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash 280712196, now seen corresponding path program 1 times [2021-11-22 19:32:57,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:57,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197580377] [2021-11-22 19:32:57,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:57,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:57,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:57,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197580377] [2021-11-22 19:32:57,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197580377] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:57,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:57,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:32:57,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713703988] [2021-11-22 19:32:57,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:57,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:32:57,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:57,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:32:57,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:32:57,403 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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) [2021-11-22 19:32:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:57,516 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2021-11-22 19:32:57,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:32:57,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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) Word has length 38 [2021-11-22 19:32:57,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:57,517 INFO L225 Difference]: With dead ends: 136 [2021-11-22 19:32:57,517 INFO L226 Difference]: Without dead ends: 134 [2021-11-22 19:32:57,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:32:57,518 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 89 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:57,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 214 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:57,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-22 19:32:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-11-22 19:32:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.1162790697674418) internal successors, (144), 133 states have internal predecessors, (144), 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) [2021-11-22 19:32:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2021-11-22 19:32:57,525 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 38 [2021-11-22 19:32:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:57,525 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2021-11-22 19:32:57,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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) [2021-11-22 19:32:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2021-11-22 19:32:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-22 19:32:57,526 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:57,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:57,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-22 19:32:57,526 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:57,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:57,527 INFO L85 PathProgramCache]: Analyzing trace with hash -408934709, now seen corresponding path program 1 times [2021-11-22 19:32:57,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:57,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270403354] [2021-11-22 19:32:57,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:57,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:57,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:57,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270403354] [2021-11-22 19:32:57,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270403354] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:57,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:57,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:32:57,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569881084] [2021-11-22 19:32:57,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:57,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:32:57,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:57,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:32:57,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:32:57,712 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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) [2021-11-22 19:32:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:57,943 INFO L93 Difference]: Finished difference Result 180 states and 187 transitions. [2021-11-22 19:32:57,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:32:57,943 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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) Word has length 38 [2021-11-22 19:32:57,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:57,944 INFO L225 Difference]: With dead ends: 180 [2021-11-22 19:32:57,944 INFO L226 Difference]: Without dead ends: 153 [2021-11-22 19:32:57,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:32:57,945 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 301 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:57,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 386 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:32:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-11-22 19:32:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 128. [2021-11-22 19:32:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.1056910569105691) internal successors, (136), 127 states have internal predecessors, (136), 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) [2021-11-22 19:32:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2021-11-22 19:32:57,952 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 38 [2021-11-22 19:32:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:57,952 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2021-11-22 19:32:57,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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) [2021-11-22 19:32:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2021-11-22 19:32:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 19:32:57,953 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:57,953 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:57,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-22 19:32:57,954 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:57,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:57,954 INFO L85 PathProgramCache]: Analyzing trace with hash -20265715, now seen corresponding path program 1 times [2021-11-22 19:32:57,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:57,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424854697] [2021-11-22 19:32:57,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:57,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:58,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:58,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424854697] [2021-11-22 19:32:58,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424854697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:58,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:58,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:32:58,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856412469] [2021-11-22 19:32:58,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:58,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:32:58,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:58,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:32:58,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:32:58,153 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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) [2021-11-22 19:32:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:58,370 INFO L93 Difference]: Finished difference Result 205 states and 216 transitions. [2021-11-22 19:32:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:32:58,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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) Word has length 40 [2021-11-22 19:32:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:58,372 INFO L225 Difference]: With dead ends: 205 [2021-11-22 19:32:58,372 INFO L226 Difference]: Without dead ends: 143 [2021-11-22 19:32:58,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:32:58,372 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 163 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:58,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 423 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:32:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-22 19:32:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2021-11-22 19:32:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.0975609756097562) internal successors, (135), 127 states have internal predecessors, (135), 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) [2021-11-22 19:32:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2021-11-22 19:32:58,379 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 40 [2021-11-22 19:32:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:58,380 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2021-11-22 19:32:58,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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) [2021-11-22 19:32:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2021-11-22 19:32:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 19:32:58,380 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:58,380 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:58,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-22 19:32:58,381 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:58,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash 198589003, now seen corresponding path program 1 times [2021-11-22 19:32:58,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:58,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547807270] [2021-11-22 19:32:58,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:58,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:58,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:58,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547807270] [2021-11-22 19:32:58,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547807270] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:58,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:58,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:32:58,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526674953] [2021-11-22 19:32:58,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:58,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:32:58,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:58,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:32:58,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:32:58,610 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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) [2021-11-22 19:32:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:59,064 INFO L93 Difference]: Finished difference Result 188 states and 195 transitions. [2021-11-22 19:32:59,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 19:32:59,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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) Word has length 40 [2021-11-22 19:32:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:59,065 INFO L225 Difference]: With dead ends: 188 [2021-11-22 19:32:59,065 INFO L226 Difference]: Without dead ends: 145 [2021-11-22 19:32:59,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:32:59,066 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 175 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:59,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 521 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:32:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-11-22 19:32:59,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 126. [2021-11-22 19:32:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.0826446280991735) internal successors, (131), 125 states have internal predecessors, (131), 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) [2021-11-22 19:32:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2021-11-22 19:32:59,073 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 40 [2021-11-22 19:32:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:59,073 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2021-11-22 19:32:59,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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) [2021-11-22 19:32:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2021-11-22 19:32:59,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-22 19:32:59,074 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:59,074 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:59,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-22 19:32:59,075 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:59,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:59,075 INFO L85 PathProgramCache]: Analyzing trace with hash 399724621, now seen corresponding path program 1 times [2021-11-22 19:32:59,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:59,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162373115] [2021-11-22 19:32:59,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:59,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:59,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:59,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162373115] [2021-11-22 19:32:59,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162373115] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:59,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:59,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:32:59,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951487235] [2021-11-22 19:32:59,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:59,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:32:59,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:59,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:32:59,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:32:59,233 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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) [2021-11-22 19:32:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:59,367 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2021-11-22 19:32:59,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:32:59,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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) Word has length 41 [2021-11-22 19:32:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:59,369 INFO L225 Difference]: With dead ends: 141 [2021-11-22 19:32:59,369 INFO L226 Difference]: Without dead ends: 79 [2021-11-22 19:32:59,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:32:59,369 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 46 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:59,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 453 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-22 19:32:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-11-22 19:32:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 78 states have internal predecessors, (81), 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) [2021-11-22 19:32:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2021-11-22 19:32:59,373 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 41 [2021-11-22 19:32:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:59,374 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2021-11-22 19:32:59,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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) [2021-11-22 19:32:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2021-11-22 19:32:59,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 19:32:59,374 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:59,374 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:59,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-22 19:32:59,374 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:59,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:59,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1320234431, now seen corresponding path program 1 times [2021-11-22 19:32:59,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:59,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534628381] [2021-11-22 19:32:59,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:59,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:32:59,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:59,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534628381] [2021-11-22 19:32:59,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534628381] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:59,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:59,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:32:59,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778402519] [2021-11-22 19:32:59,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:59,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:32:59,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:59,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:32:59,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:32:59,779 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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) [2021-11-22 19:32:59,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:59,991 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2021-11-22 19:32:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:32:59,991 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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) Word has length 42 [2021-11-22 19:32:59,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:59,992 INFO L225 Difference]: With dead ends: 119 [2021-11-22 19:32:59,992 INFO L226 Difference]: Without dead ends: 74 [2021-11-22 19:32:59,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:32:59,993 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 250 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:59,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 128 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-22 19:32:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-11-22 19:32:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 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) [2021-11-22 19:32:59,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2021-11-22 19:32:59,997 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 42 [2021-11-22 19:32:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:59,997 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2021-11-22 19:32:59,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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) [2021-11-22 19:32:59,997 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2021-11-22 19:32:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 19:32:59,998 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:59,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:59,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-22 19:32:59,998 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:32:59,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:59,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1283557245, now seen corresponding path program 1 times [2021-11-22 19:32:59,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:59,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173793048] [2021-11-22 19:32:59,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:59,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:00,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:00,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173793048] [2021-11-22 19:33:00,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173793048] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:00,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:00,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:33:00,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094375578] [2021-11-22 19:33:00,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:00,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:33:00,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:00,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:33:00,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:33:00,443 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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) [2021-11-22 19:33:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:00,932 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2021-11-22 19:33:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 19:33:00,933 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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) Word has length 42 [2021-11-22 19:33:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:00,933 INFO L225 Difference]: With dead ends: 104 [2021-11-22 19:33:00,933 INFO L226 Difference]: Without dead ends: 74 [2021-11-22 19:33:00,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2021-11-22 19:33:00,934 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 334 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:00,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 237 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:33:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-22 19:33:00,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-11-22 19:33:00,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 73 states have internal predecessors, (74), 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) [2021-11-22 19:33:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2021-11-22 19:33:00,949 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 42 [2021-11-22 19:33:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:00,950 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2021-11-22 19:33:00,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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) [2021-11-22 19:33:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2021-11-22 19:33:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-22 19:33:00,950 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:00,950 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:00,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-22 19:33:00,950 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:33:00,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:00,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1150640246, now seen corresponding path program 1 times [2021-11-22 19:33:00,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:00,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140115093] [2021-11-22 19:33:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:00,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:01,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:01,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140115093] [2021-11-22 19:33:01,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140115093] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:01,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:01,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 19:33:01,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629661675] [2021-11-22 19:33:01,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:01,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 19:33:01,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:01,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 19:33:01,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:33:01,314 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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) [2021-11-22 19:33:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:01,745 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2021-11-22 19:33:01,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 19:33:01,745 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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) Word has length 44 [2021-11-22 19:33:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:01,746 INFO L225 Difference]: With dead ends: 74 [2021-11-22 19:33:01,746 INFO L226 Difference]: Without dead ends: 72 [2021-11-22 19:33:01,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2021-11-22 19:33:01,747 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 222 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:01,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 352 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:33:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-22 19:33:01,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2021-11-22 19:33:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.064516129032258) internal successors, (66), 65 states have internal predecessors, (66), 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) [2021-11-22 19:33:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2021-11-22 19:33:01,751 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 44 [2021-11-22 19:33:01,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:01,752 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2021-11-22 19:33:01,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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) [2021-11-22 19:33:01,752 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2021-11-22 19:33:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-22 19:33:01,752 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:01,753 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:01,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-22 19:33:01,753 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:33:01,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:01,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1943130182, now seen corresponding path program 1 times [2021-11-22 19:33:01,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:01,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755936646] [2021-11-22 19:33:01,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:01,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:01,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:01,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755936646] [2021-11-22 19:33:01,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755936646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:01,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:01,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:33:01,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849680391] [2021-11-22 19:33:01,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:01,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:33:01,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:01,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:33:01,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:01,994 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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) [2021-11-22 19:33:02,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:02,298 INFO L93 Difference]: Finished difference Result 95 states and 94 transitions. [2021-11-22 19:33:02,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:33:02,299 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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) Word has length 46 [2021-11-22 19:33:02,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:02,299 INFO L225 Difference]: With dead ends: 95 [2021-11-22 19:33:02,299 INFO L226 Difference]: Without dead ends: 66 [2021-11-22 19:33:02,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:33:02,300 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 283 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:02,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 146 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:02,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-22 19:33:02,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-11-22 19:33:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 65 states have internal predecessors, (65), 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) [2021-11-22 19:33:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 65 transitions. [2021-11-22 19:33:02,304 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 65 transitions. Word has length 46 [2021-11-22 19:33:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:02,304 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 65 transitions. [2021-11-22 19:33:02,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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) [2021-11-22 19:33:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 65 transitions. [2021-11-22 19:33:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-22 19:33:02,305 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:02,305 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:02,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-22 19:33:02,305 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:33:02,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:02,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1958810104, now seen corresponding path program 1 times [2021-11-22 19:33:02,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:02,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376192624] [2021-11-22 19:33:02,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:02,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:02,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:02,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376192624] [2021-11-22 19:33:02,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376192624] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:02,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:02,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:33:02,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606683834] [2021-11-22 19:33:02,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:02,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:33:02,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:02,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:33:02,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:02,656 INFO L87 Difference]: Start difference. First operand 66 states and 65 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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) [2021-11-22 19:33:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:02,888 INFO L93 Difference]: Finished difference Result 66 states and 65 transitions. [2021-11-22 19:33:02,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:33:02,888 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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) Word has length 46 [2021-11-22 19:33:02,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:02,889 INFO L225 Difference]: With dead ends: 66 [2021-11-22 19:33:02,889 INFO L226 Difference]: Without dead ends: 64 [2021-11-22 19:33:02,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:33:02,890 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 168 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:02,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 169 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-22 19:33:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-11-22 19:33:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 63 states have internal predecessors, (63), 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) [2021-11-22 19:33:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 63 transitions. [2021-11-22 19:33:02,894 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 63 transitions. Word has length 46 [2021-11-22 19:33:02,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:02,895 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 63 transitions. [2021-11-22 19:33:02,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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) [2021-11-22 19:33:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 63 transitions. [2021-11-22 19:33:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-22 19:33:02,895 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:02,895 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:02,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-22 19:33:02,896 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:33:02,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:02,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1220963354, now seen corresponding path program 1 times [2021-11-22 19:33:02,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:02,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095083727] [2021-11-22 19:33:02,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:02,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:03,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:03,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095083727] [2021-11-22 19:33:03,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095083727] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:03,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:03,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:33:03,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697581039] [2021-11-22 19:33:03,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:03,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:33:03,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:03,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:33:03,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:33:03,315 INFO L87 Difference]: Start difference. First operand 64 states and 63 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 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) [2021-11-22 19:33:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:03,580 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2021-11-22 19:33:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:33:03,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 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) Word has length 48 [2021-11-22 19:33:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:03,581 INFO L225 Difference]: With dead ends: 64 [2021-11-22 19:33:03,581 INFO L226 Difference]: Without dead ends: 62 [2021-11-22 19:33:03,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:33:03,582 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 177 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:03,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 173 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:33:03,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-22 19:33:03,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-22 19:33:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 61 states have internal predecessors, (61), 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) [2021-11-22 19:33:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 61 transitions. [2021-11-22 19:33:03,586 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 61 transitions. Word has length 48 [2021-11-22 19:33:03,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:03,586 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 61 transitions. [2021-11-22 19:33:03,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 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) [2021-11-22 19:33:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 61 transitions. [2021-11-22 19:33:03,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-22 19:33:03,587 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:03,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:03,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-22 19:33:03,587 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:33:03,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:03,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1599746443, now seen corresponding path program 1 times [2021-11-22 19:33:03,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:03,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801251841] [2021-11-22 19:33:03,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:03,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:03,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:03,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801251841] [2021-11-22 19:33:03,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801251841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:03,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:03,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:33:03,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795823666] [2021-11-22 19:33:03,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:03,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:33:03,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:03,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:33:03,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:33:03,846 INFO L87 Difference]: Start difference. First operand 62 states and 61 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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) [2021-11-22 19:33:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:04,010 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2021-11-22 19:33:04,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:33:04,010 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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) Word has length 53 [2021-11-22 19:33:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:04,011 INFO L225 Difference]: With dead ends: 62 [2021-11-22 19:33:04,011 INFO L226 Difference]: Without dead ends: 60 [2021-11-22 19:33:04,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:33:04,011 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 150 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:04,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 196 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-22 19:33:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-11-22 19:33:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0) internal successors, (59), 59 states have internal predecessors, (59), 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) [2021-11-22 19:33:04,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 59 transitions. [2021-11-22 19:33:04,015 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 59 transitions. Word has length 53 [2021-11-22 19:33:04,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:04,016 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 59 transitions. [2021-11-22 19:33:04,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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) [2021-11-22 19:33:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 59 transitions. [2021-11-22 19:33:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-22 19:33:04,016 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:04,016 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:04,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-22 19:33:04,016 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:33:04,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:04,017 INFO L85 PathProgramCache]: Analyzing trace with hash 926142011, now seen corresponding path program 1 times [2021-11-22 19:33:04,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:04,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162362649] [2021-11-22 19:33:04,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:04,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:04,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:04,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:04,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162362649] [2021-11-22 19:33:04,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162362649] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:04,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:04,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:33:04,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381542674] [2021-11-22 19:33:04,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:04,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:33:04,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:04,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:33:04,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:04,786 INFO L87 Difference]: Start difference. First operand 60 states and 59 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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) [2021-11-22 19:33:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:04,989 INFO L93 Difference]: Finished difference Result 60 states and 59 transitions. [2021-11-22 19:33:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:33:04,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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) Word has length 59 [2021-11-22 19:33:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:04,990 INFO L225 Difference]: With dead ends: 60 [2021-11-22 19:33:04,990 INFO L226 Difference]: Without dead ends: 0 [2021-11-22 19:33:04,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:33:04,990 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 138 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:04,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 222 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-22 19:33:04,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-22 19:33:04,991 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) [2021-11-22 19:33:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-22 19:33:04,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2021-11-22 19:33:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:04,991 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-22 19:33:04,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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) [2021-11-22 19:33:04,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-22 19:33:04,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-22 19:33:04,994 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-11-22 19:33:04,995 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-11-22 19:33:04,997 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2021-11-22 19:33:04,997 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2021-11-22 19:33:04,997 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2021-11-22 19:33:04,997 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2021-11-22 19:33:04,998 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-11-22 19:33:04,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-22 19:33:05,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-22 19:33:30,129 WARN L227 SmtUtils]: Spent 25.13s on a formula simplification. DAG size of input: 213 DAG size of output: 203 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-22 19:33:33,978 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,978 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-22 19:33:33,978 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,978 INFO L858 garLoopResultBuilder]: For program point L8974-2(lines 8974 8976) no Hoare annotation was computed. [2021-11-22 19:33:33,978 INFO L858 garLoopResultBuilder]: For program point L8974(lines 8974 8976) no Hoare annotation was computed. [2021-11-22 19:33:33,978 INFO L854 garLoopResultBuilder]: At program point L8215(lines 8203 8216) the Hoare annotation is: (let ((.cse18 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|))) (let ((.cse5 (select .cse18 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) (.cse16 (select .cse18 (+ 16 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|))) (.cse17 (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_~len#1| 18446744073709551616)))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse3 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse4 (<= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| (+ .cse17 36028797018963967))) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse7 (= |ULTIMATE.start_bounded_malloc_~size#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (<= .cse5 .cse16)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse10 (<= .cse16 .cse5)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.allocator.offset| 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_buf_from_array_#res#1.len|)) (.cse14 (not (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base| 0))) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.allocator.base| 0))) (or (and .cse0 (= 0 |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.base|) .cse1 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616))) .cse2 .cse3 .cse4 (<= .cse5 (* 18446744073709551616 (div .cse5 18446744073709551616))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.offset| 0) .cse1 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) .cse2 .cse3 .cse4 .cse6 .cse7 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base|) .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse16 (+ (* 18446744073709551616 (div (+ (- 1) .cse16) 18446744073709551616)) 18446744073709551615)) .cse13 .cse14 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.base|) .cse15 (<= (+ .cse17 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)))))) [2021-11-22 19:33:33,978 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:33:33,978 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:33:33,978 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:33:33,979 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:33:33,979 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8977) no Hoare annotation was computed. [2021-11-22 19:33:33,979 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:33:33,979 INFO L858 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:33:33,979 INFO L858 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:33:33,979 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-22 19:33:33,979 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,979 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,979 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,979 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,979 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,979 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,979 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,979 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,980 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,980 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,980 INFO L858 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,980 INFO L858 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,980 INFO L858 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,980 INFO L858 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,980 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,981 INFO L861 garLoopResultBuilder]: At program point L8978(line 8978) the Hoare annotation is: true [2021-11-22 19:33:33,981 INFO L858 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2021-11-22 19:33:33,981 INFO L858 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2021-11-22 19:33:33,981 INFO L858 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,981 INFO L858 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,981 INFO L858 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2021-11-22 19:33:33,981 INFO L858 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2021-11-22 19:33:33,981 INFO L858 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,981 INFO L858 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,981 INFO L858 garLoopResultBuilder]: For program point L7377-14(line 7377) no Hoare annotation was computed. [2021-11-22 19:33:33,981 INFO L858 garLoopResultBuilder]: For program point L7377-13(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,982 INFO L854 garLoopResultBuilder]: At program point L7377-12(lines 7375 7381) the Hoare annotation is: (let ((.cse28 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|))) (let ((.cse23 (select .cse28 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) (.cse22 (select .cse28 (+ 16 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|))) (.cse24 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.base|)) (.cse21 (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_~len#1| 18446744073709551616))) (.cse25 (+ |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.offset| 24)) (.cse27 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.offset| 8))) (let ((.cse0 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1)) (.cse1 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (.cse4 (= (select .cse27 .cse26) 0)) (.cse5 (= (select .cse27 .cse25) 0)) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse8 (<= |ULTIMATE.start_bounded_malloc_~size#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_bounded_malloc_~size#1| 18446744073709551616)) 36028797018963967))) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse10 (<= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| (+ .cse21 36028797018963967))) (.cse6 (select .cse24 .cse26)) (.cse11 (= |ULTIMATE.start_bounded_malloc_~size#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse12 (<= .cse23 .cse22)) (.cse13 (= (select .cse24 .cse25) 0)) (.cse14 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse16 (<= .cse22 .cse23)) (.cse17 (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0)) (.cse18 (= |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.offset| 0)) (.cse19 (not (= |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.base| 0))) (.cse20 (not (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616))) .cse4 .cse5 (= .cse6 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.offset| 0) .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) .cse5 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse6) .cse11 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base|) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= (+ .cse21 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)))))) [2021-11-22 19:33:33,982 INFO L858 garLoopResultBuilder]: For program point L7377-19(lines 7377 7378) no Hoare annotation was computed. [2021-11-22 19:33:33,982 INFO L858 garLoopResultBuilder]: For program point L7377-17(lines 7377 7378) no Hoare annotation was computed. [2021-11-22 19:33:33,982 INFO L858 garLoopResultBuilder]: For program point L7377-16(line 7377) no Hoare annotation was computed. [2021-11-22 19:33:33,982 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,982 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-22 19:33:33,982 INFO L858 garLoopResultBuilder]: For program point L7377-22(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,982 INFO L858 garLoopResultBuilder]: For program point L7377-20(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,983 INFO L854 garLoopResultBuilder]: At program point L7377-25(lines 7375 7381) the Hoare annotation is: (let ((.cse24 (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_~len#1| 18446744073709551616))) (.cse27 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse25 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse26 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse28 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse29 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.offset| 0)) (.cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1)) (.cse2 (= (select .cse28 .cse29) 0)) (.cse3 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse5 (= (select .cse26 .cse29) 0)) (.cse6 (= (select .cse25 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse9 (<= |ULTIMATE.start_bounded_malloc_~size#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_bounded_malloc_~size#1| 18446744073709551616)) 36028797018963967))) (.cse20 (select .cse28 .cse27)) (.cse10 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse11 (<= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| (+ .cse24 36028797018963967))) (.cse12 (= (select .cse26 .cse27) 0)) (.cse13 (= (select .cse25 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse16 (= |ULTIMATE.start_bounded_malloc_~size#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse18 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.allocator.offset| 0)) (.cse19 (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0)) (.cse21 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_buf_from_array_#res#1.len|)) (.cse22 (not (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base| 0))) (.cse23 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.allocator.base| 0))) (or (let ((.cse7 (+ 8 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|))) (and .cse0 .cse1 .cse2 (= 0 |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.base|) .cse3 .cse4 .cse5 .cse6 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse7) 0) .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.len| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_#res#1.len| 18446744073709551616))) .cse12 .cse13 (let ((.cse14 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|))) (<= .cse14 (* 18446744073709551616 (div .cse14 18446744073709551616)))) .cse15 .cse16 .cse17 .cse18 .cse19 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse7) 0) (= .cse20 0) .cse21 .cse22 .cse23)) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.offset| 0) .cse3 .cse4 .cse5 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse6 .cse8 .cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse20) .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base|) .cse17 .cse18 .cse19 .cse21 .cse22 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.base|) .cse23 (<= (+ .cse24 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|))))) [2021-11-22 19:33:33,983 INFO L858 garLoopResultBuilder]: For program point L7377-24(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,983 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:33:33,983 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:33:33,983 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:33:33,983 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,983 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-22 19:33:33,984 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-22 19:33:33,984 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-22 19:33:33,984 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-11-22 19:33:33,984 INFO L858 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,984 INFO L858 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,984 INFO L858 garLoopResultBuilder]: For program point L8206(lines 8206 8207) no Hoare annotation was computed. [2021-11-22 19:33:33,984 INFO L858 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,985 INFO L858 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,985 INFO L858 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,985 INFO L858 garLoopResultBuilder]: For program point L7380-9(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,985 INFO L858 garLoopResultBuilder]: For program point L8206-2(lines 8206 8207) no Hoare annotation was computed. [2021-11-22 19:33:33,985 INFO L858 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,985 INFO L858 garLoopResultBuilder]: For program point L7380-13(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,985 INFO L858 garLoopResultBuilder]: For program point L7380-12(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,986 INFO L858 garLoopResultBuilder]: For program point L7380-11(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,986 INFO L858 garLoopResultBuilder]: For program point L7380-17(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,986 INFO L858 garLoopResultBuilder]: For program point L7380-15(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:33,986 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,986 INFO L854 garLoopResultBuilder]: At program point L6886(lines 6882 6887) the Hoare annotation is: (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (<= |ULTIMATE.start_bounded_malloc_~size#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_bounded_malloc_~size#1| 18446744073709551616)) 36028797018963967)) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= |ULTIMATE.start_bounded_malloc_~size#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) [2021-11-22 19:33:33,986 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-22 19:33:33,986 INFO L858 garLoopResultBuilder]: For program point L7101(lines 7101 7111) no Hoare annotation was computed. [2021-11-22 19:33:33,987 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:33:33,987 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse5 (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_~len#1| 18446744073709551616)))) (and (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.offset| 0) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.offset| 0) (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|) (= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (= (select .cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse4)) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (<= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| (+ .cse5 36028797018963967)) (= (select .cse2 .cse4) 0) (= (select .cse3 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_bounded_malloc_~size#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_buf_from_array_#res#1.len|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.base|) (<= (div |ULTIMATE.start___VERIFIER_assert_~cond#1| 256) 0) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.allocator.base| 0) (<= (+ .cse5 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|))) [2021-11-22 19:33:33,990 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:33,991 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 19:33:33,998 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,000 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,000 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,001 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,001 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,001 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,001 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,002 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,007 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,008 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,009 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,009 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,012 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,012 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,012 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,012 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,013 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,018 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,019 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,020 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,020 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,021 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,022 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,022 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,022 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,024 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,024 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,025 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,026 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,026 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,026 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,026 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,027 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,027 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,027 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,029 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,029 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,029 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,030 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,030 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,030 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,030 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,031 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,031 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,032 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,032 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,032 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,032 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,033 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,033 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,033 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 07:33:34 BoogieIcfgContainer [2021-11-22 19:33:34,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 19:33:34,035 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 19:33:34,035 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 19:33:34,035 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 19:33:34,036 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:32:46" (3/4) ... [2021-11-22 19:33:34,039 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-22 19:33:34,057 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2021-11-22 19:33:34,058 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-11-22 19:33:34,059 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-11-22 19:33:34,060 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-22 19:33:34,061 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-22 19:33:34,062 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-22 19:33:34,063 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-22 19:33:34,064 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-22 19:33:34,087 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((cond == 1 && \result == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && size == length [2021-11-22 19:33:34,088 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\result <= 1 && 1 <= \result) && len == length) && buf == buf) && length <= 18446744073709551616 * (length / 18446744073709551616)) && #memory_$Pointer$[buf][buf + 8] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && size == length) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][buf + 24] == 0) && unknown-#memory_int-unknown[buf][16 + buf] == length) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && buf == 0) && buf == 0) && !(buf == 0)) && !(bytes == 0)) || (((((((((((((((((((((((((\result <= 1 && bytes == 0) && 1 <= \result) && len == length) && buf == buf) && #memory_$Pointer$[buf][buf + 8] == 0) && array == 0) && \result == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && array == #memory_$Pointer$[buf][buf + 8]) && size == length) && array == bytes) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][buf + 24] == 0) && unknown-#memory_int-unknown[buf][16 + buf] == length) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && buf == 0) && buf == 0) && !(buf == 0)) && !(bytes == 0)) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length) [2021-11-22 19:33:34,088 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && 0 == aws_byte_buf_from_array_#res#1.buffer) && len == length) && length <= 18446744073709551616 * (length / 18446744073709551616)) && !(buf == 0)) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && unknown-#memory_int-unknown[buf][buf] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && unknown-#res!capacity-unknown == length) && size == length) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && length == unknown-#res!len-unknown) && !(bytes == 0)) && aws_byte_buf_from_array_#res#1.allocator == 0) || (((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && bytes == 0) && len == length) && array == 0) && \result == 0) && !(buf == 0)) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown == length) && size == length) && array == bytes) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 18446744073709551615) && length == unknown-#res!len-unknown) && !(bytes == 0)) && array == aws_byte_buf_from_array_#res#1.buffer) && aws_byte_buf_from_array_#res#1.allocator == 0) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length) [2021-11-22 19:33:34,089 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && 0 == aws_byte_buf_from_array_#res#1.buffer) && 1 <= \result) && len == length) && #memory_$Pointer$[buf][buf + 24] == 0) && unknown-#memory_int-unknown[buf][16 + buf] == length) && #memory_$Pointer$[buf][8 + buf] == 0) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && unknown-#res!len-unknown <= 18446744073709551616 * (unknown-#res!len-unknown / 18446744073709551616)) && #memory_$Pointer$[buf][buf + 8] == 0) && unknown-#memory_int-unknown[buf][buf] == length) && unknown-#memory_int-unknown[buf][buf] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && unknown-#res!capacity-unknown == length) && size == length) && buf == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && length == unknown-#res!len-unknown) && !(bytes == 0)) && aws_byte_buf_from_array_#res#1.allocator == 0) || ((((((((((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && bytes == 0) && 1 <= \result) && len == length) && #memory_$Pointer$[buf][buf + 24] == 0) && array == 0) && \result == 0) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] == length) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && array == #memory_$Pointer$[buf][buf + 8]) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && #memory_$Pointer$[buf][buf + 8] == 0) && unknown-#memory_int-unknown[buf][buf] == length) && unknown-#res!capacity-unknown == length) && size == length) && array == bytes) && buf == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && length == unknown-#res!len-unknown) && !(bytes == 0)) && array == aws_byte_buf_from_array_#res#1.buffer) && aws_byte_buf_from_array_#res#1.allocator == 0) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length) [2021-11-22 19:33:34,089 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && \result <= 1) && b == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && bytes == 0) && 1 <= \result) && len == length) && #memory_$Pointer$[buf][buf + 24] == 0) && array == 0) && 1 <= cond) && \result == 0) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] == length) && !(buf == 0)) && array == #memory_$Pointer$[buf][buf + 8]) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && #memory_$Pointer$[buf][buf + 8] == 0) && unknown-#memory_int-unknown[buf][buf] == length) && unknown-#res!capacity-unknown == length) && size == length) && array == bytes) && buf == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && b == a) && length == unknown-#res!len-unknown) && !(bytes == 0)) && array == aws_byte_buf_from_array_#res#1.buffer) && cond / 256 <= 0) && a == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length [2021-11-22 19:33:34,815 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-22 19:33:34,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 19:33:34,817 INFO L158 Benchmark]: Toolchain (without parser) took 52083.76ms. Allocated memory was 90.2MB in the beginning and 465.6MB in the end (delta: 375.4MB). Free memory was 44.2MB in the beginning and 149.9MB in the end (delta: -105.6MB). Peak memory consumption was 302.5MB. Max. memory is 16.1GB. [2021-11-22 19:33:34,817 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 90.2MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 19:33:34,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1955.71ms. Allocated memory was 90.2MB in the beginning and 121.6MB in the end (delta: 31.5MB). Free memory was 44.1MB in the beginning and 46.9MB in the end (delta: -2.8MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. [2021-11-22 19:33:34,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 190.26ms. Allocated memory was 121.6MB in the beginning and 180.4MB in the end (delta: 58.7MB). Free memory was 46.9MB in the beginning and 126.9MB in the end (delta: -80.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-22 19:33:34,823 INFO L158 Benchmark]: Boogie Preprocessor took 85.63ms. Allocated memory is still 180.4MB. Free memory was 126.9MB in the beginning and 120.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-22 19:33:34,823 INFO L158 Benchmark]: RCFGBuilder took 1217.00ms. Allocated memory is still 180.4MB. Free memory was 120.6MB in the beginning and 110.4MB in the end (delta: 10.3MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2021-11-22 19:33:34,823 INFO L158 Benchmark]: TraceAbstraction took 47849.96ms. Allocated memory was 180.4MB in the beginning and 465.6MB in the end (delta: 285.2MB). Free memory was 109.3MB in the beginning and 153.4MB in the end (delta: -44.1MB). Peak memory consumption was 257.1MB. Max. memory is 16.1GB. [2021-11-22 19:33:34,823 INFO L158 Benchmark]: Witness Printer took 780.12ms. Allocated memory is still 465.6MB. Free memory was 153.4MB in the beginning and 149.9MB in the end (delta: 3.6MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2021-11-22 19:33:34,824 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.09ms. Allocated memory is still 90.2MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1955.71ms. Allocated memory was 90.2MB in the beginning and 121.6MB in the end (delta: 31.5MB). Free memory was 44.1MB in the beginning and 46.9MB in the end (delta: -2.8MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 190.26ms. Allocated memory was 121.6MB in the beginning and 180.4MB in the end (delta: 58.7MB). Free memory was 46.9MB in the beginning and 126.9MB in the end (delta: -80.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.63ms. Allocated memory is still 180.4MB. Free memory was 126.9MB in the beginning and 120.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1217.00ms. Allocated memory is still 180.4MB. Free memory was 120.6MB in the beginning and 110.4MB in the end (delta: 10.3MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. * TraceAbstraction took 47849.96ms. Allocated memory was 180.4MB in the beginning and 465.6MB in the end (delta: 285.2MB). Free memory was 109.3MB in the beginning and 153.4MB in the end (delta: -44.1MB). Peak memory consumption was 257.1MB. Max. memory is 16.1GB. * Witness Printer took 780.12ms. Allocated memory is still 465.6MB. Free memory was 153.4MB in the beginning and 149.9MB in the end (delta: 3.6MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled * 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 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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 1 procedures, 79 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 47.8s, OverallIterations: 35, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 29.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6777 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6777 mSDsluCounter, 11436 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8766 mSDsCounter, 387 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3995 IncrementalHoareTripleChecker+Invalid, 4382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 387 mSolverCounterUnsat, 2670 mSDtfsCounter, 3995 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 519 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=18, InterpolantAutomatonStates: 333, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 935 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 990 HoareAnnotationTreeSize, 6 FomulaSimplifications, 1434580 FormulaSimplificationTreeSizeReduction, 27.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 705932 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1163 NumberOfCodeBlocks, 1163 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1128 ConstructedInterpolants, 0 QuantifiedInterpolants, 11560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 0/0 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 7 specifications checked. All of them hold - InvariantResult [Line: 266]: Loop Invariant [2021-11-22 19:33:34,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,832 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,832 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,833 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,834 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,834 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: (((((((((((((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && \result <= 1) && b == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && bytes == 0) && 1 <= \result) && len == length) && #memory_$Pointer$[buf][buf + 24] == 0) && array == 0) && 1 <= cond) && \result == 0) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] == length) && !(buf == 0)) && array == #memory_$Pointer$[buf][buf + 8]) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && #memory_$Pointer$[buf][buf + 8] == 0) && unknown-#memory_int-unknown[buf][buf] == length) && unknown-#res!capacity-unknown == length) && size == length) && array == bytes) && buf == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && b == a) && length == unknown-#res!len-unknown) && !(bytes == 0)) && array == aws_byte_buf_from_array_#res#1.buffer) && cond / 256 <= 0) && a == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length - InvariantResult [Line: 7375]: Loop Invariant [2021-11-22 19:33:34,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,836 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,836 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,836 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,838 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,838 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,838 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,838 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,839 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,839 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((\result <= 1 && 1 <= \result) && len == length) && buf == buf) && length <= 18446744073709551616 * (length / 18446744073709551616)) && #memory_$Pointer$[buf][buf + 8] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && size == length) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][buf + 24] == 0) && unknown-#memory_int-unknown[buf][16 + buf] == length) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && buf == 0) && buf == 0) && !(buf == 0)) && !(bytes == 0)) || (((((((((((((((((((((((((\result <= 1 && bytes == 0) && 1 <= \result) && len == length) && buf == buf) && #memory_$Pointer$[buf][buf + 8] == 0) && array == 0) && \result == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && array == #memory_$Pointer$[buf][buf + 8]) && size == length) && array == bytes) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][buf + 24] == 0) && unknown-#memory_int-unknown[buf][16 + buf] == length) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && buf == 0) && buf == 0) && !(buf == 0)) && !(bytes == 0)) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (((cond == 1 && \result == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && size == length - InvariantResult [Line: 7375]: Loop Invariant [2021-11-22 19:33:34,840 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,840 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,841 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,841 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,841 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,841 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,842 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,842 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,842 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,843 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,844 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,844 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,845 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,845 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,845 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,845 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,846 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,846 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,846 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,846 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,846 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,847 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,847 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,847 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,847 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,847 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:34,848 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:34,848 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,848 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,848 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: ((((((((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && 0 == aws_byte_buf_from_array_#res#1.buffer) && 1 <= \result) && len == length) && #memory_$Pointer$[buf][buf + 24] == 0) && unknown-#memory_int-unknown[buf][16 + buf] == length) && #memory_$Pointer$[buf][8 + buf] == 0) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && unknown-#res!len-unknown <= 18446744073709551616 * (unknown-#res!len-unknown / 18446744073709551616)) && #memory_$Pointer$[buf][buf + 8] == 0) && unknown-#memory_int-unknown[buf][buf] == length) && unknown-#memory_int-unknown[buf][buf] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && unknown-#res!capacity-unknown == length) && size == length) && buf == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && length == unknown-#res!len-unknown) && !(bytes == 0)) && aws_byte_buf_from_array_#res#1.allocator == 0) || ((((((((((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && bytes == 0) && 1 <= \result) && len == length) && #memory_$Pointer$[buf][buf + 24] == 0) && array == 0) && \result == 0) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] == length) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && array == #memory_$Pointer$[buf][buf + 8]) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && #memory_$Pointer$[buf][buf + 8] == 0) && unknown-#memory_int-unknown[buf][buf] == length) && unknown-#res!capacity-unknown == length) && size == length) && array == bytes) && buf == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && length == unknown-#res!len-unknown) && !(bytes == 0)) && array == aws_byte_buf_from_array_#res#1.buffer) && aws_byte_buf_from_array_#res#1.allocator == 0) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length) - InvariantResult [Line: 8978]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8203]: Loop Invariant [2021-11-22 19:33:34,849 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,850 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,850 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,850 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,850 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,850 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,851 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,851 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,851 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,852 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,852 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,852 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,852 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,852 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,853 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:34,853 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: (((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && 0 == aws_byte_buf_from_array_#res#1.buffer) && len == length) && length <= 18446744073709551616 * (length / 18446744073709551616)) && !(buf == 0)) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && unknown-#memory_int-unknown[buf][buf] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && unknown-#res!capacity-unknown == length) && size == length) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && length == unknown-#res!len-unknown) && !(bytes == 0)) && aws_byte_buf_from_array_#res#1.allocator == 0) || (((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && bytes == 0) && len == length) && array == 0) && \result == 0) && !(buf == 0)) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown == length) && size == length) && array == bytes) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 18446744073709551615) && length == unknown-#res!len-unknown) && !(bytes == 0)) && array == aws_byte_buf_from_array_#res#1.buffer) && aws_byte_buf_from_array_#res#1.allocator == 0) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length) RESULT: Ultimate proved your program to be correct! [2021-11-22 19:33:34,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE