./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_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_cursor_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 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 19:47:41,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 19:47:41,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 19:47:41,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 19:47:41,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 19:47:41,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 19:47:41,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 19:47:41,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 19:47:41,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 19:47:41,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 19:47:41,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 19:47:41,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 19:47:41,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 19:47:41,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 19:47:41,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 19:47:41,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 19:47:41,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 19:47:41,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 19:47:41,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 19:47:41,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 19:47:41,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 19:47:41,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 19:47:41,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 19:47:41,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 19:47:41,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 19:47:41,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 19:47:41,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 19:47:41,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 19:47:41,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 19:47:41,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 19:47:41,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 19:47:41,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 19:47:41,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 19:47:41,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 19:47:41,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 19:47:41,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 19:47:41,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 19:47:41,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 19:47:41,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 19:47:41,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 19:47:41,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 19:47:41,088 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:47:41,113 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 19:47:41,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 19:47:41,114 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 19:47:41,114 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 19:47:41,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 19:47:41,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 19:47:41,116 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 19:47:41,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 19:47:41,116 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 19:47:41,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 19:47:41,117 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 19:47:41,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 19:47:41,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 19:47:41,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 19:47:41,117 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 19:47:41,118 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 19:47:41,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 19:47:41,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 19:47:41,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 19:47:41,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:47:41,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 19:47:41,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 19:47:41,119 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 19:47:41,119 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 19:47:41,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 19:47:41,119 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 19:47:41,119 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 19:47:41,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 19:47:41,119 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 19:47:41,120 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 -> 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c [2021-11-22 19:47:41,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 19:47:41,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 19:47:41,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 19:47:41,342 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 19:47:41,342 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 19:47:41,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-11-22 19:47:41,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f942d79c/a41e302ed39940bb93337b4d7c825ad9/FLAG4e9a0df24 [2021-11-22 19:47:41,961 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 19:47:41,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-11-22 19:47:41,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f942d79c/a41e302ed39940bb93337b4d7c825ad9/FLAG4e9a0df24 [2021-11-22 19:47:42,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f942d79c/a41e302ed39940bb93337b4d7c825ad9 [2021-11-22 19:47:42,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 19:47:42,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 19:47:42,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 19:47:42,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 19:47:42,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 19:47:42,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:47:42" (1/1) ... [2021-11-22 19:47:42,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7975a926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:47:42, skipping insertion in model container [2021-11-22 19:47:42,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:47:42" (1/1) ... [2021-11-22 19:47:42,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 19:47:42,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 19:47:42,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4500,4513] [2021-11-22 19:47:42,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4560,4573] [2021-11-22 19:47:43,450 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:43,452 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:43,454 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:43,456 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:43,457 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:43,465 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:43,472 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:43,474 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:43,475 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:43,696 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:47:43,697 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:47:43,698 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:47:43,698 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:47:43,699 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:47:43,700 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:47:43,700 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:47:43,700 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:47:43,701 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:47:43,701 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:47:43,846 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:47:44,025 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:44,026 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:44,123 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:47:44,188 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 19:47:44,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4500,4513] [2021-11-22 19:47:44,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4560,4573] [2021-11-22 19:47:44,256 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:44,257 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:44,257 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:44,258 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:44,258 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:44,262 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:44,275 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:44,277 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:44,277 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:44,329 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:47:44,330 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:47:44,330 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:47:44,331 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:47:44,331 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:47:44,332 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:47:44,332 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:47:44,333 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:47:44,333 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:47:44,333 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:47:44,358 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:47:44,438 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:44,438 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:47:44,459 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:47:44,593 INFO L208 MainTranslator]: Completed translation [2021-11-22 19:47:44,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:47:44 WrapperNode [2021-11-22 19:47:44,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 19:47:44,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 19:47:44,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 19:47:44,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 19:47:44,599 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:47:44" (1/1) ... [2021-11-22 19:47:44,678 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:47:44" (1/1) ... [2021-11-22 19:47:44,743 INFO L137 Inliner]: procedures = 690, calls = 2609, calls flagged for inlining = 944, calls inlined = 17, statements flattened = 881 [2021-11-22 19:47:44,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 19:47:44,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 19:47:44,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 19:47:44,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 19:47:44,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:47:44" (1/1) ... [2021-11-22 19:47:44,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:47:44" (1/1) ... [2021-11-22 19:47:44,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:47:44" (1/1) ... [2021-11-22 19:47:44,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:47:44" (1/1) ... [2021-11-22 19:47:44,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:47:44" (1/1) ... [2021-11-22 19:47:44,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:47:44" (1/1) ... [2021-11-22 19:47:44,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:47:44" (1/1) ... [2021-11-22 19:47:44,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 19:47:44,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 19:47:44,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 19:47:44,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 19:47:44,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:47:44" (1/1) ... [2021-11-22 19:47:44,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:47:44,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:47:44,872 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:47:44,926 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:47:44,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 19:47:44,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 19:47:44,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 19:47:44,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 19:47:44,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 19:47:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 19:47:44,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 19:47:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 19:47:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 19:47:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 19:47:44,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 19:47:44,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 19:47:45,172 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 19:47:45,174 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 19:47:45,851 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 19:47:45,856 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 19:47:45,857 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-22 19:47:45,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:47:45 BoogieIcfgContainer [2021-11-22 19:47:45,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 19:47:45,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 19:47:45,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 19:47:45,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 19:47:45,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:47:42" (1/3) ... [2021-11-22 19:47:45,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2295ae6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:47:45, skipping insertion in model container [2021-11-22 19:47:45,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:47:44" (2/3) ... [2021-11-22 19:47:45,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2295ae6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:47:45, skipping insertion in model container [2021-11-22 19:47:45,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:47:45" (3/3) ... [2021-11-22 19:47:45,864 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2021-11-22 19:47:45,867 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 19:47:45,867 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-22 19:47:45,903 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 19:47:45,910 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:47:45,911 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-22 19:47:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 60 states have internal predecessors, (80), 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:47:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-22 19:47:45,925 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:45,925 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:45,926 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:45,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:45,930 INFO L85 PathProgramCache]: Analyzing trace with hash -86834800, now seen corresponding path program 1 times [2021-11-22 19:47:45,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:45,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223045392] [2021-11-22 19:47:45,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:45,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:46,243 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:47:46,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:46,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223045392] [2021-11-22 19:47:46,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223045392] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:46,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:46,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 19:47:46,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373872322] [2021-11-22 19:47:46,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:46,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 19:47:46,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:46,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 19:47:46,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:47:46,266 INFO L87 Difference]: Start difference. First operand has 61 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 60 states have internal predecessors, (80), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:47:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:46,278 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2021-11-22 19:47:46,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 19:47:46,279 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2021-11-22 19:47:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:46,284 INFO L225 Difference]: With dead ends: 119 [2021-11-22 19:47:46,284 INFO L226 Difference]: Without dead ends: 54 [2021-11-22 19:47:46,286 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:47:46,288 INFO L933 BasicCegarLoop]: 72 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, 72 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:47:46,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:47:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-22 19:47:46,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-11-22 19:47:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 53 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:47:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2021-11-22 19:47:46,317 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 12 [2021-11-22 19:47:46,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:46,318 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2021-11-22 19:47:46,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:47:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2021-11-22 19:47:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-22 19:47:46,320 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:46,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:46,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 19:47:46,321 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:46,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:46,322 INFO L85 PathProgramCache]: Analyzing trace with hash -479861810, now seen corresponding path program 1 times [2021-11-22 19:47:46,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:46,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019997244] [2021-11-22 19:47:46,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:46,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:46,507 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:47:46,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:46,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019997244] [2021-11-22 19:47:46,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019997244] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:46,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:46,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 19:47:46,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988428413] [2021-11-22 19:47:46,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:46,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 19:47:46,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:46,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 19:47:46,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 19:47:46,511 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:47:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:46,540 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2021-11-22 19:47:46,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 19:47:46,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2021-11-22 19:47:46,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:46,542 INFO L225 Difference]: With dead ends: 92 [2021-11-22 19:47:46,542 INFO L226 Difference]: Without dead ends: 54 [2021-11-22 19:47:46,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 19:47:46,546 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 23 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:46,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 92 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:47:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-22 19:47:46,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-11-22 19:47:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 53 states have internal predecessors, (62), 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:47:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2021-11-22 19:47:46,555 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 12 [2021-11-22 19:47:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:46,555 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2021-11-22 19:47:46,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:47:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2021-11-22 19:47:46,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 19:47:46,556 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:46,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:46,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 19:47:46,556 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:46,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:46,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1018024457, now seen corresponding path program 1 times [2021-11-22 19:47:46,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:46,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331274845] [2021-11-22 19:47:46,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:46,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:46,696 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:47:46,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:46,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331274845] [2021-11-22 19:47:46,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331274845] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:46,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:46,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:47:46,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173107993] [2021-11-22 19:47:46,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:46,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:47:46,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:46,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:47:46,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:47:46,698 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:47:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:46,789 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2021-11-22 19:47:46,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:47:46,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:47:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:46,791 INFO L225 Difference]: With dead ends: 99 [2021-11-22 19:47:46,791 INFO L226 Difference]: Without dead ends: 95 [2021-11-22 19:47:46,791 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:47:46,792 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 74 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:46,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 284 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:47:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-22 19:47:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 62. [2021-11-22 19:47:46,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 61 states have internal predecessors, (70), 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:47:46,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2021-11-22 19:47:46,796 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 14 [2021-11-22 19:47:46,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:46,797 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2021-11-22 19:47:46,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:47:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2021-11-22 19:47:46,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-22 19:47:46,798 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:46,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:46,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 19:47:46,798 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:46,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:46,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1084310207, now seen corresponding path program 1 times [2021-11-22 19:47:46,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:46,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647147761] [2021-11-22 19:47:46,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:46,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:47,081 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:47:47,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:47,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647147761] [2021-11-22 19:47:47,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647147761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:47,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:47,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:47:47,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126006780] [2021-11-22 19:47:47,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:47,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:47:47,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:47,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:47:47,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:47:47,084 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:47:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:47,223 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2021-11-22 19:47:47,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:47:47,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2021-11-22 19:47:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:47,226 INFO L225 Difference]: With dead ends: 113 [2021-11-22 19:47:47,226 INFO L226 Difference]: Without dead ends: 69 [2021-11-22 19:47:47,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:47:47,228 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 158 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:47,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 178 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:47:47,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-11-22 19:47:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2021-11-22 19:47:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 63 states have internal predecessors, (72), 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:47:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2021-11-22 19:47:47,237 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 18 [2021-11-22 19:47:47,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:47,237 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2021-11-22 19:47:47,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:47:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2021-11-22 19:47:47,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-22 19:47:47,239 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:47,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:47,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 19:47:47,241 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:47,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:47,243 INFO L85 PathProgramCache]: Analyzing trace with hash -404251837, now seen corresponding path program 1 times [2021-11-22 19:47:47,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:47,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38562226] [2021-11-22 19:47:47,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:47,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:47,397 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:47:47,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:47,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38562226] [2021-11-22 19:47:47,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38562226] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:47,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:47,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:47:47,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059768984] [2021-11-22 19:47:47,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:47,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:47:47,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:47,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:47:47,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:47:47,400 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:47:47,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:47,476 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2021-11-22 19:47:47,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 19:47:47,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2021-11-22 19:47:47,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:47,477 INFO L225 Difference]: With dead ends: 110 [2021-11-22 19:47:47,477 INFO L226 Difference]: Without dead ends: 62 [2021-11-22 19:47:47,477 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:47:47,478 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:47,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 116 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:47:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-22 19:47:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-22 19:47:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 61 states have internal predecessors, (67), 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:47:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2021-11-22 19:47:47,482 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 18 [2021-11-22 19:47:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:47,482 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2021-11-22 19:47:47,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:47:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2021-11-22 19:47:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-22 19:47:47,483 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:47,483 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:47:47,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 19:47:47,483 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:47,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash 501656654, now seen corresponding path program 1 times [2021-11-22 19:47:47,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:47,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528017155] [2021-11-22 19:47:47,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:47,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:47,569 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:47:47,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:47,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528017155] [2021-11-22 19:47:47,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528017155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:47,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:47,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:47:47,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588302989] [2021-11-22 19:47:47,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:47,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:47:47,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:47,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:47:47,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:47:47,571 INFO L87 Difference]: Start difference. First operand 62 states and 67 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:47:47,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:47,587 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2021-11-22 19:47:47,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 19:47:47,588 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:47:47,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:47,588 INFO L225 Difference]: With dead ends: 84 [2021-11-22 19:47:47,589 INFO L226 Difference]: Without dead ends: 62 [2021-11-22 19:47:47,589 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:47:47,589 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 65 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:47,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 83 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:47:47,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-22 19:47:47,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-22 19:47:47,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 61 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:47:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2021-11-22 19:47:47,593 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 20 [2021-11-22 19:47:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:47,593 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2021-11-22 19:47:47,593 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:47:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2021-11-22 19:47:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-22 19:47:47,594 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:47,594 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:47:47,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 19:47:47,594 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:47,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:47,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1522937572, now seen corresponding path program 1 times [2021-11-22 19:47:47,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:47,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117557983] [2021-11-22 19:47:47,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:47,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:47,706 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:47:47,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:47,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117557983] [2021-11-22 19:47:47,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117557983] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:47,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:47,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:47:47,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293464713] [2021-11-22 19:47:47,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:47,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:47:47,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:47,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:47:47,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:47:47,708 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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:47:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:47,889 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2021-11-22 19:47:47,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:47:47,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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:47:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:47,890 INFO L225 Difference]: With dead ends: 116 [2021-11-22 19:47:47,890 INFO L226 Difference]: Without dead ends: 112 [2021-11-22 19:47:47,891 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:47:47,891 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 81 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:47,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 266 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:47:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-11-22 19:47:47,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 66. [2021-11-22 19:47:47,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 65 states have internal predecessors, (70), 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:47:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2021-11-22 19:47:47,895 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 20 [2021-11-22 19:47:47,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:47,895 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-11-22 19:47:47,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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:47:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2021-11-22 19:47:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-22 19:47:47,896 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:47,896 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:47:47,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 19:47:47,896 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:47,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:47,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1962683098, now seen corresponding path program 1 times [2021-11-22 19:47:47,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:47,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144154832] [2021-11-22 19:47:47,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:47,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:48,079 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:47:48,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:48,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144154832] [2021-11-22 19:47:48,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144154832] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:48,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:48,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:47:48,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084619560] [2021-11-22 19:47:48,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:48,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:47:48,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:48,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:47:48,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:47:48,081 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 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:47:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:48,469 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2021-11-22 19:47:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-22 19:47:48,469 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 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:47:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:48,470 INFO L225 Difference]: With dead ends: 117 [2021-11-22 19:47:48,470 INFO L226 Difference]: Without dead ends: 113 [2021-11-22 19:47:48,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2021-11-22 19:47:48,471 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 150 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:48,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 337 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:47:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-22 19:47:48,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 57. [2021-11-22 19:47:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.150943396226415) internal successors, (61), 56 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:47:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-11-22 19:47:48,484 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 20 [2021-11-22 19:47:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:48,484 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-11-22 19:47:48,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 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:47:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-11-22 19:47:48,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 19:47:48,485 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:48,485 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:47:48,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 19:47:48,486 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:48,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:48,486 INFO L85 PathProgramCache]: Analyzing trace with hash -863865621, now seen corresponding path program 1 times [2021-11-22 19:47:48,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:48,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660469003] [2021-11-22 19:47:48,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:48,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:48,876 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:47:48,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:48,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660469003] [2021-11-22 19:47:48,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660469003] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:48,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:48,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:47:48,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919225228] [2021-11-22 19:47:48,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:48,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:47:48,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:48,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:47:48,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:47:48,879 INFO L87 Difference]: Start difference. First operand 57 states and 61 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:47:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:49,312 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2021-11-22 19:47:49,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 19:47:49,312 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:47:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:49,313 INFO L225 Difference]: With dead ends: 99 [2021-11-22 19:47:49,314 INFO L226 Difference]: Without dead ends: 97 [2021-11-22 19:47:49,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:47:49,315 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 272 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:49,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 223 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:47:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-11-22 19:47:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2021-11-22 19:47:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 78 states have (on average 1.1538461538461537) internal successors, (90), 81 states have internal predecessors, (90), 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:47:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2021-11-22 19:47:49,324 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 24 [2021-11-22 19:47:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:49,324 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2021-11-22 19:47:49,324 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:47:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2021-11-22 19:47:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 19:47:49,325 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:49,325 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:47:49,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 19:47:49,325 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:49,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:49,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1075136575, now seen corresponding path program 1 times [2021-11-22 19:47:49,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:49,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647609560] [2021-11-22 19:47:49,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:49,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:49,487 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:47:49,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:49,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647609560] [2021-11-22 19:47:49,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647609560] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:49,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:49,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:47:49,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154694002] [2021-11-22 19:47:49,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:49,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:47:49,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:49,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:47:49,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:47:49,490 INFO L87 Difference]: Start difference. First operand 82 states and 90 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:47:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:49,659 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2021-11-22 19:47:49,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:47:49,660 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:47:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:49,660 INFO L225 Difference]: With dead ends: 118 [2021-11-22 19:47:49,661 INFO L226 Difference]: Without dead ends: 86 [2021-11-22 19:47:49,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:47:49,663 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 84 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:49,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 215 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:47:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-11-22 19:47:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2021-11-22 19:47:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 70 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:47:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2021-11-22 19:47:49,672 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 26 [2021-11-22 19:47:49,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:49,673 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2021-11-22 19:47:49,673 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:47:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2021-11-22 19:47:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-22 19:47:49,677 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:49,677 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] [2021-11-22 19:47:49,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 19:47:49,677 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:49,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:49,678 INFO L85 PathProgramCache]: Analyzing trace with hash 27288689, now seen corresponding path program 1 times [2021-11-22 19:47:49,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:49,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856797956] [2021-11-22 19:47:49,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:49,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:49,903 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:47:49,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:49,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856797956] [2021-11-22 19:47:49,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856797956] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:49,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:49,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:47:49,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827237913] [2021-11-22 19:47:49,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:49,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:47:49,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:49,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:47:49,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:47:49,905 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:47:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:50,037 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2021-11-22 19:47:50,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:47:50,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 27 [2021-11-22 19:47:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:50,038 INFO L225 Difference]: With dead ends: 71 [2021-11-22 19:47:50,038 INFO L226 Difference]: Without dead ends: 69 [2021-11-22 19:47:50,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:47:50,039 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 163 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:50,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 135 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:47:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-11-22 19:47:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-11-22 19:47:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 66 states have (on average 1.106060606060606) internal successors, (73), 68 states have internal predecessors, (73), 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:47:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2021-11-22 19:47:50,043 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 27 [2021-11-22 19:47:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:50,043 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2021-11-22 19:47:50,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:47:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2021-11-22 19:47:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-22 19:47:50,044 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:50,044 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] [2021-11-22 19:47:50,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 19:47:50,044 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:50,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash 508885054, now seen corresponding path program 1 times [2021-11-22 19:47:50,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:50,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883536311] [2021-11-22 19:47:50,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:50,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:50,173 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:47:50,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:50,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883536311] [2021-11-22 19:47:50,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883536311] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:50,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:50,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:47:50,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689899869] [2021-11-22 19:47:50,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:50,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:47:50,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:50,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:47:50,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:47:50,175 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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:47:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:50,287 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2021-11-22 19:47:50,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:47:50,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 30 [2021-11-22 19:47:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:50,288 INFO L225 Difference]: With dead ends: 130 [2021-11-22 19:47:50,289 INFO L226 Difference]: Without dead ends: 88 [2021-11-22 19:47:50,289 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:47:50,290 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 41 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:50,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 152 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:47:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-11-22 19:47:50,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2021-11-22 19:47:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 68 states have internal predecessors, (71), 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:47:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2021-11-22 19:47:50,294 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 30 [2021-11-22 19:47:50,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:50,295 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2021-11-22 19:47:50,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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:47:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2021-11-22 19:47:50,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-22 19:47:50,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:50,297 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] [2021-11-22 19:47:50,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 19:47:50,298 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:50,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:50,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1485259652, now seen corresponding path program 1 times [2021-11-22 19:47:50,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:50,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456821195] [2021-11-22 19:47:50,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:50,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:50,655 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:47:50,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:50,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456821195] [2021-11-22 19:47:50,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456821195] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:50,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:50,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:47:50,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044208226] [2021-11-22 19:47:50,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:50,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:47:50,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:50,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:47:50,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:47:50,656 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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:47:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:50,804 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2021-11-22 19:47:50,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:47:50,804 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 30 [2021-11-22 19:47:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:50,805 INFO L225 Difference]: With dead ends: 99 [2021-11-22 19:47:50,805 INFO L226 Difference]: Without dead ends: 80 [2021-11-22 19:47:50,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:47:50,805 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 98 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:50,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 306 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:47:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-11-22 19:47:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2021-11-22 19:47:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 68 states have internal predecessors, (70), 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:47:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2021-11-22 19:47:50,808 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 30 [2021-11-22 19:47:50,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:50,808 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2021-11-22 19:47:50,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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:47:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2021-11-22 19:47:50,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 19:47:50,809 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:50,809 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] [2021-11-22 19:47:50,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 19:47:50,809 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:50,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:50,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1234346222, now seen corresponding path program 1 times [2021-11-22 19:47:50,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:50,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155027965] [2021-11-22 19:47:50,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:50,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:51,194 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:47:51,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:51,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155027965] [2021-11-22 19:47:51,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155027965] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:51,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:51,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:47:51,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807636027] [2021-11-22 19:47:51,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:51,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:47:51,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:51,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:47:51,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:47:51,196 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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:47:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:51,354 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2021-11-22 19:47:51,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:47:51,355 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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 32 [2021-11-22 19:47:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:51,356 INFO L225 Difference]: With dead ends: 84 [2021-11-22 19:47:51,356 INFO L226 Difference]: Without dead ends: 62 [2021-11-22 19:47:51,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:47:51,356 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 166 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:51,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 129 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:47:51,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-22 19:47:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-22 19:47:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 61 states have internal predecessors, (62), 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:47:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2021-11-22 19:47:51,359 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 32 [2021-11-22 19:47:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:51,359 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2021-11-22 19:47:51,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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:47:51,359 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2021-11-22 19:47:51,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-22 19:47:51,360 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:51,360 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] [2021-11-22 19:47:51,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 19:47:51,360 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:51,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:51,360 INFO L85 PathProgramCache]: Analyzing trace with hash 710433623, now seen corresponding path program 1 times [2021-11-22 19:47:51,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:51,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086057340] [2021-11-22 19:47:51,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:51,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:51,493 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:47:51,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:51,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086057340] [2021-11-22 19:47:51,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086057340] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:51,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:51,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:47:51,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802059104] [2021-11-22 19:47:51,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:51,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:47:51,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:51,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:47:51,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:47:51,495 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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:47:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:51,617 INFO L93 Difference]: Finished difference Result 73 states and 72 transitions. [2021-11-22 19:47:51,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:47:51,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 33 [2021-11-22 19:47:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:51,618 INFO L225 Difference]: With dead ends: 73 [2021-11-22 19:47:51,618 INFO L226 Difference]: Without dead ends: 48 [2021-11-22 19:47:51,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:47:51,619 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 49 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:51,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 185 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:47:51,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-11-22 19:47:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-11-22 19:47:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 47 states have internal predecessors, (47), 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:47:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 47 transitions. [2021-11-22 19:47:51,621 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 47 transitions. Word has length 33 [2021-11-22 19:47:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:51,622 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 47 transitions. [2021-11-22 19:47:51,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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:47:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 47 transitions. [2021-11-22 19:47:51,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 19:47:51,622 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:51,622 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:47:51,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 19:47:51,622 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:51,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:51,623 INFO L85 PathProgramCache]: Analyzing trace with hash -821254579, now seen corresponding path program 1 times [2021-11-22 19:47:51,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:51,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563563728] [2021-11-22 19:47:51,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:51,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:52,017 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:47:52,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:52,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563563728] [2021-11-22 19:47:52,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563563728] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:52,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:52,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:47:52,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550265869] [2021-11-22 19:47:52,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:52,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:47:52,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:52,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:47:52,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:47:52,018 INFO L87 Difference]: Start difference. First operand 48 states and 47 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:47:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:52,402 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2021-11-22 19:47:52,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:47:52,402 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:47:52,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:52,403 INFO L225 Difference]: With dead ends: 48 [2021-11-22 19:47:52,403 INFO L226 Difference]: Without dead ends: 46 [2021-11-22 19:47:52,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:47:52,403 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 127 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:52,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 120 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:47:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-11-22 19:47:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-11-22 19:47:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0) internal successors, (45), 45 states have internal predecessors, (45), 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:47:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2021-11-22 19:47:52,407 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 36 [2021-11-22 19:47:52,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:52,407 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2021-11-22 19:47:52,408 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:47:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2021-11-22 19:47:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-22 19:47:52,408 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:47:52,408 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] [2021-11-22 19:47:52,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 19:47:52,409 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 19:47:52,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:47:52,409 INFO L85 PathProgramCache]: Analyzing trace with hash -170747851, now seen corresponding path program 1 times [2021-11-22 19:47:52,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:47:52,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219754971] [2021-11-22 19:47:52,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:47:52,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:47:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:47:53,134 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:47:53,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:47:53,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219754971] [2021-11-22 19:47:53,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219754971] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:47:53,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:47:53,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:47:53,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200609183] [2021-11-22 19:47:53,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:47:53,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:47:53,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:47:53,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:47:53,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:47:53,137 INFO L87 Difference]: Start difference. First operand 46 states and 45 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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:47:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:47:53,288 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2021-11-22 19:47:53,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:47:53,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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 45 [2021-11-22 19:47:53,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:47:53,289 INFO L225 Difference]: With dead ends: 46 [2021-11-22 19:47:53,289 INFO L226 Difference]: Without dead ends: 0 [2021-11-22 19:47:53,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:47:53,290 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 105 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:47:53,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 125 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:47:53,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-22 19:47:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-22 19:47:53,291 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:47:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-22 19:47:53,291 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2021-11-22 19:47:53,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:47:53,292 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-22 19:47:53,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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:47:53,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-22 19:47:53,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-22 19:47:53,294 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-22 19:47:53,294 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-22 19:47:53,294 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-22 19:47:53,294 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-22 19:47:53,295 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-22 19:47:53,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 19:47:53,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-22 19:47:54,929 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:47:54,930 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:47:54,930 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-22 19:47:54,930 INFO L858 garLoopResultBuilder]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,930 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-22 19:47:54,930 INFO L858 garLoopResultBuilder]: For program point L7386-4(lines 7386 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,930 INFO L854 garLoopResultBuilder]: At program point L7386-3(lines 7384 7388) the Hoare annotation is: (let ((.cse15 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) (let ((.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset|)) (.cse4 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset|)) (.cse5 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1| 1)) (.cse8 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse10 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse11 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_bounded_malloc_~size#1|)) (.cse12 (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|)) (.cse13 (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0)) (.cse7 (* 18446744073709551616 .cse15)) (.cse14 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1|))) (or (let ((.cse0 (* .cse15 18446744073709551616)) (.cse1 (* |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (- 1))) (.cse6 (+ |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 8))) (and (<= (* 18446744073709551616 (div (+ |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| 18446744073709551615 .cse0 .cse1) 18446744073709551616)) |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse2 .cse3 (<= (* 18446744073709551616 (div (+ 18446744073709551615 .cse4 .cse0 .cse1) 18446744073709551616)) .cse4) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) .cse5 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse6) 0) (<= (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| 18446744073709551616))) (+ |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| .cse7)) (<= .cse4 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse4 .cse0 .cse1) 18446744073709551616)))) (<= |ULTIMATE.start_bounded_malloc_~size#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_bounded_malloc_~size#1| 18446744073709551616)) 36028797018963967)) .cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse9 .cse10 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse11 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse6)) .cse12 .cse13 .cse14)) (and .cse2 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) (+ |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 8)) 0)) (<= .cse4 (* 18446744073709551616 (div .cse4 18446744073709551616))) .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse7) .cse14)))) [2021-11-22 19:47:54,930 INFO L858 garLoopResultBuilder]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,930 INFO L854 garLoopResultBuilder]: At program point L7386-7(lines 7384 7388) the Hoare annotation is: (let ((.cse15 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616)) (.cse3 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse12 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse3)) (.cse2 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|))) (.cse10 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse4 (<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)) (.cse5 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1| 1)) (.cse7 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_bounded_malloc_~size#1|)) (.cse11 (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0)) (.cse6 (* 18446744073709551616 .cse15)) (.cse13 (<= (div |ULTIMATE.start___VERIFIER_assert_~cond#1| 256) 0)) (.cse14 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1|))) (or (let ((.cse0 (* .cse15 18446744073709551616)) (.cse1 (* |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (- 1)))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) (<= (* 18446744073709551616 (div (+ |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| 18446744073709551615 .cse0 .cse1) 18446744073709551616)) |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse3) 0) .cse4 (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) .cse5 (<= (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| 18446744073709551616))) (+ |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| .cse6)) (<= |ULTIMATE.start_bounded_malloc_~size#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_bounded_malloc_~size#1| 18446744073709551616)) 36028797018963967)) .cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse8 (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse0 .cse1 |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) 18446744073709551616)))) .cse9 (<= .cse10 (+ (* 18446744073709551616 (div (+ .cse10 .cse0 .cse1) 18446744073709551616)) 18446744073709551615)) .cse11 (<= (* 18446744073709551616 (div (+ 18446744073709551615 .cse0 .cse1 |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) 18446744073709551616)) |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= .cse12 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (<= (* 18446744073709551616 (div (+ .cse10 18446744073709551615 .cse0 .cse1) 18446744073709551616)) .cse10) .cse13 .cse14)) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (not (= .cse12 0)) .cse2 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) (+ |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 8)) 0)) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (+ .cse10 (* 18446744073709551616 (div (+ (* .cse10 (- 1)) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) 18446744073709551616)))) (let ((.cse16 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset|))) (<= .cse16 (* 18446744073709551616 (div .cse16 18446744073709551616)))) .cse4 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| 18446744073709551616))) .cse5 .cse7 .cse8 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse9 .cse11 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse6) .cse13 .cse14)))) [2021-11-22 19:47:54,930 INFO L858 garLoopResultBuilder]: For program point L7386-6(lines 7386 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,930 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:47:54,930 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387-12(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387-17(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387-16(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387-14(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387-20(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387-18(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387-23(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7387-22(line 7387) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-11-22 19:47:54,931 INFO L861 garLoopResultBuilder]: At program point L8974(line 8974) the Hoare annotation is: true [2021-11-22 19:47:54,932 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_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_bounded_malloc_~size#1|)) [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L854 garLoopResultBuilder]: At program point L8257(lines 8251 8258) the Hoare annotation is: (let ((.cse15 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) (+ |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 8)) 0))) (.cse3 (<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)) (.cse4 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1| 1)) (.cse10 (* 18446744073709551616 .cse15)) (.cse5 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse7 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_bounded_malloc_~size#1|)) (.cse2 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset|)) (.cse9 (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0)) (.cse11 (<= (div |ULTIMATE.start___VERIFIER_assert_~cond#1| 256) 0)) (.cse12 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1|))) (or (and .cse0 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) .cse1 (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616))) .cse3 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| 18446744073709551616))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse10) .cse11 .cse12) (let ((.cse13 (* .cse15 18446744073709551616)) (.cse14 (* |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (- 1)))) (and (<= (* 18446744073709551616 (div (+ |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| 18446744073709551615 .cse13 .cse14) 18446744073709551616)) |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse3 (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) .cse4 (<= (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| 18446744073709551616))) (+ |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| .cse10)) (<= |ULTIMATE.start_bounded_malloc_~size#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_bounded_malloc_~size#1| 18446744073709551616)) 36028797018963967)) .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse13 .cse14 |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) 18446744073709551616)))) .cse8 (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616)))) .cse9 (<= (* 18446744073709551616 (div (+ 18446744073709551615 .cse13 .cse14 |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) 18446744073709551616)) |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| (+ (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) 18446744073709551616)) 18446744073709551615)) .cse11 .cse12))))) [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8973) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L7101(lines 7101 7111) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-22 19:47:54,932 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:47:54,933 INFO L858 garLoopResultBuilder]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2021-11-22 19:47:54,933 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (let ((.cse3 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) (let ((.cse2 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8)) (.cse0 (* .cse3 18446744073709551616)) (.cse1 (* |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (- 1))) (.cse4 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|))) (and (<= (* 18446744073709551616 (div (+ |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| 18446744073709551615 .cse0 .cse1) 18446744073709551616)) |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) (+ |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| |ULTIMATE.start_assert_bytes_match_~a#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse2) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (<= (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| 18446744073709551616))) (+ |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| (* 18446744073709551616 .cse3))) (<= |ULTIMATE.start_bounded_malloc_~size#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_bounded_malloc_~size#1| 18446744073709551616)) 36028797018963967)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse0 .cse1 |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) 18446744073709551616)))) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_bounded_malloc_~size#1|) (<= .cse4 (+ (* 18446744073709551616 (div (+ .cse4 .cse0 .cse1) 18446744073709551616)) 18446744073709551615)) (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0) (<= (* 18446744073709551616 (div (+ 18446744073709551615 .cse0 .cse1 |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) 18446744073709551616)) |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse2) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (<= (* 18446744073709551616 (div (+ .cse4 18446744073709551615 .cse0 .cse1) 18446744073709551616)) .cse4) (<= (div |ULTIMATE.start___VERIFIER_assert_~cond#1| 256) 0)))) [2021-11-22 19:47:54,933 INFO L858 garLoopResultBuilder]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2021-11-22 19:47:54,936 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:47:54,937 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 19:47:54,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,942 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:47:54,943 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,943 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,947 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:47:54,947 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,950 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,950 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,951 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:47:54,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:47:54,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,956 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:47:54,956 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,957 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,958 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,958 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:47:54,958 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,958 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,958 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,959 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:54,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:54,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 07:47:54 BoogieIcfgContainer [2021-11-22 19:47:54,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 19:47:54,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 19:47:54,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 19:47:54,961 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 19:47:54,961 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:47:45" (3/4) ... [2021-11-22 19:47:54,963 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-22 19:47:54,975 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 126 nodes and edges [2021-11-22 19:47:54,976 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-11-22 19:47:54,977 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-11-22 19:47:54,978 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-22 19:47:54,979 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-22 19:47:54,980 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-22 19:47:54,980 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-22 19:47:54,981 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-22 19:47:54,997 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((cond == 1 && \result == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && length == size [2021-11-22 19:47:54,998 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((18446744073709551616 * ((len + 18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) <= len && array == 0) && cur == 0) && cursor == cur) && 18446744073709551616 * ((18446744073709551615 + unknown-#memory_int-unknown[cursor][cursor] + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) <= unknown-#memory_int-unknown[cursor][cursor]) && \result == 0) && \result <= 1) && #memory_$Pointer$[cur][cur + 8] == 0) && length + 18446744073709551616 * (len / 18446744073709551616) <= len + 18446744073709551616 * (length / 18446744073709551616)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[cursor][cursor] + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(cur == 0)) && bytes == 0) && !(\result == 0)) && !(array == 0)) && array == bytes) && length == size) && array == #memory_$Pointer$[cur][cur + 8]) && cursor == cur) && cursor == 0) && 1 <= \result) || (((((((((((((cur == 0 && !(0 == bytes)) && cursor == cur) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && \result <= 1) && !(cur == 0)) && !(\result == 0)) && !(array == 0)) && length == size) && cursor == cur) && cursor == 0) && length <= 18446744073709551616 * (length / 18446744073709551616)) && 1 <= \result) [2021-11-22 19:47:54,998 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((cur == 0 && !(0 == bytes)) && !(aws_byte_cursor_from_array_#res#1.ptr == 0)) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && 1 <= cond) && unknown-#res!len-unknown <= 18446744073709551616 * (unknown-#res!len-unknown / 18446744073709551616)) && \result <= 1) && !(cur == 0)) && !(\result == 0)) && !(array == 0)) && length == size) && cursor == 0) && length <= 18446744073709551616 * (length / 18446744073709551616)) && cond / 256 <= 0) && 1 <= \result) || (((((((((((((((((((((((18446744073709551616 * ((len + 18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) <= len && array == 0) && cur == 0) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && aws_byte_cursor_from_array_#res#1.ptr == 0) && 1 <= cond) && \result == 0) && \result <= 1) && length + 18446744073709551616 * (len / 18446744073709551616) <= len + 18446744073709551616 * (length / 18446744073709551616)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(cur == 0)) && bytes == 0) && !(\result == 0)) && aws_byte_cursor_from_array_#res#1.ptr == array) && !(array == 0)) && array == bytes) && unknown-#res!len-unknown <= 18446744073709551615 + 18446744073709551616 * ((length / 18446744073709551616 * 18446744073709551616 + length * -1 + unknown-#res!len-unknown) / 18446744073709551616)) && length == size) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[cursor][cursor]) / 18446744073709551616)) && cursor == 0) && 18446744073709551616 * ((18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1 + unknown-#res!len-unknown) / 18446744073709551616) <= unknown-#res!len-unknown) && unknown-#res!len-unknown <= 18446744073709551616 * ((-1 + unknown-#res!len-unknown) / 18446744073709551616) + 18446744073709551615) && cond / 256 <= 0) && 1 <= \result) [2021-11-22 19:47:54,998 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((cur == cursor && 18446744073709551616 * ((len + 18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) <= len) && array == 0) && !(0 == bytes)) && aws_byte_cursor_from_array_#res#1.ptr == 0) && #memory_$Pointer$[cur][cur + 8] == 0) && 1 <= cond) && \result == 0) && \result <= 1) && length + 18446744073709551616 * (len / 18446744073709551616) <= len + 18446744073709551616 * (length / 18446744073709551616)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(cur == 0)) && bytes == 0) && !(\result == 0)) && cursor == cur) && aws_byte_cursor_from_array_#res#1.ptr == array) && array == bytes) && unknown-#res!len-unknown <= 18446744073709551615 + 18446744073709551616 * ((length / 18446744073709551616 * 18446744073709551616 + length * -1 + unknown-#res!len-unknown) / 18446744073709551616)) && length == size) && unknown-#memory_int-unknown[cur][cur] <= 18446744073709551616 * ((unknown-#memory_int-unknown[cur][cur] + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) + 18446744073709551615) && cursor == 0) && 18446744073709551616 * ((18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1 + unknown-#res!len-unknown) / 18446744073709551616) <= unknown-#res!len-unknown) && #memory_$Pointer$[cur][cur + 8] == array) && 18446744073709551616 * ((unknown-#memory_int-unknown[cur][cur] + 18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) <= unknown-#memory_int-unknown[cur][cur]) && cond / 256 <= 0) && 1 <= \result) || (((((((((((((((((cur == 0 && !(#memory_$Pointer$[cur][cur + 8] == 0)) && !(0 == bytes)) && !(aws_byte_cursor_from_array_#res#1.ptr == 0)) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && length <= unknown-#memory_int-unknown[cur][cur] + 18446744073709551616 * ((unknown-#memory_int-unknown[cur][cur] * -1 + length) / 18446744073709551616)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && 1 <= cond) && unknown-#res!len-unknown <= 18446744073709551616 * (unknown-#res!len-unknown / 18446744073709551616)) && \result <= 1) && !(cur == 0)) && !(\result == 0)) && !(array == 0)) && length == size) && cursor == 0) && length <= 18446744073709551616 * (length / 18446744073709551616)) && cond / 256 <= 0) && 1 <= \result) [2021-11-22 19:47:54,999 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((18446744073709551616 * ((len + 18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) <= len && array == 0) && cur == 0) && !(0 == bytes)) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && aws_byte_cursor_from_array_#res#1.ptr == 0) && b == a) && #memory_$Pointer$[cur][cur + 8] == 0) && 1 <= cond) && \result == 0) && length + 18446744073709551616 * (len / 18446744073709551616) <= len + 18446744073709551616 * (length / 18446744073709551616)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(cur == 0)) && bytes == 0) && !(\result == 0)) && aws_byte_cursor_from_array_#res#1.ptr == array) && array == bytes) && unknown-#res!len-unknown <= 18446744073709551615 + 18446744073709551616 * ((length / 18446744073709551616 * 18446744073709551616 + length * -1 + unknown-#res!len-unknown) / 18446744073709551616)) && length == size) && unknown-#memory_int-unknown[cur][cur] <= 18446744073709551616 * ((unknown-#memory_int-unknown[cur][cur] + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) + 18446744073709551615) && cursor == 0) && 18446744073709551616 * ((18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1 + unknown-#res!len-unknown) / 18446744073709551616) <= unknown-#res!len-unknown) && b == a) && #memory_$Pointer$[cur][cur + 8] == array) && 18446744073709551616 * ((unknown-#memory_int-unknown[cur][cur] + 18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) <= unknown-#memory_int-unknown[cur][cur]) && cond / 256 <= 0 [2021-11-22 19:47:55,519 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-22 19:47:55,519 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 19:47:55,520 INFO L158 Benchmark]: Toolchain (without parser) took 13081.28ms. Allocated memory was 109.1MB in the beginning and 381.7MB in the end (delta: 272.6MB). Free memory was 69.0MB in the beginning and 303.1MB in the end (delta: -234.1MB). Peak memory consumption was 259.8MB. Max. memory is 16.1GB. [2021-11-22 19:47:55,520 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 77.6MB. Free memory is still 40.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 19:47:55,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2147.75ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 68.7MB in the beginning and 77.1MB in the end (delta: -8.3MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2021-11-22 19:47:55,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.56ms. Allocated memory is still 132.1MB. Free memory was 77.1MB in the beginning and 65.3MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-22 19:47:55,521 INFO L158 Benchmark]: Boogie Preprocessor took 65.40ms. Allocated memory is still 132.1MB. Free memory was 65.3MB in the beginning and 59.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-22 19:47:55,521 INFO L158 Benchmark]: RCFGBuilder took 1047.57ms. Allocated memory was 132.1MB in the beginning and 180.4MB in the end (delta: 48.2MB). Free memory was 59.0MB in the beginning and 124.4MB in the end (delta: -65.4MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2021-11-22 19:47:55,521 INFO L158 Benchmark]: TraceAbstraction took 9101.14ms. Allocated memory was 180.4MB in the beginning and 381.7MB in the end (delta: 201.3MB). Free memory was 123.6MB in the beginning and 220.7MB in the end (delta: -97.2MB). Peak memory consumption was 220.1MB. Max. memory is 16.1GB. [2021-11-22 19:47:55,521 INFO L158 Benchmark]: Witness Printer took 558.83ms. Allocated memory is still 381.7MB. Free memory was 220.7MB in the beginning and 303.1MB in the end (delta: -82.4MB). Peak memory consumption was 138.9MB. Max. memory is 16.1GB. [2021-11-22 19:47:55,522 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.19ms. Allocated memory is still 77.6MB. Free memory is still 40.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2147.75ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 68.7MB in the beginning and 77.1MB in the end (delta: -8.3MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 149.56ms. Allocated memory is still 132.1MB. Free memory was 77.1MB in the beginning and 65.3MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.40ms. Allocated memory is still 132.1MB. Free memory was 65.3MB in the beginning and 59.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1047.57ms. Allocated memory was 132.1MB in the beginning and 180.4MB in the end (delta: 48.2MB). Free memory was 59.0MB in the beginning and 124.4MB in the end (delta: -65.4MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9101.14ms. Allocated memory was 180.4MB in the beginning and 381.7MB in the end (delta: 201.3MB). Free memory was 123.6MB in the beginning and 220.7MB in the end (delta: -97.2MB). Peak memory consumption was 220.1MB. Max. memory is 16.1GB. * Witness Printer took 558.83ms. Allocated memory is still 381.7MB. Free memory was 220.7MB in the beginning and 303.1MB in the end (delta: -82.4MB). Peak memory consumption was 138.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $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: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $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_cursor_from_array_#res#1 : { len : int, ptr : $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: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $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_cursor_from_array_#res#1 : { len : int, ptr : $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_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $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_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $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$.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$.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_cursor_from_array_#res#1 : { len : int, ptr : $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: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $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_cursor_from_array_#res#1 : { len : int, ptr : $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_cursor_from_array_#res#1 : { len : int, ptr : $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: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $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_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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, 61 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1673 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1673 mSDsluCounter, 3018 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2202 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1439 IncrementalHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 816 mSDtfsCounter, 1439 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=9, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 200 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 1031 HoareAnnotationTreeSize, 6 FomulaSimplifications, 200 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 4902 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 417 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 4535 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 5 specifications checked. All of them hold - InvariantResult [Line: 266]: Loop Invariant [2021-11-22 19:47:55,534 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:55,534 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:55,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:47:55,535 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:55,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:55,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:55,536 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:55,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:47:55,536 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:55,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((18446744073709551616 * ((len + 18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) <= len && array == 0) && cur == 0) && !(0 == bytes)) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && aws_byte_cursor_from_array_#res#1.ptr == 0) && b == a) && #memory_$Pointer$[cur][cur + 8] == 0) && 1 <= cond) && \result == 0) && length + 18446744073709551616 * (len / 18446744073709551616) <= len + 18446744073709551616 * (length / 18446744073709551616)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(cur == 0)) && bytes == 0) && !(\result == 0)) && aws_byte_cursor_from_array_#res#1.ptr == array) && array == bytes) && unknown-#res!len-unknown <= 18446744073709551615 + 18446744073709551616 * ((length / 18446744073709551616 * 18446744073709551616 + length * -1 + unknown-#res!len-unknown) / 18446744073709551616)) && length == size) && unknown-#memory_int-unknown[cur][cur] <= 18446744073709551616 * ((unknown-#memory_int-unknown[cur][cur] + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) + 18446744073709551615) && cursor == 0) && 18446744073709551616 * ((18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1 + unknown-#res!len-unknown) / 18446744073709551616) <= unknown-#res!len-unknown) && b == a) && #memory_$Pointer$[cur][cur + 8] == array) && 18446744073709551616 * ((unknown-#memory_int-unknown[cur][cur] + 18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) <= unknown-#memory_int-unknown[cur][cur]) && cond / 256 <= 0 - InvariantResult [Line: 8974]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8251]: Loop Invariant [2021-11-22 19:47:55,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:55,537 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:55,537 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:55,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:55,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:55,538 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:55,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:55,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:55,538 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:55,539 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled Derived loop invariant: (((((((((((((((cur == 0 && !(0 == bytes)) && !(aws_byte_cursor_from_array_#res#1.ptr == 0)) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && 1 <= cond) && unknown-#res!len-unknown <= 18446744073709551616 * (unknown-#res!len-unknown / 18446744073709551616)) && \result <= 1) && !(cur == 0)) && !(\result == 0)) && !(array == 0)) && length == size) && cursor == 0) && length <= 18446744073709551616 * (length / 18446744073709551616)) && cond / 256 <= 0) && 1 <= \result) || (((((((((((((((((((((((18446744073709551616 * ((len + 18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) <= len && array == 0) && cur == 0) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && aws_byte_cursor_from_array_#res#1.ptr == 0) && 1 <= cond) && \result == 0) && \result <= 1) && length + 18446744073709551616 * (len / 18446744073709551616) <= len + 18446744073709551616 * (length / 18446744073709551616)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(cur == 0)) && bytes == 0) && !(\result == 0)) && aws_byte_cursor_from_array_#res#1.ptr == array) && !(array == 0)) && array == bytes) && unknown-#res!len-unknown <= 18446744073709551615 + 18446744073709551616 * ((length / 18446744073709551616 * 18446744073709551616 + length * -1 + unknown-#res!len-unknown) / 18446744073709551616)) && length == size) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[cursor][cursor]) / 18446744073709551616)) && cursor == 0) && 18446744073709551616 * ((18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1 + unknown-#res!len-unknown) / 18446744073709551616) <= unknown-#res!len-unknown) && unknown-#res!len-unknown <= 18446744073709551616 * ((-1 + unknown-#res!len-unknown) / 18446744073709551616) + 18446744073709551615) && cond / 256 <= 0) && 1 <= \result) - InvariantResult [Line: 7384]: Loop Invariant [2021-11-22 19:47:55,539 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:47:55,539 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:55,540 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:55,540 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:47:55,540 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:55,540 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((18446744073709551616 * ((len + 18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) <= len && array == 0) && cur == 0) && cursor == cur) && 18446744073709551616 * ((18446744073709551615 + unknown-#memory_int-unknown[cursor][cursor] + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) <= unknown-#memory_int-unknown[cursor][cursor]) && \result == 0) && \result <= 1) && #memory_$Pointer$[cur][cur + 8] == 0) && length + 18446744073709551616 * (len / 18446744073709551616) <= len + 18446744073709551616 * (length / 18446744073709551616)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[cursor][cursor] + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(cur == 0)) && bytes == 0) && !(\result == 0)) && !(array == 0)) && array == bytes) && length == size) && array == #memory_$Pointer$[cur][cur + 8]) && cursor == cur) && cursor == 0) && 1 <= \result) || (((((((((((((cur == 0 && !(0 == bytes)) && cursor == cur) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && \result <= 1) && !(cur == 0)) && !(\result == 0)) && !(array == 0)) && length == size) && cursor == cur) && cursor == 0) && length <= 18446744073709551616 * (length / 18446744073709551616)) && 1 <= \result) - InvariantResult [Line: 7384]: Loop Invariant [2021-11-22 19:47:55,541 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:55,541 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:47:55,541 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:55,541 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:55,542 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:55,542 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:55,542 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:55,542 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:55,542 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:47:55,543 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:55,543 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:55,543 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:47:55,543 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-22 19:47:55,543 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((cur == cursor && 18446744073709551616 * ((len + 18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) <= len) && array == 0) && !(0 == bytes)) && aws_byte_cursor_from_array_#res#1.ptr == 0) && #memory_$Pointer$[cur][cur + 8] == 0) && 1 <= cond) && \result == 0) && \result <= 1) && length + 18446744073709551616 * (len / 18446744073709551616) <= len + 18446744073709551616 * (length / 18446744073709551616)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(cur == 0)) && bytes == 0) && !(\result == 0)) && cursor == cur) && aws_byte_cursor_from_array_#res#1.ptr == array) && array == bytes) && unknown-#res!len-unknown <= 18446744073709551615 + 18446744073709551616 * ((length / 18446744073709551616 * 18446744073709551616 + length * -1 + unknown-#res!len-unknown) / 18446744073709551616)) && length == size) && unknown-#memory_int-unknown[cur][cur] <= 18446744073709551616 * ((unknown-#memory_int-unknown[cur][cur] + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) + 18446744073709551615) && cursor == 0) && 18446744073709551616 * ((18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1 + unknown-#res!len-unknown) / 18446744073709551616) <= unknown-#res!len-unknown) && #memory_$Pointer$[cur][cur + 8] == array) && 18446744073709551616 * ((unknown-#memory_int-unknown[cur][cur] + 18446744073709551615 + length / 18446744073709551616 * 18446744073709551616 + length * -1) / 18446744073709551616) <= unknown-#memory_int-unknown[cur][cur]) && cond / 256 <= 0) && 1 <= \result) || (((((((((((((((((cur == 0 && !(#memory_$Pointer$[cur][cur + 8] == 0)) && !(0 == bytes)) && !(aws_byte_cursor_from_array_#res#1.ptr == 0)) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && length <= unknown-#memory_int-unknown[cur][cur] + 18446744073709551616 * ((unknown-#memory_int-unknown[cur][cur] * -1 + length) / 18446744073709551616)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && 1 <= cond) && unknown-#res!len-unknown <= 18446744073709551616 * (unknown-#res!len-unknown / 18446744073709551616)) && \result <= 1) && !(cur == 0)) && !(\result == 0)) && !(array == 0)) && length == size) && cursor == 0) && length <= 18446744073709551616 * (length / 18446744073709551616)) && cond / 256 <= 0) && 1 <= \result) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (((cond == 1 && \result == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && length == size RESULT: Ultimate proved your program to be correct! [2021-11-22 19:47:55,551 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