./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_secure_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_secure_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 e401a4e4197b43467958a92870f8195ba22195c146137fa78352c627ea2eeb40 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 19:20:02,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 19:20:02,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 19:20:02,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 19:20:02,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 19:20:02,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 19:20:02,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 19:20:02,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 19:20:02,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 19:20:02,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 19:20:02,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 19:20:02,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 19:20:02,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 19:20:02,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 19:20:02,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 19:20:02,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 19:20:02,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 19:20:02,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 19:20:02,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 19:20:02,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 19:20:02,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 19:20:02,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 19:20:02,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 19:20:02,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 19:20:02,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 19:20:02,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 19:20:02,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 19:20:02,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 19:20:02,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 19:20:02,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 19:20:02,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 19:20:02,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 19:20:02,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 19:20:02,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 19:20:02,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 19:20:02,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 19:20:02,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 19:20:02,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 19:20:02,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 19:20:02,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 19:20:02,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 19:20:02,917 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:20:02,948 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 19:20:02,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 19:20:02,949 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 19:20:02,949 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 19:20:02,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 19:20:02,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 19:20:02,957 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 19:20:02,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 19:20:02,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 19:20:02,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 19:20:02,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 19:20:02,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 19:20:02,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 19:20:02,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 19:20:02,960 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 19:20:02,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 19:20:02,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 19:20:02,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 19:20:02,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 19:20:02,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:20:02,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 19:20:02,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 19:20:02,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 19:20:02,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 19:20:02,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 19:20:02,963 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 19:20:02,963 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 19:20:02,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 19:20:02,963 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 19:20:02,963 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 -> e401a4e4197b43467958a92870f8195ba22195c146137fa78352c627ea2eeb40 [2021-11-22 19:20:03,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 19:20:03,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 19:20:03,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 19:20:03,208 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 19:20:03,209 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 19:20:03,210 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_secure_harness.i [2021-11-22 19:20:03,271 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/266111403/50d6dddc19034697bc91f4e8b1dd7163/FLAGe0b6daf27 [2021-11-22 19:20:03,907 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 19:20:03,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_secure_harness.i [2021-11-22 19:20:03,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/266111403/50d6dddc19034697bc91f4e8b1dd7163/FLAGe0b6daf27 [2021-11-22 19:20:04,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/266111403/50d6dddc19034697bc91f4e8b1dd7163 [2021-11-22 19:20:04,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 19:20:04,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 19:20:04,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 19:20:04,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 19:20:04,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 19:20:04,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:20:04" (1/1) ... [2021-11-22 19:20:04,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d048a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:04, skipping insertion in model container [2021-11-22 19:20:04,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:20:04" (1/1) ... [2021-11-22 19:20:04,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 19:20:04,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 19:20:04,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_secure_harness.i[4502,4515] [2021-11-22 19:20:04,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_secure_harness.i[4562,4575] [2021-11-22 19:20:05,114 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,114 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,115 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,121 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,123 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,132 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,133 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,134 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,134 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,349 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:20:05,350 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:20:05,351 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:20:05,351 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:20:05,352 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:20:05,352 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:20:05,353 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:20:05,353 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:20:05,354 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:20:05,354 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:20:05,434 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:20:05,508 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,509 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,560 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:20:05,599 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 19:20:05,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_secure_harness.i[4502,4515] [2021-11-22 19:20:05,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_clean_up_secure_harness.i[4562,4575] [2021-11-22 19:20:05,651 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,651 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,651 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,652 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,652 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,655 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,656 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,656 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,656 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,695 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:20:05,696 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:20:05,696 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:20:05,697 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:20:05,697 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:20:05,698 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:20:05,698 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:20:05,699 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:20:05,699 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:20:05,699 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:20:05,725 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:20:05,769 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,769 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:05,797 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:20:05,941 INFO L208 MainTranslator]: Completed translation [2021-11-22 19:20:05,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:05 WrapperNode [2021-11-22 19:20:05,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 19:20:05,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 19:20:05,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 19:20:05,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 19:20:05,960 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:20:05" (1/1) ... [2021-11-22 19:20:06,081 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:20:05" (1/1) ... [2021-11-22 19:20:06,154 INFO L137 Inliner]: procedures = 691, calls = 2504, calls flagged for inlining = 888, calls inlined = 36, statements flattened = 1193 [2021-11-22 19:20:06,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 19:20:06,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 19:20:06,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 19:20:06,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 19:20:06,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:05" (1/1) ... [2021-11-22 19:20:06,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:05" (1/1) ... [2021-11-22 19:20:06,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:05" (1/1) ... [2021-11-22 19:20:06,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:05" (1/1) ... [2021-11-22 19:20:06,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:05" (1/1) ... [2021-11-22 19:20:06,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:05" (1/1) ... [2021-11-22 19:20:06,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:05" (1/1) ... [2021-11-22 19:20:06,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 19:20:06,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 19:20:06,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 19:20:06,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 19:20:06,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:05" (1/1) ... [2021-11-22 19:20:06,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:20:06,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:20:06,257 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:20:06,263 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:20:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 19:20:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 19:20:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 19:20:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 19:20:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 19:20:06,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 19:20:06,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 19:20:06,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 19:20:06,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 19:20:06,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 19:20:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 19:20:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 19:20:06,503 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 19:20:06,504 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 19:20:07,349 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 19:20:07,354 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 19:20:07,354 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 19:20:07,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:20:07 BoogieIcfgContainer [2021-11-22 19:20:07,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 19:20:07,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 19:20:07,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 19:20:07,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 19:20:07,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:20:04" (1/3) ... [2021-11-22 19:20:07,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd0e445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:20:07, skipping insertion in model container [2021-11-22 19:20:07,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:05" (2/3) ... [2021-11-22 19:20:07,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd0e445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:20:07, skipping insertion in model container [2021-11-22 19:20:07,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:20:07" (3/3) ... [2021-11-22 19:20:07,361 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_clean_up_secure_harness.i [2021-11-22 19:20:07,364 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 19:20:07,364 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-22 19:20:07,393 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 19:20:07,397 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:20:07,398 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-22 19:20:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 161 states have internal predecessors, (226), 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:20:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 19:20:07,413 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:07,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:07,414 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:07,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2094162133, now seen corresponding path program 1 times [2021-11-22 19:20:07,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:07,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905635963] [2021-11-22 19:20:07,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:07,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:07,789 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:20:07,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:07,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905635963] [2021-11-22 19:20:07,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905635963] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:07,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:07,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 19:20:07,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281927049] [2021-11-22 19:20:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:07,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 19:20:07,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:07,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 19:20:07,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:20:07,820 INFO L87 Difference]: Start difference. First operand has 162 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 161 states have internal predecessors, (226), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:07,855 INFO L93 Difference]: Finished difference Result 320 states and 447 transitions. [2021-11-22 19:20:07,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 19:20:07,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-22 19:20:07,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:07,865 INFO L225 Difference]: With dead ends: 320 [2021-11-22 19:20:07,865 INFO L226 Difference]: Without dead ends: 157 [2021-11-22 19:20:07,868 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:20:07,873 INFO L933 BasicCegarLoop]: 210 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, 210 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:20:07,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:20:07,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-11-22 19:20:07,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-11-22 19:20:07,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 151 states have (on average 1.3576158940397351) internal successors, (205), 156 states have internal predecessors, (205), 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:20:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2021-11-22 19:20:07,910 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 205 transitions. Word has length 34 [2021-11-22 19:20:07,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:07,912 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 205 transitions. [2021-11-22 19:20:07,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 205 transitions. [2021-11-22 19:20:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 19:20:07,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:07,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:07,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 19:20:07,916 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:07,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:07,918 INFO L85 PathProgramCache]: Analyzing trace with hash 944442029, now seen corresponding path program 1 times [2021-11-22 19:20:07,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:07,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157529425] [2021-11-22 19:20:07,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:07,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:08,108 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:20:08,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:08,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157529425] [2021-11-22 19:20:08,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157529425] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:08,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:08,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:20:08,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296507107] [2021-11-22 19:20:08,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:08,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:20:08,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:08,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:20:08,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:20:08,112 INFO L87 Difference]: Start difference. First operand 157 states and 205 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:08,204 INFO L93 Difference]: Finished difference Result 288 states and 376 transitions. [2021-11-22 19:20:08,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 19:20:08,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-22 19:20:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:08,207 INFO L225 Difference]: With dead ends: 288 [2021-11-22 19:20:08,207 INFO L226 Difference]: Without dead ends: 157 [2021-11-22 19:20:08,210 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:20:08,214 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 296 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:08,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 263 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:20:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-11-22 19:20:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-11-22 19:20:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 151 states have (on average 1.3443708609271523) internal successors, (203), 156 states have internal predecessors, (203), 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:20:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2021-11-22 19:20:08,231 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 34 [2021-11-22 19:20:08,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:08,231 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2021-11-22 19:20:08,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2021-11-22 19:20:08,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-22 19:20:08,236 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:08,236 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:08,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 19:20:08,237 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:08,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:08,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1219890353, now seen corresponding path program 1 times [2021-11-22 19:20:08,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:08,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759091056] [2021-11-22 19:20:08,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:08,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:08,387 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:20:08,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:08,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759091056] [2021-11-22 19:20:08,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759091056] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:08,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:08,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:20:08,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155271075] [2021-11-22 19:20:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:08,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:20:08,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:08,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:20:08,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:20:08,390 INFO L87 Difference]: Start difference. First operand 157 states and 203 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:08,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:08,480 INFO L93 Difference]: Finished difference Result 349 states and 458 transitions. [2021-11-22 19:20:08,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:20:08,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-22 19:20:08,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:08,481 INFO L225 Difference]: With dead ends: 349 [2021-11-22 19:20:08,481 INFO L226 Difference]: Without dead ends: 217 [2021-11-22 19:20:08,482 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:20:08,483 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 129 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:08,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 538 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:20:08,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-22 19:20:08,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 169. [2021-11-22 19:20:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 163 states have (on average 1.3190184049079754) internal successors, (215), 168 states have internal predecessors, (215), 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:20:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 215 transitions. [2021-11-22 19:20:08,488 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 215 transitions. Word has length 46 [2021-11-22 19:20:08,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:08,489 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 215 transitions. [2021-11-22 19:20:08,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:08,489 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 215 transitions. [2021-11-22 19:20:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-22 19:20:08,490 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:08,490 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:08,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 19:20:08,490 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:08,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:08,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1921490227, now seen corresponding path program 1 times [2021-11-22 19:20:08,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:08,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490492137] [2021-11-22 19:20:08,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:08,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:08,665 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:20:08,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:08,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490492137] [2021-11-22 19:20:08,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490492137] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:08,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:08,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:20:08,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577418373] [2021-11-22 19:20:08,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:08,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:20:08,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:08,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:20:08,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:20:08,667 INFO L87 Difference]: Start difference. First operand 169 states and 215 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:08,722 INFO L93 Difference]: Finished difference Result 272 states and 344 transitions. [2021-11-22 19:20:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:20:08,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-22 19:20:08,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:08,723 INFO L225 Difference]: With dead ends: 272 [2021-11-22 19:20:08,723 INFO L226 Difference]: Without dead ends: 169 [2021-11-22 19:20:08,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:20:08,724 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 438 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:08,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 287 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:20:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-11-22 19:20:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-11-22 19:20:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 163 states have (on average 1.3006134969325154) internal successors, (212), 168 states have internal predecessors, (212), 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:20:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 212 transitions. [2021-11-22 19:20:08,729 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 212 transitions. Word has length 46 [2021-11-22 19:20:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:08,729 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 212 transitions. [2021-11-22 19:20:08,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 212 transitions. [2021-11-22 19:20:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-22 19:20:08,730 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:08,730 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:08,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 19:20:08,731 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:08,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1838871928, now seen corresponding path program 1 times [2021-11-22 19:20:08,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:08,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211120084] [2021-11-22 19:20:08,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:08,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:08,893 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:20:08,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:08,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211120084] [2021-11-22 19:20:08,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211120084] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:08,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:08,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:20:08,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171325065] [2021-11-22 19:20:08,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:08,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:20:08,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:08,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:20:08,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:20:08,896 INFO L87 Difference]: Start difference. First operand 169 states and 212 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:20:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:08,968 INFO L93 Difference]: Finished difference Result 242 states and 299 transitions. [2021-11-22 19:20:08,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:20:08,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 52 [2021-11-22 19:20:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:08,969 INFO L225 Difference]: With dead ends: 242 [2021-11-22 19:20:08,969 INFO L226 Difference]: Without dead ends: 169 [2021-11-22 19:20:08,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:20:08,970 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 564 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:08,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [564 Valid, 334 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:20:08,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-11-22 19:20:08,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-11-22 19:20:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 163 states have (on average 1.294478527607362) internal successors, (211), 168 states have internal predecessors, (211), 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:20:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 211 transitions. [2021-11-22 19:20:08,974 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 211 transitions. Word has length 52 [2021-11-22 19:20:08,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:08,974 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 211 transitions. [2021-11-22 19:20:08,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:20:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 211 transitions. [2021-11-22 19:20:08,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-22 19:20:08,975 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:08,975 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:08,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 19:20:08,975 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:08,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:08,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1897877165, now seen corresponding path program 1 times [2021-11-22 19:20:08,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:08,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582270532] [2021-11-22 19:20:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:08,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:09,161 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:20:09,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:09,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582270532] [2021-11-22 19:20:09,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582270532] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:09,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:09,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:20:09,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220320315] [2021-11-22 19:20:09,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:09,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:20:09,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:09,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:20:09,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:20:09,164 INFO L87 Difference]: Start difference. First operand 169 states and 211 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:20:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:09,322 INFO L93 Difference]: Finished difference Result 305 states and 370 transitions. [2021-11-22 19:20:09,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:20:09,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 58 [2021-11-22 19:20:09,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:09,324 INFO L225 Difference]: With dead ends: 305 [2021-11-22 19:20:09,324 INFO L226 Difference]: Without dead ends: 301 [2021-11-22 19:20:09,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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:20:09,325 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 284 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:09,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 734 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:20:09,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-22 19:20:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 177. [2021-11-22 19:20:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 171 states have (on average 1.280701754385965) internal successors, (219), 176 states have internal predecessors, (219), 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:20:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 219 transitions. [2021-11-22 19:20:09,329 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 219 transitions. Word has length 58 [2021-11-22 19:20:09,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:09,329 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 219 transitions. [2021-11-22 19:20:09,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:20:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 219 transitions. [2021-11-22 19:20:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 19:20:09,330 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:09,330 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:09,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 19:20:09,331 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:09,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:09,331 INFO L85 PathProgramCache]: Analyzing trace with hash 808152229, now seen corresponding path program 1 times [2021-11-22 19:20:09,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:09,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230842619] [2021-11-22 19:20:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:09,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:20:09,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:09,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230842619] [2021-11-22 19:20:09,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230842619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:09,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:09,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:20:09,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453185621] [2021-11-22 19:20:09,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:09,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:20:09,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:09,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:20:09,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:20:09,523 INFO L87 Difference]: Start difference. First operand 177 states and 219 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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:20:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:09,682 INFO L93 Difference]: Finished difference Result 263 states and 321 transitions. [2021-11-22 19:20:09,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:20:09,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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) Word has length 62 [2021-11-22 19:20:09,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:09,689 INFO L225 Difference]: With dead ends: 263 [2021-11-22 19:20:09,689 INFO L226 Difference]: Without dead ends: 184 [2021-11-22 19:20:09,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:20:09,689 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 46 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:09,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 617 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:20:09,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-11-22 19:20:09,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 179. [2021-11-22 19:20:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 173 states have (on average 1.277456647398844) internal successors, (221), 178 states have internal predecessors, (221), 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:20:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 221 transitions. [2021-11-22 19:20:09,696 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 221 transitions. Word has length 62 [2021-11-22 19:20:09,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:09,696 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 221 transitions. [2021-11-22 19:20:09,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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:20:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 221 transitions. [2021-11-22 19:20:09,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 19:20:09,697 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:09,697 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:09,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 19:20:09,697 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:09,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:09,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1488210599, now seen corresponding path program 1 times [2021-11-22 19:20:09,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:09,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437541269] [2021-11-22 19:20:09,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:09,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:10,050 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:20:10,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:10,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437541269] [2021-11-22 19:20:10,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437541269] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:10,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:10,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:20:10,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446605640] [2021-11-22 19:20:10,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:10,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:20:10,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:10,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:20:10,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:20:10,053 INFO L87 Difference]: Start difference. First operand 179 states and 221 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 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:20:10,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:10,384 INFO L93 Difference]: Finished difference Result 371 states and 461 transitions. [2021-11-22 19:20:10,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:20:10,385 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 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) Word has length 62 [2021-11-22 19:20:10,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:10,385 INFO L225 Difference]: With dead ends: 371 [2021-11-22 19:20:10,385 INFO L226 Difference]: Without dead ends: 219 [2021-11-22 19:20:10,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:20:10,386 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 817 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:10,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [817 Valid, 701 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:20:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-11-22 19:20:10,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 175. [2021-11-22 19:20:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 169 states have (on average 1.272189349112426) internal successors, (215), 174 states have internal predecessors, (215), 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:20:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 215 transitions. [2021-11-22 19:20:10,390 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 215 transitions. Word has length 62 [2021-11-22 19:20:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:10,390 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 215 transitions. [2021-11-22 19:20:10,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 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:20:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 215 transitions. [2021-11-22 19:20:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-22 19:20:10,391 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:10,391 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:10,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 19:20:10,391 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:10,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2039459799, now seen corresponding path program 1 times [2021-11-22 19:20:10,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:10,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538195233] [2021-11-22 19:20:10,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:10,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:10,633 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:20:10,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:10,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538195233] [2021-11-22 19:20:10,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538195233] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:10,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:10,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:20:10,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605686933] [2021-11-22 19:20:10,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:10,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:20:10,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:10,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:20:10,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:20:10,635 INFO L87 Difference]: Start difference. First operand 175 states and 215 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 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:20:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:11,159 INFO L93 Difference]: Finished difference Result 530 states and 670 transitions. [2021-11-22 19:20:11,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 19:20:11,159 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 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) Word has length 70 [2021-11-22 19:20:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:11,161 INFO L225 Difference]: With dead ends: 530 [2021-11-22 19:20:11,161 INFO L226 Difference]: Without dead ends: 372 [2021-11-22 19:20:11,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:20:11,162 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 488 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:11,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [488 Valid, 1292 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:20:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-11-22 19:20:11,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 202. [2021-11-22 19:20:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 196 states have (on average 1.2551020408163265) internal successors, (246), 201 states have internal predecessors, (246), 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:20:11,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 246 transitions. [2021-11-22 19:20:11,168 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 246 transitions. Word has length 70 [2021-11-22 19:20:11,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:11,168 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 246 transitions. [2021-11-22 19:20:11,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 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:20:11,169 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 246 transitions. [2021-11-22 19:20:11,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-22 19:20:11,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:11,169 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:11,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 19:20:11,169 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:11,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:11,170 INFO L85 PathProgramCache]: Analyzing trace with hash 883700199, now seen corresponding path program 1 times [2021-11-22 19:20:11,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:11,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326711509] [2021-11-22 19:20:11,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:11,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:11,319 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:20:11,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:11,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326711509] [2021-11-22 19:20:11,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326711509] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:11,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:11,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:20:11,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782121762] [2021-11-22 19:20:11,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:11,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:20:11,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:11,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:20:11,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:20:11,322 INFO L87 Difference]: Start difference. First operand 202 states and 246 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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:20:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:11,484 INFO L93 Difference]: Finished difference Result 419 states and 497 transitions. [2021-11-22 19:20:11,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:20:11,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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) Word has length 70 [2021-11-22 19:20:11,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:11,485 INFO L225 Difference]: With dead ends: 419 [2021-11-22 19:20:11,485 INFO L226 Difference]: Without dead ends: 235 [2021-11-22 19:20:11,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:20:11,486 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 89 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:11,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 1047 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:20:11,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-11-22 19:20:11,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 202. [2021-11-22 19:20:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 196 states have (on average 1.2295918367346939) internal successors, (241), 201 states have internal predecessors, (241), 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:20:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 241 transitions. [2021-11-22 19:20:11,490 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 241 transitions. Word has length 70 [2021-11-22 19:20:11,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:11,491 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 241 transitions. [2021-11-22 19:20:11,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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:20:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 241 transitions. [2021-11-22 19:20:11,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-22 19:20:11,491 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:11,491 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:11,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 19:20:11,492 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:11,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:11,492 INFO L85 PathProgramCache]: Analyzing trace with hash -550409595, now seen corresponding path program 1 times [2021-11-22 19:20:11,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:11,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962361984] [2021-11-22 19:20:11,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:11,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:11,635 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:20:11,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:11,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962361984] [2021-11-22 19:20:11,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962361984] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:11,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:11,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:20:11,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76339202] [2021-11-22 19:20:11,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:11,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:20:11,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:11,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:20:11,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:20:11,637 INFO L87 Difference]: Start difference. First operand 202 states and 241 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:11,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:11,892 INFO L93 Difference]: Finished difference Result 543 states and 642 transitions. [2021-11-22 19:20:11,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:20:11,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-11-22 19:20:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:11,894 INFO L225 Difference]: With dead ends: 543 [2021-11-22 19:20:11,894 INFO L226 Difference]: Without dead ends: 366 [2021-11-22 19:20:11,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:20:11,895 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 343 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:11,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 462 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:20:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-22 19:20:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 222. [2021-11-22 19:20:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 216 states have (on average 1.2037037037037037) internal successors, (260), 221 states have internal predecessors, (260), 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:20:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 260 transitions. [2021-11-22 19:20:11,901 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 260 transitions. Word has length 74 [2021-11-22 19:20:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:11,901 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 260 transitions. [2021-11-22 19:20:11,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 260 transitions. [2021-11-22 19:20:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-22 19:20:11,902 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:11,902 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:11,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 19:20:11,903 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:11,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:11,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1939865285, now seen corresponding path program 1 times [2021-11-22 19:20:11,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:11,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174170986] [2021-11-22 19:20:11,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:11,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:11,982 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:20:11,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:11,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174170986] [2021-11-22 19:20:11,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174170986] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:11,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:11,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:20:11,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619765330] [2021-11-22 19:20:11,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:11,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:20:11,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:11,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:20:11,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:20:11,985 INFO L87 Difference]: Start difference. First operand 222 states and 260 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:12,039 INFO L93 Difference]: Finished difference Result 419 states and 490 transitions. [2021-11-22 19:20:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:20:12,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-11-22 19:20:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:12,041 INFO L225 Difference]: With dead ends: 419 [2021-11-22 19:20:12,041 INFO L226 Difference]: Without dead ends: 200 [2021-11-22 19:20:12,041 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:20:12,042 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 20 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:12,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 498 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:20:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-22 19:20:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 191. [2021-11-22 19:20:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 185 states have (on average 1.1567567567567567) internal successors, (214), 190 states have internal predecessors, (214), 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:20:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 214 transitions. [2021-11-22 19:20:12,046 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 214 transitions. Word has length 74 [2021-11-22 19:20:12,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:12,047 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 214 transitions. [2021-11-22 19:20:12,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:12,047 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 214 transitions. [2021-11-22 19:20:12,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-22 19:20:12,047 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:12,048 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:12,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 19:20:12,048 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:12,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash -638222779, now seen corresponding path program 1 times [2021-11-22 19:20:12,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:12,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924785091] [2021-11-22 19:20:12,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:12,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:12,299 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:20:12,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:12,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924785091] [2021-11-22 19:20:12,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924785091] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:12,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:12,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:20:12,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685378699] [2021-11-22 19:20:12,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:12,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:20:12,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:12,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:20:12,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:20:12,302 INFO L87 Difference]: Start difference. First operand 191 states and 214 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:12,857 INFO L93 Difference]: Finished difference Result 492 states and 551 transitions. [2021-11-22 19:20:12,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 19:20:12,857 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-11-22 19:20:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:12,859 INFO L225 Difference]: With dead ends: 492 [2021-11-22 19:20:12,859 INFO L226 Difference]: Without dead ends: 341 [2021-11-22 19:20:12,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:20:12,860 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 379 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:12,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 934 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:20:12,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-11-22 19:20:12,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 208. [2021-11-22 19:20:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 202 states have (on average 1.1386138613861385) internal successors, (230), 207 states have internal predecessors, (230), 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:20:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 230 transitions. [2021-11-22 19:20:12,865 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 230 transitions. Word has length 74 [2021-11-22 19:20:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:12,866 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 230 transitions. [2021-11-22 19:20:12,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 230 transitions. [2021-11-22 19:20:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-22 19:20:12,866 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:12,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:12,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 19:20:12,866 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:12,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:12,867 INFO L85 PathProgramCache]: Analyzing trace with hash -243855993, now seen corresponding path program 1 times [2021-11-22 19:20:12,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:12,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799247395] [2021-11-22 19:20:12,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:12,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:13,221 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:20:13,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:13,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799247395] [2021-11-22 19:20:13,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799247395] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:13,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:13,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:20:13,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126273252] [2021-11-22 19:20:13,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:13,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:20:13,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:13,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:20:13,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:20:13,224 INFO L87 Difference]: Start difference. First operand 208 states and 230 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:13,603 INFO L93 Difference]: Finished difference Result 356 states and 396 transitions. [2021-11-22 19:20:13,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:20:13,603 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-11-22 19:20:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:13,604 INFO L225 Difference]: With dead ends: 356 [2021-11-22 19:20:13,604 INFO L226 Difference]: Without dead ends: 224 [2021-11-22 19:20:13,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:20:13,605 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 608 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:13,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [608 Valid, 684 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:20:13,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-11-22 19:20:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 204. [2021-11-22 19:20:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 198 states have (on average 1.1363636363636365) internal successors, (225), 203 states have internal predecessors, (225), 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:20:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 225 transitions. [2021-11-22 19:20:13,609 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 225 transitions. Word has length 74 [2021-11-22 19:20:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:13,609 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 225 transitions. [2021-11-22 19:20:13,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 225 transitions. [2021-11-22 19:20:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-22 19:20:13,610 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:13,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:13,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 19:20:13,610 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:13,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:13,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1040968520, now seen corresponding path program 1 times [2021-11-22 19:20:13,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:13,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676468450] [2021-11-22 19:20:13,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:13,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:13,872 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:20:13,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:13,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676468450] [2021-11-22 19:20:13,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676468450] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:13,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:13,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:20:13,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118779721] [2021-11-22 19:20:13,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:13,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:20:13,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:13,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:20:13,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:20:13,875 INFO L87 Difference]: Start difference. First operand 204 states and 225 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 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:20:14,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:14,044 INFO L93 Difference]: Finished difference Result 386 states and 431 transitions. [2021-11-22 19:20:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:20:14,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 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) Word has length 80 [2021-11-22 19:20:14,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:14,045 INFO L225 Difference]: With dead ends: 386 [2021-11-22 19:20:14,045 INFO L226 Difference]: Without dead ends: 273 [2021-11-22 19:20:14,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:20:14,046 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 498 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:14,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 664 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:20:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-11-22 19:20:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 204. [2021-11-22 19:20:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 198 states have (on average 1.1313131313131313) internal successors, (224), 203 states have internal predecessors, (224), 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:20:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 224 transitions. [2021-11-22 19:20:14,051 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 224 transitions. Word has length 80 [2021-11-22 19:20:14,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:14,051 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 224 transitions. [2021-11-22 19:20:14,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 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:20:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 224 transitions. [2021-11-22 19:20:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 19:20:14,052 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:14,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:14,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 19:20:14,052 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:14,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:14,056 INFO L85 PathProgramCache]: Analyzing trace with hash -420723014, now seen corresponding path program 1 times [2021-11-22 19:20:14,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:14,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095453015] [2021-11-22 19:20:14,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:14,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:14,457 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:20:14,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:14,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095453015] [2021-11-22 19:20:14,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095453015] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:14,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:14,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:20:14,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976817482] [2021-11-22 19:20:14,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:14,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:20:14,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:14,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:20:14,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:20:14,459 INFO L87 Difference]: Start difference. First operand 204 states and 224 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 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:20:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:14,936 INFO L93 Difference]: Finished difference Result 390 states and 434 transitions. [2021-11-22 19:20:14,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:20:14,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 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 87 [2021-11-22 19:20:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:14,938 INFO L225 Difference]: With dead ends: 390 [2021-11-22 19:20:14,938 INFO L226 Difference]: Without dead ends: 273 [2021-11-22 19:20:14,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:20:14,938 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 690 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:14,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [690 Valid, 710 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:20:14,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-11-22 19:20:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 204. [2021-11-22 19:20:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 198 states have (on average 1.1262626262626263) internal successors, (223), 203 states have internal predecessors, (223), 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:20:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 223 transitions. [2021-11-22 19:20:14,945 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 223 transitions. Word has length 87 [2021-11-22 19:20:14,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:14,946 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 223 transitions. [2021-11-22 19:20:14,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 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:20:14,946 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 223 transitions. [2021-11-22 19:20:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-22 19:20:14,946 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:14,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:14,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 19:20:14,947 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:14,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:14,947 INFO L85 PathProgramCache]: Analyzing trace with hash 223648705, now seen corresponding path program 1 times [2021-11-22 19:20:14,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:14,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420719809] [2021-11-22 19:20:14,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:14,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:15,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:20:15,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:15,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420719809] [2021-11-22 19:20:15,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420719809] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:15,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:15,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 19:20:15,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390742956] [2021-11-22 19:20:15,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:15,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 19:20:15,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:15,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 19:20:15,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 19:20:15,084 INFO L87 Difference]: Start difference. First operand 204 states and 223 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:20:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:15,097 INFO L93 Difference]: Finished difference Result 323 states and 357 transitions. [2021-11-22 19:20:15,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 19:20:15,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 88 [2021-11-22 19:20:15,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:15,098 INFO L225 Difference]: With dead ends: 323 [2021-11-22 19:20:15,099 INFO L226 Difference]: Without dead ends: 206 [2021-11-22 19:20:15,099 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:20:15,099 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:15,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 351 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:20:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-11-22 19:20:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2021-11-22 19:20:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 199 states have (on average 1.1256281407035176) internal successors, (224), 204 states have internal predecessors, (224), 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:20:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 224 transitions. [2021-11-22 19:20:15,107 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 224 transitions. Word has length 88 [2021-11-22 19:20:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:15,107 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 224 transitions. [2021-11-22 19:20:15,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:20:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 224 transitions. [2021-11-22 19:20:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-22 19:20:15,108 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:15,108 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:15,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 19:20:15,109 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash -891937281, now seen corresponding path program 1 times [2021-11-22 19:20:15,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:15,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200768295] [2021-11-22 19:20:15,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:15,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:20:15,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:15,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200768295] [2021-11-22 19:20:15,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200768295] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:20:15,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269750657] [2021-11-22 19:20:15,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:15,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:20:15,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:20:15,850 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:20:15,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-22 19:20:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:16,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 2636 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-22 19:20:16,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:20:16,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-11-22 19:20:16,918 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:20:16,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2021-11-22 19:20:17,011 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:20:17,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-11-22 19:20:17,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:20:17,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2021-11-22 19:20:17,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2021-11-22 19:20:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:20:17,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:20:17,295 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 Int) (v_ArrVal_551 (Array Int Int))) (let ((.cse0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_memset_impl_~sp~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_552) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))))) is different from false [2021-11-22 19:20:17,313 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| Int)) (or (< |c_ULTIMATE.start_memset_impl_~s#1.base| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4|) (forall ((v_ArrVal_552 Int) (v_ArrVal_551 (Array Int Int))) (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| v_ArrVal_551) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_552) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))))))) is different from false [2021-11-22 19:20:17,391 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 Int) (v_ArrVal_551 (Array Int Int)) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| Int)) (or (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| v_ArrVal_551) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_552) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4|))) is different from false [2021-11-22 19:20:17,587 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_552 Int) (v_ArrVal_551 (Array Int Int)) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| Int)) (or (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| v_ArrVal_551) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_552) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4|))) |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short615#1|) is different from false [2021-11-22 19:20:17,607 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:20:17,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 86 [2021-11-22 19:20:17,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 97 [2021-11-22 19:20:17,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:20:17,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-22 19:20:17,674 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:20:17,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2021-11-22 19:20:17,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2021-11-22 19:20:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-22 19:20:18,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269750657] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:20:18,016 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:20:18,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 38 [2021-11-22 19:20:18,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951373493] [2021-11-22 19:20:18,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:20:18,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-22 19:20:18,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:18,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-22 19:20:18,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1022, Unknown=4, NotChecked=268, Total=1406 [2021-11-22 19:20:18,018 INFO L87 Difference]: Start difference. First operand 205 states and 224 transitions. Second operand has 38 states, 38 states have (on average 6.5) internal successors, (247), 38 states have internal predecessors, (247), 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:20:18,648 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|) (forall ((v_ArrVal_552 Int) (v_ArrVal_551 (Array Int Int)) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| Int)) (or (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| v_ArrVal_551) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_552) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4|))) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) 18446744073709551616) 0)) (< (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) is different from false [2021-11-22 19:20:18,653 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)) (forall ((v_ArrVal_552 Int) (v_ArrVal_551 (Array Int Int)) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| Int)) (or (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| v_ArrVal_551) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_552) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4|))) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (< (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) is different from false [2021-11-22 19:20:18,657 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (and (not (= (mod .cse0 18446744073709551616) 0)) (< (+ |c_ULTIMATE.start_memset_impl_~s#1.base| 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (not (= |c_ULTIMATE.start_memset_impl_~s#1.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| Int)) (or (< |c_ULTIMATE.start_memset_impl_~s#1.base| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4|) (forall ((v_ArrVal_552 Int) (v_ArrVal_551 (Array Int Int))) (let ((.cse1 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| v_ArrVal_551) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_552) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))))) (= |c_ULTIMATE.start_memset_impl_~n#1| .cse0))) is different from false [2021-11-22 19:20:19,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:19,403 INFO L93 Difference]: Finished difference Result 389 states and 428 transitions. [2021-11-22 19:20:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-22 19:20:19,404 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 6.5) internal successors, (247), 38 states have internal predecessors, (247), 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 90 [2021-11-22 19:20:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:19,405 INFO L225 Difference]: With dead ends: 389 [2021-11-22 19:20:19,405 INFO L226 Difference]: Without dead ends: 288 [2021-11-22 19:20:19,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=320, Invalid=1957, Unknown=7, NotChecked=686, Total=2970 [2021-11-22 19:20:19,406 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 588 mSDsluCounter, 3766 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 3959 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 733 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:19,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [588 Valid, 3959 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1076 Invalid, 0 Unknown, 733 Unchecked, 0.8s Time] [2021-11-22 19:20:19,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-11-22 19:20:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 231. [2021-11-22 19:20:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 225 states have (on average 1.1155555555555556) internal successors, (251), 230 states have internal predecessors, (251), 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:20:19,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 251 transitions. [2021-11-22 19:20:19,413 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 251 transitions. Word has length 90 [2021-11-22 19:20:19,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:19,414 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 251 transitions. [2021-11-22 19:20:19,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.5) internal successors, (247), 38 states have internal predecessors, (247), 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:20:19,414 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 251 transitions. [2021-11-22 19:20:19,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-22 19:20:19,414 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:19,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:19,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-22 19:20:19,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-22 19:20:19,634 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:19,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:19,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1735942783, now seen corresponding path program 1 times [2021-11-22 19:20:19,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:19,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234948728] [2021-11-22 19:20:19,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:19,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:20:19,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:19,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234948728] [2021-11-22 19:20:19,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234948728] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:19,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:19,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:20:19,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181011735] [2021-11-22 19:20:19,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:19,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:20:19,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:19,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:20:19,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:20:19,888 INFO L87 Difference]: Start difference. First operand 231 states and 251 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 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:20:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:20,298 INFO L93 Difference]: Finished difference Result 429 states and 467 transitions. [2021-11-22 19:20:20,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 19:20:20,299 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 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) Word has length 90 [2021-11-22 19:20:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:20,300 INFO L225 Difference]: With dead ends: 429 [2021-11-22 19:20:20,300 INFO L226 Difference]: Without dead ends: 298 [2021-11-22 19:20:20,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:20:20,300 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 481 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:20,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 766 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:20:20,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-11-22 19:20:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 248. [2021-11-22 19:20:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 242 states have (on average 1.1074380165289257) internal successors, (268), 247 states have internal predecessors, (268), 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:20:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 268 transitions. [2021-11-22 19:20:20,308 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 268 transitions. Word has length 90 [2021-11-22 19:20:20,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:20,308 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 268 transitions. [2021-11-22 19:20:20,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 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:20:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 268 transitions. [2021-11-22 19:20:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-22 19:20:20,308 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:20,309 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:20,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 19:20:20,309 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:20,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:20,309 INFO L85 PathProgramCache]: Analyzing trace with hash -690228927, now seen corresponding path program 1 times [2021-11-22 19:20:20,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:20,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204432654] [2021-11-22 19:20:20,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:20,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:20:21,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:21,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204432654] [2021-11-22 19:20:21,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204432654] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:20:21,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999706027] [2021-11-22 19:20:21,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:21,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:20:21,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:20:21,399 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:20:21,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-22 19:20:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:21,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 2651 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-22 19:20:21,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:20:21,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-11-22 19:20:22,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:20:22,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2021-11-22 19:20:22,568 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:20:22,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-11-22 19:20:22,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2021-11-22 19:20:22,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2021-11-22 19:20:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:20:22,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:20:22,859 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (v_ArrVal_664 (Array Int Int))) (<= (let ((.cse0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_memset_impl_~sp~0#1.base| v_ArrVal_664) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_665) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse0 (- 1))) 18446744073709551616)) .cse0)) 18446744073709551615)) is different from false [2021-11-22 19:20:22,873 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int)) (or (forall ((v_ArrVal_665 Int) (v_ArrVal_664 (Array Int Int))) (<= (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_664) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_665) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse0 (- 1))) 18446744073709551616)) .cse0)) 18446744073709551615)) (< |c_ULTIMATE.start_memset_impl_~s#1.base| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|))) is different from false [2021-11-22 19:20:22,910 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_664 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (<= (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_664) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_665) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse0 (- 1))) 18446744073709551616)) .cse0)) 18446744073709551615))) is different from false [2021-11-22 19:20:23,102 WARN L838 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short615#1| (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_664 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (<= (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_664) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_665) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse0 (- 1))) 18446744073709551616)) .cse0)) 18446744073709551615)))) is different from false [2021-11-22 19:20:23,116 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:20:23,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 90 [2021-11-22 19:20:23,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 103 [2021-11-22 19:20:23,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:20:23,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-22 19:20:23,170 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:20:23,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 71 [2021-11-22 19:20:23,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2021-11-22 19:20:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-22 19:20:23,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999706027] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:20:23,524 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:20:23,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 15] total 46 [2021-11-22 19:20:23,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260504681] [2021-11-22 19:20:23,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:20:23,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-22 19:20:23,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:23,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-22 19:20:23,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1584, Unknown=4, NotChecked=332, Total=2070 [2021-11-22 19:20:23,526 INFO L87 Difference]: Start difference. First operand 248 states and 268 transitions. Second operand has 46 states, 46 states have (on average 5.065217391304348) internal successors, (233), 46 states have internal predecessors, (233), 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:20:25,171 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (+ 16 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|))) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse15 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse11))) (let ((.cse7 (= (mod .cse6 18446744073709551616) 0)) (.cse3 (select .cse13 .cse15))) (let ((.cse0 (not (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| .cse3))) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|)) (.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base|) 8)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base|)) (.cse8 (not .cse7)) (.cse2 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse15) 0)) (.cse9 (not |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short615#1|))) (and .cse0 (< (+ (select .cse1 (+ |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (or |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short627#1| (and .cse2 (= .cse3 0))) (= |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| 0) (<= (let ((.cse4 (select .cse5 16))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse4 (- 1))) 18446744073709551616)) .cse4)) 18446744073709551615) (= |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|) (< (+ |c_ULTIMATE.start_bounded_malloc_#res#1.base| 1) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base|) 8) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) 8) 0) (or (<= (+ .cse6 (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse6 (- 1))) 18446744073709551616))) 18446744073709551615) |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short624#1|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (or (and .cse7 |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short615#1|) (and .cse8 .cse9)) (or .cse0 (not |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short627#1|)) (not (= (select .cse1 8) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|)) (not (= |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| .cse10)) (= |c_ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (< (+ .cse10 1) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base|) (= (select .cse5 .cse11) .cse6) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) 1) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (or |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short615#1| (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_664 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (<= (let ((.cse12 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_664) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_665) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse12 (- 1))) 18446744073709551616)) .cse12)) 18446744073709551615)))) .cse8 (< |c_#StackHeapBarrier| |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|)) (< (+ (select .cse13 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse2 .cse9 (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (= |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| 0) (<= (let ((.cse14 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) 16))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse14 (- 1))) 18446744073709551616)) .cse14)) 18446744073709551615) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) is different from false [2021-11-22 19:20:25,175 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) 18446744073709551616) 0)) (< (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_664 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (<= (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_664) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_665) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse0 (- 1))) 18446744073709551616)) .cse0)) 18446744073709551615)))) is different from false [2021-11-22 19:20:25,178 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|))) (and (not (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (select .cse0 .cse1))) (= |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) 18446744073709551616) 0)) (< (+ (select .cse0 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse1) 0) (= |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) (<= (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) 16))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse2 (- 1))) 18446744073709551616)) .cse2)) 18446744073709551615) (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_664 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (<= (let ((.cse3 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_664) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_665) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse3 (- 1))) 18446744073709551616)) .cse3)) 18446744073709551615))))) is different from false [2021-11-22 19:20:25,182 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (< (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_664 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (<= (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_664) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_665) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse0 (- 1))) 18446744073709551616)) .cse0)) 18446744073709551615)))) is different from false [2021-11-22 19:20:25,185 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|))) (and (not (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (select .cse0 .cse1))) (not (= (mod (select .cse2 (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (< (+ (select .cse0 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse1) 0) (= |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) (<= (let ((.cse3 (select .cse2 16))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse3 (- 1))) 18446744073709551616)) .cse3)) 18446744073709551615) (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_664 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (<= (let ((.cse4 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_664) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_665) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse4 (- 1))) 18446744073709551616)) .cse4)) 18446744073709551615))))) is different from false [2021-11-22 19:20:25,189 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|))) (let ((.cse0 (select .cse3 .cse2)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|))) (and (not (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| .cse0)) (not (= (mod (select .cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)) (or |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short624#1| (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse2) 0) (= .cse0 0))) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (< (+ (select .cse3 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (<= (let ((.cse4 (select .cse1 16))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse4 (- 1))) 18446744073709551616)) .cse4)) 18446744073709551615) (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_664 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (<= (let ((.cse5 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_664) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_665) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse5 (- 1))) 18446744073709551616)) .cse5)) 18446744073709551615)))))) is different from false [2021-11-22 19:20:25,193 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|))) (let ((.cse0 (select .cse2 .cse3)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|))) (and (not (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| .cse0)) (not (= (mod (select .cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (< (+ (select .cse2 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (or |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short625#1| (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse3) 0) (= .cse0 0))) (<= (let ((.cse4 (select .cse1 16))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse4 (- 1))) 18446744073709551616)) .cse4)) 18446744073709551615) (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_664 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (<= (let ((.cse5 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_664) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_665) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse5 (- 1))) 18446744073709551616)) .cse5)) 18446744073709551615)))))) is different from false [2021-11-22 19:20:25,197 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|))) (let ((.cse0 (select .cse2 .cse3)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|))) (and (not (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| .cse0)) (not (= (mod (select .cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (< (+ (select .cse2 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (or |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short626#1| (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse3) 0) (= .cse0 0))) (<= (let ((.cse4 (select .cse1 16))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse4 (- 1))) 18446744073709551616)) .cse4)) 18446744073709551615) (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_664 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (<= (let ((.cse5 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_664) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_665) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse5 (- 1))) 18446744073709551616)) .cse5)) 18446744073709551615)))))) is different from false [2021-11-22 19:20:25,200 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|))) (let ((.cse2 (select .cse3 .cse1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|))) (and (not (= (mod (select .cse0 (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)) (or |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short627#1| (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse1) 0) (= .cse2 0))) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (or (not (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| .cse2)) (not |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short627#1|)) (< (+ (select .cse3 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (<= (let ((.cse4 (select .cse0 16))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse4 (- 1))) 18446744073709551616)) .cse4)) 18446744073709551615) (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_664 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (<= (let ((.cse5 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_664) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_665) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse5 (- 1))) 18446744073709551616)) .cse5)) 18446744073709551615)))))) is different from false [2021-11-22 19:20:25,216 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)) (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int)) (or (forall ((v_ArrVal_665 Int) (v_ArrVal_664 (Array Int Int))) (<= (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_664) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_665) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse0 (- 1))) 18446744073709551616)) .cse0)) 18446744073709551615)) (< |c_ULTIMATE.start_memset_impl_~s#1.base| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|))) (< (+ |c_ULTIMATE.start_memset_impl_~s#1.base| 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0)) is different from false [2021-11-22 19:20:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:25,577 INFO L93 Difference]: Finished difference Result 370 states and 404 transitions. [2021-11-22 19:20:25,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-22 19:20:25,577 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 5.065217391304348) internal successors, (233), 46 states have internal predecessors, (233), 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 90 [2021-11-22 19:20:25,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:25,578 INFO L225 Difference]: With dead ends: 370 [2021-11-22 19:20:25,578 INFO L226 Difference]: Without dead ends: 269 [2021-11-22 19:20:25,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=574, Invalid=2890, Unknown=14, NotChecked=1778, Total=5256 [2021-11-22 19:20:25,580 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 354 mSDsluCounter, 3317 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 3492 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 640 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:25,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 3492 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 771 Invalid, 0 Unknown, 640 Unchecked, 0.5s Time] [2021-11-22 19:20:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-11-22 19:20:25,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 257. [2021-11-22 19:20:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 251 states have (on average 1.1075697211155378) internal successors, (278), 256 states have internal predecessors, (278), 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:20:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 278 transitions. [2021-11-22 19:20:25,590 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 278 transitions. Word has length 90 [2021-11-22 19:20:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:25,590 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 278 transitions. [2021-11-22 19:20:25,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.065217391304348) internal successors, (233), 46 states have internal predecessors, (233), 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:20:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 278 transitions. [2021-11-22 19:20:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-22 19:20:25,591 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:25,591 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:25,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-22 19:20:25,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-11-22 19:20:25,803 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:25,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:25,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1443180739, now seen corresponding path program 1 times [2021-11-22 19:20:25,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:25,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429593433] [2021-11-22 19:20:25,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:25,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:20:25,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:25,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429593433] [2021-11-22 19:20:25,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429593433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:25,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:25,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:20:25,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687259176] [2021-11-22 19:20:25,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:25,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:20:25,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:25,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:20:25,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:20:25,970 INFO L87 Difference]: Start difference. First operand 257 states and 278 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 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:20:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:26,192 INFO L93 Difference]: Finished difference Result 394 states and 427 transitions. [2021-11-22 19:20:26,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:20:26,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 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) Word has length 90 [2021-11-22 19:20:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:26,193 INFO L225 Difference]: With dead ends: 394 [2021-11-22 19:20:26,193 INFO L226 Difference]: Without dead ends: 304 [2021-11-22 19:20:26,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:20:26,194 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 247 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:26,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 437 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:20:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-11-22 19:20:26,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 245. [2021-11-22 19:20:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 239 states have (on average 1.104602510460251) internal successors, (264), 244 states have internal predecessors, (264), 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:20:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 264 transitions. [2021-11-22 19:20:26,204 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 264 transitions. Word has length 90 [2021-11-22 19:20:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:26,204 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 264 transitions. [2021-11-22 19:20:26,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 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:20:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 264 transitions. [2021-11-22 19:20:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-22 19:20:26,205 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:26,205 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:26,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 19:20:26,206 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:26,206 INFO L85 PathProgramCache]: Analyzing trace with hash 225575476, now seen corresponding path program 1 times [2021-11-22 19:20:26,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:26,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918918225] [2021-11-22 19:20:26,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:26,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:26,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:20:26,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:26,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918918225] [2021-11-22 19:20:26,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918918225] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:26,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:26,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:20:26,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076336017] [2021-11-22 19:20:26,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:26,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:20:26,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:26,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:20:26,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:20:26,347 INFO L87 Difference]: Start difference. First operand 245 states and 264 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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:20:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:26,614 INFO L93 Difference]: Finished difference Result 385 states and 419 transitions. [2021-11-22 19:20:26,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:20:26,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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 92 [2021-11-22 19:20:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:26,617 INFO L225 Difference]: With dead ends: 385 [2021-11-22 19:20:26,617 INFO L226 Difference]: Without dead ends: 381 [2021-11-22 19:20:26,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:20:26,618 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 297 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:26,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 868 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:20:26,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-22 19:20:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 248. [2021-11-22 19:20:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 242 states have (on average 1.103305785123967) internal successors, (267), 247 states have internal predecessors, (267), 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:20:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 267 transitions. [2021-11-22 19:20:26,626 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 267 transitions. Word has length 92 [2021-11-22 19:20:26,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:26,626 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 267 transitions. [2021-11-22 19:20:26,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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:20:26,627 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 267 transitions. [2021-11-22 19:20:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-22 19:20:26,627 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:26,627 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:26,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-22 19:20:26,628 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:26,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:26,628 INFO L85 PathProgramCache]: Analyzing trace with hash 771754173, now seen corresponding path program 2 times [2021-11-22 19:20:26,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:26,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559553606] [2021-11-22 19:20:26,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:26,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:20:27,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:27,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559553606] [2021-11-22 19:20:27,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559553606] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:20:27,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393335799] [2021-11-22 19:20:27,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-22 19:20:27,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:20:27,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:20:27,901 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:20:27,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-22 19:20:28,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-22 19:20:28,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 19:20:28,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 2655 conjuncts, 97 conjunts are in the unsatisfiable core [2021-11-22 19:20:28,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:20:28,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 19:20:28,567 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 19:20:28,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-22 19:20:28,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-22 19:20:29,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-11-22 19:20:29,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2021-11-22 19:20:29,184 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:20:29,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2021-11-22 19:20:29,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:20:29,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2021-11-22 19:20:29,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2021-11-22 19:20:29,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:20:29,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:20:29,464 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_833 Int)) (not (= (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_memset_impl_~sp~0#1.base| v_ArrVal_831) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_833) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2021-11-22 19:20:29,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_833 Int)) (not (= (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_memset_impl_~s#1.base| v_ArrVal_831) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_833) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2021-11-22 19:20:29,498 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_833 Int)) (not (= (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) v_ArrVal_831) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_833) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2021-11-22 19:20:29,570 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_833 Int)) (not (= (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| 8)) v_ArrVal_831) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| v_ArrVal_833) (+ |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| 16)) 18446744073709551616) 0))) is different from false [2021-11-22 19:20:29,656 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_833 Int)) (not (= (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| 8)) v_ArrVal_831) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| v_ArrVal_833) (+ |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| 16)) 18446744073709551616) 0))) is different from false [2021-11-22 19:20:29,711 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_833 Int)) (not (= (mod (select (store (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| 8)) v_ArrVal_831) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| v_ArrVal_833) (+ |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| 16)) 18446744073709551616) 0))) |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short615#1|) is different from false [2021-11-22 19:20:29,721 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:20:29,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 66 [2021-11-22 19:20:29,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2021-11-22 19:20:29,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2021-11-22 19:20:29,750 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:20:29,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2021-11-22 19:20:29,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2021-11-22 19:20:30,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2021-11-22 19:20:30,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393335799] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:20:30,031 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:20:30,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 16] total 46 [2021-11-22 19:20:30,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503771920] [2021-11-22 19:20:30,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:20:30,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-22 19:20:30,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:30,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-22 19:20:30,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1415, Unknown=6, NotChecked=486, Total=2070 [2021-11-22 19:20:30,034 INFO L87 Difference]: Start difference. First operand 248 states and 267 transitions. Second operand has 46 states, 46 states have (on average 4.543478260869565) internal successors, (209), 46 states have internal predecessors, (209), 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:20:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:32,188 INFO L93 Difference]: Finished difference Result 410 states and 447 transitions. [2021-11-22 19:20:32,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-22 19:20:32,188 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.543478260869565) internal successors, (209), 46 states have internal predecessors, (209), 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 92 [2021-11-22 19:20:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:32,189 INFO L225 Difference]: With dead ends: 410 [2021-11-22 19:20:32,189 INFO L226 Difference]: Without dead ends: 307 [2021-11-22 19:20:32,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 160 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=421, Invalid=3378, Unknown=7, NotChecked=750, Total=4556 [2021-11-22 19:20:32,191 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 479 mSDsluCounter, 3486 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 3669 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1233 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:32,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [479 Valid, 3669 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1465 Invalid, 0 Unknown, 1233 Unchecked, 0.9s Time] [2021-11-22 19:20:32,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-11-22 19:20:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 209. [2021-11-22 19:20:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 204 states have (on average 1.0931372549019607) internal successors, (223), 208 states have internal predecessors, (223), 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:20:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 223 transitions. [2021-11-22 19:20:32,198 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 223 transitions. Word has length 92 [2021-11-22 19:20:32,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:32,198 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 223 transitions. [2021-11-22 19:20:32,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.543478260869565) internal successors, (209), 46 states have internal predecessors, (209), 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:20:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 223 transitions. [2021-11-22 19:20:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-22 19:20:32,199 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:32,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:32,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-22 19:20:32,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:20:32,416 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:32,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:32,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1619527923, now seen corresponding path program 1 times [2021-11-22 19:20:32,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:32,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306735005] [2021-11-22 19:20:32,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:32,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:20:32,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:32,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306735005] [2021-11-22 19:20:32,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306735005] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:20:32,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177851570] [2021-11-22 19:20:32,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:32,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:20:32,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:20:32,854 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:20:32,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-22 19:20:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:33,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 47 conjunts are in the unsatisfiable core [2021-11-22 19:20:33,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:20:33,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 19:20:33,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-11-22 19:20:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:20:33,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 19:20:33,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177851570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:33,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-22 19:20:33,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2021-11-22 19:20:33,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084046672] [2021-11-22 19:20:33,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:33,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:20:33,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:33,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:20:33,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2021-11-22 19:20:33,657 INFO L87 Difference]: Start difference. First operand 209 states and 223 transitions. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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:20:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:33,923 INFO L93 Difference]: Finished difference Result 302 states and 322 transitions. [2021-11-22 19:20:33,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 19:20:33,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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 122 [2021-11-22 19:20:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:33,924 INFO L225 Difference]: With dead ends: 302 [2021-11-22 19:20:33,924 INFO L226 Difference]: Without dead ends: 233 [2021-11-22 19:20:33,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2021-11-22 19:20:33,925 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 586 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:33,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [586 Valid, 489 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:20:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-22 19:20:33,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 205. [2021-11-22 19:20:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.09) internal successors, (218), 204 states have internal predecessors, (218), 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:20:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 218 transitions. [2021-11-22 19:20:33,932 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 218 transitions. Word has length 122 [2021-11-22 19:20:33,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:33,932 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 218 transitions. [2021-11-22 19:20:33,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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:20:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 218 transitions. [2021-11-22 19:20:33,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-22 19:20:33,933 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:33,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:33,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-22 19:20:34,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:20:34,146 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:34,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:34,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1195488926, now seen corresponding path program 1 times [2021-11-22 19:20:34,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:34,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240180953] [2021-11-22 19:20:34,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:34,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:20:34,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:34,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240180953] [2021-11-22 19:20:34,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240180953] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:20:34,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938844043] [2021-11-22 19:20:34,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:34,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:20:34,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:20:34,603 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 19:20:34,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-22 19:20:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:34,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 2804 conjuncts, 77 conjunts are in the unsatisfiable core [2021-11-22 19:20:34,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:20:34,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 19:20:35,056 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 19:20:35,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-22 19:20:35,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-11-22 19:20:35,622 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:20:35,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 30 [2021-11-22 19:20:35,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-22 19:20:35,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:20:35,944 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:20:35,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 33 [2021-11-22 19:20:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:20:35,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:20:36,141 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1091 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_memset_impl_~sp~0#1.base| v_ArrVal_1090))) (store .cse0 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (store (select .cse0 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_1091))) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| 8)) 0))) is different from false [2021-11-22 19:20:36,146 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1091 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_memset_impl_~s#1.base| v_ArrVal_1090))) (store .cse0 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (store (select .cse0 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_1091))) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| 8)) 0))) is different from false [2021-11-22 19:20:36,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1091 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) v_ArrVal_1090))) (store .cse0 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (store (select .cse0 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_1091))) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| 8)) 0))) is different from false [2021-11-22 19:20:36,215 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1091 Int)) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| 8))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base|) .cse0) v_ArrVal_1090) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| v_ArrVal_1091) .cse0)) 0))) is different from false [2021-11-22 19:20:36,258 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1091 Int)) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| 8))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) .cse0) v_ArrVal_1090) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| v_ArrVal_1091) .cse0)) 0))) is different from false [2021-11-22 19:20:36,341 INFO L354 Elim1Store]: treesize reduction 25, result has 55.4 percent of original size [2021-11-22 19:20:36,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 89 [2021-11-22 19:20:36,347 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:20:36,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 125 [2021-11-22 19:20:36,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 147 [2021-11-22 19:20:36,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:20:36,426 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:20:36,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 130 [2021-11-22 19:20:36,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-22 19:20:36,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938844043] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:20:36,675 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:20:36,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 14] total 34 [2021-11-22 19:20:36,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997493699] [2021-11-22 19:20:36,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:20:36,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-22 19:20:36,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:36,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-22 19:20:36,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=715, Unknown=5, NotChecked=290, Total=1122 [2021-11-22 19:20:36,677 INFO L87 Difference]: Start difference. First operand 205 states and 218 transitions. Second operand has 34 states, 34 states have (on average 10.029411764705882) internal successors, (341), 34 states have internal predecessors, (341), 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:20:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:37,181 INFO L93 Difference]: Finished difference Result 321 states and 344 transitions. [2021-11-22 19:20:37,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:20:37,182 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 10.029411764705882) internal successors, (341), 34 states have internal predecessors, (341), 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 128 [2021-11-22 19:20:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:37,183 INFO L225 Difference]: With dead ends: 321 [2021-11-22 19:20:37,183 INFO L226 Difference]: Without dead ends: 269 [2021-11-22 19:20:37,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=1139, Unknown=5, NotChecked=370, Total=1722 [2021-11-22 19:20:37,184 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 468 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 2447 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 638 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:37,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 2447 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 286 Invalid, 0 Unknown, 638 Unchecked, 0.2s Time] [2021-11-22 19:20:37,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-11-22 19:20:37,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 261. [2021-11-22 19:20:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.08203125) internal successors, (277), 260 states have internal predecessors, (277), 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:20:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 277 transitions. [2021-11-22 19:20:37,192 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 277 transitions. Word has length 128 [2021-11-22 19:20:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:37,193 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 277 transitions. [2021-11-22 19:20:37,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 10.029411764705882) internal successors, (341), 34 states have internal predecessors, (341), 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:20:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 277 transitions. [2021-11-22 19:20:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-22 19:20:37,193 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:37,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:37,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-22 19:20:37,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-22 19:20:37,407 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:37,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:37,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1105333664, now seen corresponding path program 1 times [2021-11-22 19:20:37,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:37,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946355630] [2021-11-22 19:20:37,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:37,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:20:37,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:37,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946355630] [2021-11-22 19:20:37,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946355630] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:37,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:37,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:20:37,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290085835] [2021-11-22 19:20:37,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:37,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:20:37,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:20:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:20:37,677 INFO L87 Difference]: Start difference. First operand 261 states and 277 transitions. Second operand has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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:20:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:37,784 INFO L93 Difference]: Finished difference Result 261 states and 277 transitions. [2021-11-22 19:20:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:20:37,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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 128 [2021-11-22 19:20:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:37,785 INFO L225 Difference]: With dead ends: 261 [2021-11-22 19:20:37,785 INFO L226 Difference]: Without dead ends: 259 [2021-11-22 19:20:37,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:20:37,786 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 285 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:37,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 515 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:20:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-11-22 19:20:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2021-11-22 19:20:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 255 states have (on average 1.0784313725490196) internal successors, (275), 258 states have internal predecessors, (275), 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:20:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 275 transitions. [2021-11-22 19:20:37,794 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 275 transitions. Word has length 128 [2021-11-22 19:20:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:37,795 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 275 transitions. [2021-11-22 19:20:37,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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:20:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 275 transitions. [2021-11-22 19:20:37,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-22 19:20:37,795 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:37,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:37,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-22 19:20:37,796 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:37,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:37,796 INFO L85 PathProgramCache]: Analyzing trace with hash 756726187, now seen corresponding path program 1 times [2021-11-22 19:20:37,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:37,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282849417] [2021-11-22 19:20:37,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:37,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:20:38,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:38,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282849417] [2021-11-22 19:20:38,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282849417] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:38,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:38,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:20:38,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037930172] [2021-11-22 19:20:38,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:38,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:20:38,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:38,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:20:38,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:20:38,100 INFO L87 Difference]: Start difference. First operand 259 states and 275 transitions. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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:20:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:38,341 INFO L93 Difference]: Finished difference Result 286 states and 301 transitions. [2021-11-22 19:20:38,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:20:38,341 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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 129 [2021-11-22 19:20:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:38,342 INFO L225 Difference]: With dead ends: 286 [2021-11-22 19:20:38,342 INFO L226 Difference]: Without dead ends: 261 [2021-11-22 19:20:38,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:20:38,343 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 302 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:38,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 652 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:20:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-11-22 19:20:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 259. [2021-11-22 19:20:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 255 states have (on average 1.0745098039215686) internal successors, (274), 258 states have internal predecessors, (274), 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:20:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 274 transitions. [2021-11-22 19:20:38,357 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 274 transitions. Word has length 129 [2021-11-22 19:20:38,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:38,357 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 274 transitions. [2021-11-22 19:20:38,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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:20:38,358 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 274 transitions. [2021-11-22 19:20:38,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-22 19:20:38,359 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:38,359 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:38,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-22 19:20:38,359 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:38,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:38,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1014891625, now seen corresponding path program 1 times [2021-11-22 19:20:38,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:38,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515420053] [2021-11-22 19:20:38,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:38,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:20:38,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:38,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515420053] [2021-11-22 19:20:38,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515420053] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:38,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:38,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:20:38,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921791126] [2021-11-22 19:20:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:38,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:20:38,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:38,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:20:38,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:20:38,491 INFO L87 Difference]: Start difference. First operand 259 states and 274 transitions. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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:20:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:38,666 INFO L93 Difference]: Finished difference Result 283 states and 297 transitions. [2021-11-22 19:20:38,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:20:38,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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 129 [2021-11-22 19:20:38,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:38,667 INFO L225 Difference]: With dead ends: 283 [2021-11-22 19:20:38,667 INFO L226 Difference]: Without dead ends: 256 [2021-11-22 19:20:38,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:20:38,668 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 153 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:38,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 647 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:20:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-22 19:20:38,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2021-11-22 19:20:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 250 states have (on average 1.072) internal successors, (268), 253 states have internal predecessors, (268), 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:20:38,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 268 transitions. [2021-11-22 19:20:38,676 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 268 transitions. Word has length 129 [2021-11-22 19:20:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:38,677 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 268 transitions. [2021-11-22 19:20:38,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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:20:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 268 transitions. [2021-11-22 19:20:38,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-22 19:20:38,677 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:38,678 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:38,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-22 19:20:38,678 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:38,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:38,679 INFO L85 PathProgramCache]: Analyzing trace with hash -676283995, now seen corresponding path program 1 times [2021-11-22 19:20:38,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:38,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229922035] [2021-11-22 19:20:38,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:38,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:20:38,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:38,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229922035] [2021-11-22 19:20:38,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229922035] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:38,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:38,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:20:38,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511095641] [2021-11-22 19:20:38,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:38,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:20:38,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:38,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:20:38,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:20:38,823 INFO L87 Difference]: Start difference. First operand 254 states and 268 transitions. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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:20:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:39,013 INFO L93 Difference]: Finished difference Result 278 states and 291 transitions. [2021-11-22 19:20:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 19:20:39,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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 129 [2021-11-22 19:20:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:39,014 INFO L225 Difference]: With dead ends: 278 [2021-11-22 19:20:39,014 INFO L226 Difference]: Without dead ends: 256 [2021-11-22 19:20:39,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:20:39,014 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 158 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:39,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 626 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:20:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-22 19:20:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2021-11-22 19:20:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 250 states have (on average 1.068) internal successors, (267), 253 states have internal predecessors, (267), 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:20:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 267 transitions. [2021-11-22 19:20:39,022 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 267 transitions. Word has length 129 [2021-11-22 19:20:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:39,023 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 267 transitions. [2021-11-22 19:20:39,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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:20:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 267 transitions. [2021-11-22 19:20:39,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-22 19:20:39,023 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:39,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:39,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-22 19:20:39,024 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:39,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:39,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1368868226, now seen corresponding path program 1 times [2021-11-22 19:20:39,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:39,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588956735] [2021-11-22 19:20:39,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:39,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:20:39,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:39,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588956735] [2021-11-22 19:20:39,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588956735] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:39,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:39,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:20:39,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140516567] [2021-11-22 19:20:39,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:39,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:20:39,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:39,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:20:39,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:20:39,390 INFO L87 Difference]: Start difference. First operand 254 states and 267 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 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:20:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:39,487 INFO L93 Difference]: Finished difference Result 254 states and 267 transitions. [2021-11-22 19:20:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:20:39,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 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 130 [2021-11-22 19:20:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:39,489 INFO L225 Difference]: With dead ends: 254 [2021-11-22 19:20:39,489 INFO L226 Difference]: Without dead ends: 252 [2021-11-22 19:20:39,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:20:39,490 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 267 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:39,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 508 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:20:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-11-22 19:20:39,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2021-11-22 19:20:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 249 states have (on average 1.0642570281124497) internal successors, (265), 251 states have internal predecessors, (265), 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:20:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 265 transitions. [2021-11-22 19:20:39,499 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 265 transitions. Word has length 130 [2021-11-22 19:20:39,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:39,499 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 265 transitions. [2021-11-22 19:20:39,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 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:20:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 265 transitions. [2021-11-22 19:20:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-22 19:20:39,500 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:39,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:39,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-22 19:20:39,501 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:39,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:39,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1061105634, now seen corresponding path program 1 times [2021-11-22 19:20:39,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:39,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854240982] [2021-11-22 19:20:39,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:39,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:20:39,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:39,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854240982] [2021-11-22 19:20:39,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854240982] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:39,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:39,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:20:39,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621898741] [2021-11-22 19:20:39,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:39,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:20:39,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:39,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:20:39,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:20:39,650 INFO L87 Difference]: Start difference. First operand 252 states and 265 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:39,815 INFO L93 Difference]: Finished difference Result 279 states and 291 transitions. [2021-11-22 19:20:39,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:20:39,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2021-11-22 19:20:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:39,816 INFO L225 Difference]: With dead ends: 279 [2021-11-22 19:20:39,816 INFO L226 Difference]: Without dead ends: 258 [2021-11-22 19:20:39,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:20:39,817 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 135 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:39,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 492 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:20:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-22 19:20:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 244. [2021-11-22 19:20:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 242 states have (on average 1.0578512396694215) internal successors, (256), 243 states have internal predecessors, (256), 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:20:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 256 transitions. [2021-11-22 19:20:39,826 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 256 transitions. Word has length 131 [2021-11-22 19:20:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:39,827 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 256 transitions. [2021-11-22 19:20:39,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 256 transitions. [2021-11-22 19:20:39,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-11-22 19:20:39,828 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:39,828 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:39,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-22 19:20:39,828 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:39,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:39,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1222512132, now seen corresponding path program 1 times [2021-11-22 19:20:39,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:39,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746668794] [2021-11-22 19:20:39,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:39,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:20:40,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:40,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746668794] [2021-11-22 19:20:40,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746668794] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:40,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:40,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:20:40,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031940112] [2021-11-22 19:20:40,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:40,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:20:40,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:40,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:20:40,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:20:40,029 INFO L87 Difference]: Start difference. First operand 244 states and 256 transitions. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 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:20:40,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:40,218 INFO L93 Difference]: Finished difference Result 244 states and 256 transitions. [2021-11-22 19:20:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:20:40,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 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 132 [2021-11-22 19:20:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:40,219 INFO L225 Difference]: With dead ends: 244 [2021-11-22 19:20:40,219 INFO L226 Difference]: Without dead ends: 242 [2021-11-22 19:20:40,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:20:40,220 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 117 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:40,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 665 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:20:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-22 19:20:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-11-22 19:20:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.053941908713693) internal successors, (254), 241 states have internal predecessors, (254), 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:20:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 254 transitions. [2021-11-22 19:20:40,229 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 254 transitions. Word has length 132 [2021-11-22 19:20:40,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:40,229 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 254 transitions. [2021-11-22 19:20:40,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 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:20:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 254 transitions. [2021-11-22 19:20:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-22 19:20:40,230 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:40,230 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:40,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-22 19:20:40,231 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 19:20:40,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:40,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1986740442, now seen corresponding path program 1 times [2021-11-22 19:20:40,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:40,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895399756] [2021-11-22 19:20:40,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:40,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:20:40,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:40,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895399756] [2021-11-22 19:20:40,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895399756] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:40,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:40,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:20:40,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394821322] [2021-11-22 19:20:40,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:40,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:20:40,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:40,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:20:40,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:20:40,591 INFO L87 Difference]: Start difference. First operand 242 states and 254 transitions. Second operand has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 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:20:40,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:40,720 INFO L93 Difference]: Finished difference Result 242 states and 254 transitions. [2021-11-22 19:20:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:20:40,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 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 134 [2021-11-22 19:20:40,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:40,721 INFO L225 Difference]: With dead ends: 242 [2021-11-22 19:20:40,721 INFO L226 Difference]: Without dead ends: 0 [2021-11-22 19:20:40,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:20:40,721 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 238 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:40,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 479 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:20:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-22 19:20:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-22 19:20:40,722 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:20:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-22 19:20:40,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2021-11-22 19:20:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:40,722 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-22 19:20:40,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 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:20:40,722 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-22 19:20:40,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-22 19:20:40,724 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-11-22 19:20:40,724 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-11-22 19:20:40,724 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2021-11-22 19:20:40,724 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2021-11-22 19:20:40,725 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2021-11-22 19:20:40,725 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-11-22 19:20:40,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-22 19:20:40,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-22 19:20:46,147 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,147 INFO L858 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2021-11-22 19:20:46,147 INFO L858 garLoopResultBuilder]: For program point L6610(lines 6610 6612) no Hoare annotation was computed. [2021-11-22 19:20:46,147 INFO L858 garLoopResultBuilder]: For program point L6610-2(lines 6610 6612) no Hoare annotation was computed. [2021-11-22 19:20:46,147 INFO L858 garLoopResultBuilder]: For program point L7205-2(lines 7205 7207) no Hoare annotation was computed. [2021-11-22 19:20:46,147 INFO L858 garLoopResultBuilder]: For program point L7205(line 7205) no Hoare annotation was computed. [2021-11-22 19:20:46,147 INFO L858 garLoopResultBuilder]: For program point L7205-4(lines 7205 7207) no Hoare annotation was computed. [2021-11-22 19:20:46,147 INFO L854 garLoopResultBuilder]: At program point L6880(lines 6876 6881) the Hoare annotation is: (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (< (+ |ULTIMATE.start_bounded_malloc_#res#1.base| 1) |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset|) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) 1) (<= |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)) (< |#StackHeapBarrier| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (not (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|)) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2021-11-22 19:20:46,147 INFO L858 garLoopResultBuilder]: For program point L8763(lines 8763 8784) no Hoare annotation was computed. [2021-11-22 19:20:46,147 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,147 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,147 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:20:46,157 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:20:46,157 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:20:46,157 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:20:46,157 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:20:46,158 INFO L858 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:20:46,159 INFO L858 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:20:46,159 INFO L858 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:20:46,159 INFO L858 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:20:46,159 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,159 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-22 19:20:46,159 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-22 19:20:46,159 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-22 19:20:46,159 INFO L858 garLoopResultBuilder]: For program point L7181-3(line 7181) no Hoare annotation was computed. [2021-11-22 19:20:46,159 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-22 19:20:46,159 INFO L858 garLoopResultBuilder]: For program point L7115-1(lines 7115 7119) no Hoare annotation was computed. [2021-11-22 19:20:46,159 INFO L858 garLoopResultBuilder]: For program point L7115(lines 7115 7119) no Hoare annotation was computed. [2021-11-22 19:20:46,160 INFO L858 garLoopResultBuilder]: For program point L7181-1(line 7181) no Hoare annotation was computed. [2021-11-22 19:20:46,160 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-22 19:20:46,160 INFO L858 garLoopResultBuilder]: For program point L7181(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,160 INFO L858 garLoopResultBuilder]: For program point L7181-7(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,160 INFO L858 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-22 19:20:46,160 INFO L858 garLoopResultBuilder]: For program point L7181-6(lines 7181 7182) no Hoare annotation was computed. [2021-11-22 19:20:46,160 INFO L858 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-22 19:20:46,160 INFO L858 garLoopResultBuilder]: For program point L7181-4(lines 7181 7182) no Hoare annotation was computed. [2021-11-22 19:20:46,160 INFO L858 garLoopResultBuilder]: For program point L7181-11(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,160 INFO L858 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-22 19:20:46,160 INFO L854 garLoopResultBuilder]: At program point L6884(lines 6883 6885) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset|) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (not (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|)) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2021-11-22 19:20:46,160 INFO L858 garLoopResultBuilder]: For program point L7181-9(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,160 INFO L858 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-22 19:20:46,160 INFO L858 garLoopResultBuilder]: For program point L7181-14(line 7181) no Hoare annotation was computed. [2021-11-22 19:20:46,161 INFO L858 garLoopResultBuilder]: For program point L7181-13(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,161 INFO L854 garLoopResultBuilder]: At program point L7181-12(lines 7179 7185) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|))) (let ((.cse1 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) (.cse2 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse3 (not (= (select .cse0 8) 0))) (.cse4 (not (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|))) (.cse5 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (.cse6 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0)) (.cse9 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0))) (or (and (< (+ (select .cse0 (+ |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| 8)) 1) |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (< (+ |ULTIMATE.start_bounded_malloc_#res#1.base| 1) |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) 8) 0) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) 1) .cse2 (< |#StackHeapBarrier| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse8 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)))) (<= .cse8 (+ (* 18446744073709551616 (div (+ (- 1) .cse8) 18446744073709551616)) 18446744073709551615))) .cse9) (and .cse1 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 0))))) [2021-11-22 19:20:46,161 INFO L858 garLoopResultBuilder]: For program point L7181-19(lines 7181 7182) no Hoare annotation was computed. [2021-11-22 19:20:46,161 INFO L858 garLoopResultBuilder]: For program point L7181-17(lines 7181 7182) no Hoare annotation was computed. [2021-11-22 19:20:46,161 INFO L858 garLoopResultBuilder]: For program point L7181-16(line 7181) no Hoare annotation was computed. [2021-11-22 19:20:46,161 INFO L858 garLoopResultBuilder]: For program point L7181-22(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,161 INFO L858 garLoopResultBuilder]: For program point L7181-20(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,161 INFO L858 garLoopResultBuilder]: For program point L7181-27(line 7181) no Hoare annotation was computed. [2021-11-22 19:20:46,162 INFO L858 garLoopResultBuilder]: For program point L7181-26(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,162 INFO L854 garLoopResultBuilder]: At program point L7181-25(lines 7179 7185) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) (.cse1 (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| 0))) (.cse2 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) 8) 0))) (.cse4 (not (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|))) (.cse5 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (.cse6 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0)) (.cse8 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0))) (or (and .cse0 .cse1 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 0)) (and (< (+ |ULTIMATE.start_bounded_malloc_#res#1.base| 1) |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) 8) 0) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) .cse1 (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base|) 8) 1) |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base|) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) 1) .cse2 (< |#StackHeapBarrier| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse9 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base|) 16))) (<= (+ (* 18446744073709551616 (div .cse9 18446744073709551616)) 1) .cse9)) .cse8 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset|)))) [2021-11-22 19:20:46,162 INFO L858 garLoopResultBuilder]: For program point L7181-24(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,162 INFO L858 garLoopResultBuilder]: For program point L7181-30(lines 7181 7182) no Hoare annotation was computed. [2021-11-22 19:20:46,162 INFO L858 garLoopResultBuilder]: For program point L7181-29(line 7181) no Hoare annotation was computed. [2021-11-22 19:20:46,162 INFO L858 garLoopResultBuilder]: For program point L7181-35(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,162 INFO L858 garLoopResultBuilder]: For program point L7181-33(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,162 INFO L858 garLoopResultBuilder]: For program point L7181-32(lines 7181 7182) no Hoare annotation was computed. [2021-11-22 19:20:46,162 INFO L858 garLoopResultBuilder]: For program point L7181-39(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,163 INFO L854 garLoopResultBuilder]: At program point L7181-38(lines 7179 7185) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| 0)) (.cse1 (not (= |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| 0))) (.cse2 (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| 0))) (.cse3 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) 8) 0))) (.cse5 (not (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|))) (.cse6 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|)) (.cse8 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) .cse2 .cse3 (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) 8) 1) |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse4 .cse5 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse6 (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_664 (Array Int Int))) (or (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (<= (let ((.cse7 (select (store (select (store |#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_664) |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_665) (+ 16 |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (+ (* 18446744073709551616 (div (+ 18446744073709551616 (* .cse7 (- 1))) 18446744073709551616)) .cse7)) 18446744073709551615))) .cse8 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset|)) (and .cse0 .cse1 .cse2 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|) .cse3 .cse4 .cse5 .cse6 .cse8 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 0)))) [2021-11-22 19:20:46,163 INFO L858 garLoopResultBuilder]: For program point L7181-37(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,163 INFO L858 garLoopResultBuilder]: For program point L7181-43(lines 7181 7182) no Hoare annotation was computed. [2021-11-22 19:20:46,163 INFO L858 garLoopResultBuilder]: For program point L7181-42(line 7181) no Hoare annotation was computed. [2021-11-22 19:20:46,163 INFO L858 garLoopResultBuilder]: For program point L7181-40(line 7181) no Hoare annotation was computed. [2021-11-22 19:20:46,163 INFO L858 garLoopResultBuilder]: For program point L7181-46(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,163 INFO L858 garLoopResultBuilder]: For program point L7181-45(lines 7181 7182) no Hoare annotation was computed. [2021-11-22 19:20:46,163 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,163 INFO L854 garLoopResultBuilder]: At program point L7181-51(lines 7179 7185) the Hoare annotation is: (and (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= (+ (* 18446744073709551616 (div .cse0 18446744073709551616)) 1) .cse0)) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|) (= |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_memset_impl_~n#1| 18446744073709551616)) 1) |ULTIMATE.start_memset_impl_~n#1|) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (not (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|)) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|) 0) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset|)) [2021-11-22 19:20:46,164 INFO L858 garLoopResultBuilder]: For program point L7181-50(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,164 INFO L858 garLoopResultBuilder]: For program point L7181-48(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,164 INFO L858 garLoopResultBuilder]: For program point L7181-55(line 7181) no Hoare annotation was computed. [2021-11-22 19:20:46,164 INFO L858 garLoopResultBuilder]: For program point L7181-53(line 7181) no Hoare annotation was computed. [2021-11-22 19:20:46,164 INFO L858 garLoopResultBuilder]: For program point L7181-52(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,164 INFO L858 garLoopResultBuilder]: For program point L7181-59(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,164 INFO L858 garLoopResultBuilder]: For program point L7181-58(lines 7181 7182) no Hoare annotation was computed. [2021-11-22 19:20:46,164 INFO L858 garLoopResultBuilder]: For program point L7181-56(lines 7181 7182) no Hoare annotation was computed. [2021-11-22 19:20:46,164 INFO L858 garLoopResultBuilder]: For program point L7181-63(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,165 INFO L858 garLoopResultBuilder]: For program point L7181-61(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,165 INFO L854 garLoopResultBuilder]: At program point L7117-3(lines 7117 7118) the Hoare annotation is: (and (let ((.cse16 (div |ULTIMATE.start_memset_impl_~n#1| 18446744073709551616))) (let ((.cse3 (* 18446744073709551616 .cse16)) (.cse18 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (let ((.cse9 (= |ULTIMATE.start_memset_impl_~n#1| .cse18)) (.cse15 (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_833 Int)) (not (= (mod (select (store (select (store |#memory_int| |ULTIMATE.start_memset_impl_~sp~0#1.base| v_ArrVal_831) |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_833) (+ 16 |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)))) (.cse0 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1)) (.cse1 (not (= |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| 0))) (.cse2 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (.cse17 (<= (+ (* 18446744073709551616 (div .cse18 18446744073709551616)) 1) .cse18)) (.cse4 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| 0))) (.cse7 (<= (+ .cse3 1) |ULTIMATE.start_memset_impl_~n#1|)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse10 (not (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|))) (.cse11 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (.cse12 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0)) (.cse14 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0))) (or (and .cse0 .cse1 .cse2 (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_memset_impl_~i~4#1| 18446744073709551616)) |ULTIMATE.start_memset_impl_~n#1|) (+ 18446744073709551615 .cse3)) .cse4 .cse5 .cse6 (<= 1 |ULTIMATE.start_memset_impl_~i~4#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ (* 18446744073709551616 (div (+ (* .cse16 (- 18446744073709551616)) |ULTIMATE.start_memset_impl_~n#1|) 18446744073709551616)) 2 .cse3) |ULTIMATE.start_memset_impl_~n#1|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse17 .cse5 (< (+ |ULTIMATE.start_memset_impl_~sp~0#1.base| 1) |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 (not (= |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| |ULTIMATE.start_memset_impl_~sp~0#1.base|)) .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))))) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset|)) [2021-11-22 19:20:46,165 INFO L858 garLoopResultBuilder]: For program point L7117-2(lines 7117 7118) no Hoare annotation was computed. [2021-11-22 19:20:46,165 INFO L858 garLoopResultBuilder]: For program point L7181-66(line 7181) no Hoare annotation was computed. [2021-11-22 19:20:46,165 INFO L858 garLoopResultBuilder]: For program point L7181-65(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,166 INFO L854 garLoopResultBuilder]: At program point L7181-64(lines 7179 7185) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| 0))) (.cse2 (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| 0))) (.cse3 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse4 (not (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|))) (.cse5 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|)) (.cse6 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (let ((.cse1 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= (+ (* 18446744073709551616 (div .cse1 18446744073709551616)) 1) .cse1)) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_~buf#1.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (= |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|) .cse2 (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_memset_impl_~n#1| 18446744073709551616)) 1) |ULTIMATE.start_memset_impl_~n#1|) .cse3 .cse4 .cse5 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_clean_up_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| 0) .cse6 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset|)) (and (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| 0) .cse0 .cse2 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|) .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 0)))) [2021-11-22 19:20:46,166 INFO L858 garLoopResultBuilder]: For program point L7181-71(lines 7181 7182) no Hoare annotation was computed. [2021-11-22 19:20:46,166 INFO L858 garLoopResultBuilder]: For program point L7181-69(lines 7181 7182) no Hoare annotation was computed. [2021-11-22 19:20:46,166 INFO L858 garLoopResultBuilder]: For program point L7181-68(line 7181) no Hoare annotation was computed. [2021-11-22 19:20:46,166 INFO L858 garLoopResultBuilder]: For program point L7181-74(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,166 INFO L858 garLoopResultBuilder]: For program point L7181-72(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,166 INFO L854 garLoopResultBuilder]: At program point L7181-77(lines 7179 7185) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| 24)) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|))) (and (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) .cse0) 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_~buf#1.base|) (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|) (= |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| 16)) 0) (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_memset_impl_~n#1| 18446744073709551616)) 1) |ULTIMATE.start_memset_impl_~n#1|) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= (select .cse1 .cse0) 0) (= 0 (select .cse1 (+ |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| 8))) (not (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|)) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_clean_up_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (+ 8 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|) 0) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset|))) [2021-11-22 19:20:46,167 INFO L858 garLoopResultBuilder]: For program point L7181-76(lines 7181 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,167 INFO L858 garLoopResultBuilder]: For program point L7184-2(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,167 INFO L858 garLoopResultBuilder]: For program point L7184(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,167 INFO L858 garLoopResultBuilder]: For program point L7184-6(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,167 INFO L858 garLoopResultBuilder]: For program point L7184-4(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,167 INFO L858 garLoopResultBuilder]: For program point L7184-3(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,167 INFO L858 garLoopResultBuilder]: For program point L7184-9(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,167 INFO L858 garLoopResultBuilder]: For program point L7184-8(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,167 INFO L858 garLoopResultBuilder]: For program point L7184-13(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,167 INFO L858 garLoopResultBuilder]: For program point L7184-12(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,168 INFO L858 garLoopResultBuilder]: For program point L7184-11(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,168 INFO L858 garLoopResultBuilder]: For program point L7184-18(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,168 INFO L858 garLoopResultBuilder]: For program point L7184-17(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,168 INFO L858 garLoopResultBuilder]: For program point L7184-15(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,168 INFO L858 garLoopResultBuilder]: For program point L7184-22(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,168 INFO L858 garLoopResultBuilder]: For program point L7184-21(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,168 INFO L858 garLoopResultBuilder]: For program point L7184-20(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,168 INFO L858 garLoopResultBuilder]: For program point L7184-26(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,168 INFO L858 garLoopResultBuilder]: For program point L7184-24(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,168 INFO L858 garLoopResultBuilder]: For program point L7184-30(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,169 INFO L858 garLoopResultBuilder]: For program point L7218(lines 7218 7225) no Hoare annotation was computed. [2021-11-22 19:20:46,169 INFO L858 garLoopResultBuilder]: For program point L7184-29(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,169 INFO L858 garLoopResultBuilder]: For program point L7184-27(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,169 INFO L858 garLoopResultBuilder]: For program point L7184-33(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,169 INFO L858 garLoopResultBuilder]: For program point L7184-31(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,169 INFO L858 garLoopResultBuilder]: For program point L7184-38(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,169 INFO L858 garLoopResultBuilder]: For program point L7184-36(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,169 INFO L858 garLoopResultBuilder]: For program point L7184-35(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,169 INFO L858 garLoopResultBuilder]: For program point L7184-42(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,170 INFO L858 garLoopResultBuilder]: For program point L7184-40(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,170 INFO L858 garLoopResultBuilder]: For program point L7184-39(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,171 INFO L858 garLoopResultBuilder]: For program point L7184-45(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,171 INFO L858 garLoopResultBuilder]: For program point L7184-44(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,171 INFO L858 garLoopResultBuilder]: For program point L7184-49(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,171 INFO L858 garLoopResultBuilder]: For program point L7184-48(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,171 INFO L858 garLoopResultBuilder]: For program point L7184-47(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,171 INFO L858 garLoopResultBuilder]: For program point L7184-53(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,171 INFO L858 garLoopResultBuilder]: For program point L7184-51(line 7184) no Hoare annotation was computed. [2021-11-22 19:20:46,171 INFO L854 garLoopResultBuilder]: At program point L7120(lines 7113 7121) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| 0) (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|))) (.cse0 (not (= |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| 0))) (.cse1 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| 0))) (.cse5 (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_memset_impl_~n#1| 18446744073709551616)) 1) |ULTIMATE.start_memset_impl_~n#1|)) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse7 (not (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|))) (.cse8 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (.cse9 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0)) (.cse11 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0))) (or (and (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1) .cse0 .cse1 (<= (+ (* 18446744073709551616 (div .cse2 18446744073709551616)) 1) .cse2) (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_memset_impl_~n#1| .cse2) .cse7 .cse8 .cse9 .cse10 .cse11) (and (not (= (mod .cse2 18446744073709551616) 0)) .cse0 .cse1 .cse3 (< (+ |ULTIMATE.start_memset_impl_~sp~0#1.base| 1) |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset|)) [2021-11-22 19:20:46,171 INFO L858 garLoopResultBuilder]: For program point L7220-2(lines 7220 7222) no Hoare annotation was computed. [2021-11-22 19:20:46,172 INFO L858 garLoopResultBuilder]: For program point L7220(lines 7220 7222) no Hoare annotation was computed. [2021-11-22 19:20:46,172 INFO L858 garLoopResultBuilder]: For program point L7055(lines 7055 7068) no Hoare annotation was computed. [2021-11-22 19:20:46,172 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-22 19:20:46,172 INFO L854 garLoopResultBuilder]: At program point L7124(lines 7123 7125) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| 0) (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|))) (.cse0 (not (= |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| 0))) (.cse1 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.base| 0))) (.cse5 (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_memset_impl_~n#1| 18446744073709551616)) 1) |ULTIMATE.start_memset_impl_~n#1|)) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse7 (not (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|))) (.cse8 (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (.cse9 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0)) (.cse11 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0))) (or (and (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1) .cse0 .cse1 (<= (+ (* 18446744073709551616 (div .cse2 18446744073709551616)) 1) .cse2) (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_memset_impl_~n#1| .cse2) .cse7 .cse8 .cse9 .cse10 .cse11) (and (not (= (mod .cse2 18446744073709551616) 0)) .cse0 .cse1 .cse3 (< (+ |ULTIMATE.start_memset_impl_~sp~0#1.base| 1) |ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset|)) [2021-11-22 19:20:46,172 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:20:46,172 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:20:46,172 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:20:46,172 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:20:46,172 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:20:46,173 INFO L858 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:20:46,173 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-22 19:20:46,173 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,173 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,173 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,173 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,173 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,173 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,173 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,173 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,174 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,174 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,174 INFO L858 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,174 INFO L858 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,174 INFO L858 garLoopResultBuilder]: For program point L7227(lines 7227 7232) no Hoare annotation was computed. [2021-11-22 19:20:46,174 INFO L854 garLoopResultBuilder]: At program point L6600(lines 6598 6601) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (not (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|))) [2021-11-22 19:20:46,174 INFO L858 garLoopResultBuilder]: For program point L7063(lines 7063 7067) no Hoare annotation was computed. [2021-11-22 19:20:46,174 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-22 19:20:46,174 INFO L854 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.offset|) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (not (= 0 |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|)) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_secure_harness_~#buf~3#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2021-11-22 19:20:46,175 INFO L858 garLoopResultBuilder]: For program point L8554(lines 8554 8571) no Hoare annotation was computed. [2021-11-22 19:20:46,175 INFO L861 garLoopResultBuilder]: At program point L8785(line 8785) the Hoare annotation is: true [2021-11-22 19:20:46,175 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-22 19:20:46,175 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:20:46,175 INFO L858 garLoopResultBuilder]: For program point L7203(lines 7203 7216) no Hoare annotation was computed. [2021-11-22 19:20:46,177 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:46,179 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 19:20:46,188 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,189 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,189 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,189 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] [2021-11-22 19:20:46,190 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_664,QUANTIFIED] [2021-11-22 19:20:46,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] [2021-11-22 19:20:46,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_665,QUANTIFIED] [2021-11-22 19:20:46,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_664,QUANTIFIED] [2021-11-22 19:20:46,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] [2021-11-22 19:20:46,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_665,QUANTIFIED] [2021-11-22 19:20:46,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,198 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,198 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,198 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] [2021-11-22 19:20:46,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_664,QUANTIFIED] [2021-11-22 19:20:46,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] [2021-11-22 19:20:46,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_665,QUANTIFIED] [2021-11-22 19:20:46,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_664,QUANTIFIED] [2021-11-22 19:20:46,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] [2021-11-22 19:20:46,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_665,QUANTIFIED] [2021-11-22 19:20:46,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,224 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,234 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_831,QUANTIFIED] [2021-11-22 19:20:46,235 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_833,QUANTIFIED] [2021-11-22 19:20:46,235 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_831,QUANTIFIED] [2021-11-22 19:20:46,235 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_833,QUANTIFIED] [2021-11-22 19:20:46,236 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_831,QUANTIFIED] [2021-11-22 19:20:46,236 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_833,QUANTIFIED] [2021-11-22 19:20:46,236 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_831,QUANTIFIED] [2021-11-22 19:20:46,236 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_833,QUANTIFIED] [2021-11-22 19:20:46,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 07:20:46 BoogieIcfgContainer [2021-11-22 19:20:46,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 19:20:46,238 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 19:20:46,238 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 19:20:46,238 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 19:20:46,239 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:20:07" (3/4) ... [2021-11-22 19:20:46,242 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-22 19:20:46,258 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 152 nodes and edges [2021-11-22 19:20:46,259 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2021-11-22 19:20:46,260 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-11-22 19:20:46,261 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-22 19:20:46,262 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-22 19:20:46,263 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-22 19:20:46,264 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-22 19:20:46,265 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-22 19:20:46,286 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((cond == 1 && \result + 1 < buf) && buf == buf) && \result == 0) && \valid[buf] == 1) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && unknown-#StackHeapBarrier-unknown < buf) && !(0 == buf)) && buf == buf) && buf == 0 [2021-11-22 19:20:46,287 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((#memory_$Pointer$[buf][buf + 8] + 1 < buf && \result + 1 < buf) && buf == buf) && #memory_$Pointer$[buf][8] == 0) && \result == 0) && \valid[buf] == 1) && !(\result == 0)) && unknown-#StackHeapBarrier-unknown < buf) && !(#memory_$Pointer$[buf][8] == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 18446744073709551615) && buf == 0) || (((((((((buf == buf && 0 <= \result) && !(\result == 0)) && !(#memory_$Pointer$[buf][8] == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0) && \result <= 0) [2021-11-22 19:20:46,287 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((buf == buf && !(buf == 0)) && 0 <= \result) && !(\result == 0)) && !(#memory_$Pointer$[buf][8] == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0) && \result <= 0) || (((((((((((((((((\result + 1 < buf && buf == buf) && buf == buf) && #memory_$Pointer$[buf][8] == 0) && \result == 0) && !(buf == 0)) && #memory_$Pointer$[buf][8] + 1 < buf) && \valid[buf] == 1) && !(\result == 0)) && unknown-#StackHeapBarrier-unknown < buf) && !(#memory_$Pointer$[buf][8] == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && 18446744073709551616 * (unknown-#memory_int-unknown[buf][16] / 18446744073709551616) + 1 <= unknown-#memory_int-unknown[buf][16]) && buf == 0) && buf == buf) [2021-11-22 19:20:46,288 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((buf == 0 && !(buf == 0)) && buf == buf) && buf == buf) && buf == 0) && !(buf == 0)) && !(\result == 0)) && #memory_$Pointer$[buf][8] + 1 < buf) && !(#memory_$Pointer$[buf][8] == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && (forall v_ArrVal_665 : int, v_ULTIMATE.start_memset_impl_~sp~0#1.base_6 : int, v_ArrVal_664 : [int]int :: #memory_$Pointer$[buf][8 + buf] < v_ULTIMATE.start_memset_impl_~sp~0#1.base_6 || 18446744073709551616 * ((18446744073709551616 + unknown-#memory_int-unknown[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6 := v_ArrVal_664][buf][buf := v_ArrVal_665][16 + buf] * -1) / 18446744073709551616) + unknown-#memory_int-unknown[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6 := v_ArrVal_664][buf][buf := v_ArrVal_665][16 + buf] <= 18446744073709551615)) && buf == 0) && buf == buf) || (((((((((buf == 0 && !(buf == 0)) && !(buf == 0)) && 0 <= \result) && !(\result == 0)) && !(#memory_$Pointer$[buf][8] == 0)) && !(0 == buf)) && buf == buf) && buf == 0) && \result <= 0) [2021-11-22 19:20:46,288 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((buf == buf && buf == 0) && (((((((((((((((\result <= 1 && !(buf == 0)) && buf == buf) && 18446744073709551616 * (unknown-#memory_int-unknown[buf][16 + buf] / 18446744073709551616) + 1 <= unknown-#memory_int-unknown[buf][16 + buf]) && 1 <= \result) && buf == 0) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0) || (((((((((((!(buf == 0) && buf == buf) && buf == 0) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && n == unknown-#memory_int-unknown[buf][16 + buf]) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0)) || ((((((((((((!(unknown-#memory_int-unknown[buf][16 + buf] % 18446744073709551616 == 0) && !(buf == 0)) && buf == buf) && buf == 0) && sp + 1 < buf) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0))) && buf == buf [2021-11-22 19:20:46,288 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\result <= 1 && !(buf == 0)) && buf == buf) && 18446744073709551616 * (i / 18446744073709551616) + n <= 18446744073709551615 + 18446744073709551616 * (n / 18446744073709551616)) && 1 <= \result) && buf == 0) && !(buf == 0)) && 1 <= i) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && n == unknown-#memory_int-unknown[buf][16 + buf]) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0) && (forall v_ArrVal_831 : [int]int, v_ArrVal_833 : int :: !(unknown-#memory_int-unknown[sp := v_ArrVal_831][buf][buf := v_ArrVal_833][16 + buf] % 18446744073709551616 == 0))) || (((((((((((((((\result <= 1 && !(buf == 0)) && buf == buf) && 1 <= \result) && buf == 0) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && n == unknown-#memory_int-unknown[buf][16 + buf]) && 18446744073709551616 * ((n / 18446744073709551616 * -18446744073709551616 + n) / 18446744073709551616) + 2 + 18446744073709551616 * (n / 18446744073709551616) <= n) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0) && (forall v_ArrVal_831 : [int]int, v_ArrVal_833 : int :: !(unknown-#memory_int-unknown[sp := v_ArrVal_831][buf][buf := v_ArrVal_833][16 + buf] % 18446744073709551616 == 0)))) || ((((((((((((!(buf == 0) && buf == buf) && 18446744073709551616 * (unknown-#memory_int-unknown[buf][16 + buf] / 18446744073709551616) + 1 <= unknown-#memory_int-unknown[buf][16 + buf]) && buf == 0) && sp + 1 < buf) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0)) || ((((((((((((((\result <= 1 && !(buf == 0)) && buf == buf) && 18446744073709551616 * (unknown-#memory_int-unknown[buf][16 + buf] / 18446744073709551616) + 1 <= unknown-#memory_int-unknown[buf][16 + buf]) && 1 <= \result) && buf == 0) && !(buf == sp)) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0)) && buf == buf) && buf == 0) && buf == buf [2021-11-22 19:20:46,289 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((buf == buf && buf == 0) && (((((((((((((((\result <= 1 && !(buf == 0)) && buf == buf) && 18446744073709551616 * (unknown-#memory_int-unknown[buf][16 + buf] / 18446744073709551616) + 1 <= unknown-#memory_int-unknown[buf][16 + buf]) && 1 <= \result) && buf == 0) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0) || (((((((((((!(buf == 0) && buf == buf) && buf == 0) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && n == unknown-#memory_int-unknown[buf][16 + buf]) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0)) || ((((((((((((!(unknown-#memory_int-unknown[buf][16 + buf] % 18446744073709551616 == 0) && !(buf == 0)) && buf == buf) && buf == 0) && sp + 1 < buf) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0))) && buf == buf [2021-11-22 19:20:46,289 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\result <= 1 && buf == buf) && 18446744073709551616 * (unknown-#memory_int-unknown[buf][16 + buf] / 18446744073709551616) + 1 <= unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && buf == buf) && 1 <= \result) && buf == 0) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == 0) && buf == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == 0) && buf == buf [2021-11-22 19:20:46,289 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(buf == 0) && buf == buf) && 18446744073709551616 * (unknown-#memory_int-unknown[buf][16 + buf] / 18446744073709551616) + 1 <= unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && buf == buf) && buf == buf) && buf == 0) && buf == buf) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0) && buf == buf) || ((((((((buf == 0 && !(buf == 0)) && !(buf == 0)) && 0 <= \result) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == 0) && \result <= 0) [2021-11-22 19:20:46,290 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result <= 1 && buf == buf) && #memory_$Pointer$[buf][buf + 24] == 0) && buf == buf) && buf == buf) && 1 <= \result) && buf == 0) && unknown-#memory_int-unknown[buf][buf + 16] == 0) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && #memory_$Pointer$[buf][buf + 24] == 0) && 0 == #memory_$Pointer$[buf][buf + 8]) && !(0 == buf)) && buf == buf) && buf == buf) && buf == buf) && buf == 0) && buf == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == 0) && buf == buf [2021-11-22 19:20:46,784 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-22 19:20:46,785 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 19:20:46,785 INFO L158 Benchmark]: Toolchain (without parser) took 42479.73ms. Allocated memory was 92.3MB in the beginning and 752.9MB in the end (delta: 660.6MB). Free memory was 43.5MB in the beginning and 372.8MB in the end (delta: -329.3MB). Peak memory consumption was 473.4MB. Max. memory is 16.1GB. [2021-11-22 19:20:46,785 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory was 68.6MB in the beginning and 68.5MB in the end (delta: 86.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 19:20:46,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1634.53ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 43.2MB in the beginning and 79.3MB in the end (delta: -36.1MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2021-11-22 19:20:46,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 212.21ms. Allocated memory is still 130.0MB. Free memory was 79.3MB in the beginning and 72.5MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-22 19:20:46,786 INFO L158 Benchmark]: Boogie Preprocessor took 74.90ms. Allocated memory is still 130.0MB. Free memory was 72.5MB in the beginning and 64.8MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-22 19:20:46,786 INFO L158 Benchmark]: RCFGBuilder took 1125.35ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 64.8MB in the beginning and 60.6MB in the end (delta: 4.1MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2021-11-22 19:20:46,786 INFO L158 Benchmark]: TraceAbstraction took 38881.08ms. Allocated memory was 161.5MB in the beginning and 752.9MB in the end (delta: 591.4MB). Free memory was 59.6MB in the beginning and 319.0MB in the end (delta: -259.4MB). Peak memory consumption was 401.6MB. Max. memory is 16.1GB. [2021-11-22 19:20:46,787 INFO L158 Benchmark]: Witness Printer took 546.75ms. Allocated memory is still 752.9MB. Free memory was 319.0MB in the beginning and 372.8MB in the end (delta: -53.8MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. [2021-11-22 19:20:46,787 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory was 68.6MB in the beginning and 68.5MB in the end (delta: 86.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1634.53ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 43.2MB in the beginning and 79.3MB in the end (delta: -36.1MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 212.21ms. Allocated memory is still 130.0MB. Free memory was 79.3MB in the beginning and 72.5MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.90ms. Allocated memory is still 130.0MB. Free memory was 72.5MB in the beginning and 64.8MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1125.35ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 64.8MB in the beginning and 60.6MB in the end (delta: 4.1MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * TraceAbstraction took 38881.08ms. Allocated memory was 161.5MB in the beginning and 752.9MB in the end (delta: 591.4MB). Free memory was 59.6MB in the beginning and 319.0MB in the end (delta: -259.4MB). Peak memory consumption was 401.6MB. Max. memory is 16.1GB. * Witness Printer took 546.75ms. Allocated memory is still 752.9MB. Free memory was 319.0MB in the beginning and 372.8MB in the end (delta: -53.8MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_664,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_665,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_664,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_665,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_664,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_665,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_664,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_665,QUANTIFIED] - 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: 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: 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: 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: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_831,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_831,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_831,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_831,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_833,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 162 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 38.8s, OverallIterations: 33, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10845 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10845 mSDsluCounter, 31037 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3244 IncrementalHoareTripleChecker+Unchecked, 25335 mSDsCounter, 675 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8633 IncrementalHoareTripleChecker+Invalid, 12552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 675 mSolverCounterUnsat, 5702 mSDtfsCounter, 8633 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1428 GetRequests, 893 SyntacticMatches, 20 SemanticMatches, 515 ConstructedPredicates, 32 IntricatePredicates, 0 DeprecatedPredicates, 2562 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=25, InterpolantAutomatonStates: 358, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 1334 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 42 NumberOfFragments, 1562 HoareAnnotationTreeSize, 14 FomulaSimplifications, 112 FormulaSimplificationTreeSizeReduction, 3.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 756748 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 5.4s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 3443 NumberOfCodeBlocks, 3443 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3801 ConstructedInterpolants, 194 QuantifiedInterpolants, 36920 SizeOfPredicates, 196 NumberOfNonLiveVariables, 13541 ConjunctsInSsa, 385 ConjunctsInUnsatCore, 42 InterpolantComputations, 29 PerfectInterpolantSequences, 14/34 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 6 specifications checked. All of them hold - InvariantResult [Line: 7179]: Loop Invariant [2021-11-22 19:20:46,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,797 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] [2021-11-22 19:20:46,797 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_664,QUANTIFIED] [2021-11-22 19:20:46,797 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] [2021-11-22 19:20:46,797 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_665,QUANTIFIED] [2021-11-22 19:20:46,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_664,QUANTIFIED] [2021-11-22 19:20:46,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] [2021-11-22 19:20:46,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_665,QUANTIFIED] [2021-11-22 19:20:46,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,799 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] [2021-11-22 19:20:46,799 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_664,QUANTIFIED] [2021-11-22 19:20:46,799 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] [2021-11-22 19:20:46,799 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_665,QUANTIFIED] [2021-11-22 19:20:46,799 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_664,QUANTIFIED] [2021-11-22 19:20:46,799 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6,QUANTIFIED] [2021-11-22 19:20:46,800 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_665,QUANTIFIED] [2021-11-22 19:20:46,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((buf == 0 && !(buf == 0)) && buf == buf) && buf == buf) && buf == 0) && !(buf == 0)) && !(\result == 0)) && #memory_$Pointer$[buf][8] + 1 < buf) && !(#memory_$Pointer$[buf][8] == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && (forall v_ArrVal_665 : int, v_ULTIMATE.start_memset_impl_~sp~0#1.base_6 : int, v_ArrVal_664 : [int]int :: #memory_$Pointer$[buf][8 + buf] < v_ULTIMATE.start_memset_impl_~sp~0#1.base_6 || 18446744073709551616 * ((18446744073709551616 + unknown-#memory_int-unknown[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6 := v_ArrVal_664][buf][buf := v_ArrVal_665][16 + buf] * -1) / 18446744073709551616) + unknown-#memory_int-unknown[v_ULTIMATE.start_memset_impl_~sp~0#1.base_6 := v_ArrVal_664][buf][buf := v_ArrVal_665][16 + buf] <= 18446744073709551615)) && buf == 0) && buf == buf) || (((((((((buf == 0 && !(buf == 0)) && !(buf == 0)) && 0 <= \result) && !(\result == 0)) && !(#memory_$Pointer$[buf][8] == 0)) && !(0 == buf)) && buf == buf) && buf == 0) && \result <= 0) - InvariantResult [Line: 7113]: Loop Invariant Derived loop invariant: ((buf == buf && buf == 0) && (((((((((((((((\result <= 1 && !(buf == 0)) && buf == buf) && 18446744073709551616 * (unknown-#memory_int-unknown[buf][16 + buf] / 18446744073709551616) + 1 <= unknown-#memory_int-unknown[buf][16 + buf]) && 1 <= \result) && buf == 0) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0) || (((((((((((!(buf == 0) && buf == buf) && buf == 0) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && n == unknown-#memory_int-unknown[buf][16 + buf]) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0)) || ((((((((((((!(unknown-#memory_int-unknown[buf][16 + buf] % 18446744073709551616 == 0) && !(buf == 0)) && buf == buf) && buf == 0) && sp + 1 < buf) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0))) && buf == buf - InvariantResult [Line: 6883]: Loop Invariant Derived loop invariant: ((((buf == buf && \valid[buf] == 1) && unknown-#StackHeapBarrier-unknown < buf) && !(0 == buf)) && buf == buf) && buf == 0 - InvariantResult [Line: 7179]: Loop Invariant Derived loop invariant: ((((((((((((((((!(buf == 0) && buf == buf) && 18446744073709551616 * (unknown-#memory_int-unknown[buf][16 + buf] / 18446744073709551616) + 1 <= unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && buf == buf) && buf == buf) && buf == 0) && buf == buf) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0) && buf == buf) || ((((((((buf == 0 && !(buf == 0)) && !(buf == 0)) && 0 <= \result) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == 0) && \result <= 0) - InvariantResult [Line: 7179]: Loop Invariant [2021-11-22 19:20:46,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((#memory_$Pointer$[buf][buf + 8] + 1 < buf && \result + 1 < buf) && buf == buf) && #memory_$Pointer$[buf][8] == 0) && \result == 0) && \valid[buf] == 1) && !(\result == 0)) && unknown-#StackHeapBarrier-unknown < buf) && !(#memory_$Pointer$[buf][8] == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 18446744073709551615) && buf == 0) || (((((((((buf == buf && 0 <= \result) && !(\result == 0)) && !(#memory_$Pointer$[buf][8] == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0) && \result <= 0) - InvariantResult [Line: 6876]: Loop Invariant Derived loop invariant: (((((((((cond == 1 && \result + 1 < buf) && buf == buf) && \result == 0) && \valid[buf] == 1) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && unknown-#StackHeapBarrier-unknown < buf) && !(0 == buf)) && buf == buf) && buf == 0 - InvariantResult [Line: 8785]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6598]: Loop Invariant Derived loop invariant: ((buf == 0 && \valid[buf] == 1) && unknown-#StackHeapBarrier-unknown < buf) && !(0 == buf) - InvariantResult [Line: 7179]: Loop Invariant [2021-11-22 19:20:46,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((buf == buf && !(buf == 0)) && 0 <= \result) && !(\result == 0)) && !(#memory_$Pointer$[buf][8] == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0) && \result <= 0) || (((((((((((((((((\result + 1 < buf && buf == buf) && buf == buf) && #memory_$Pointer$[buf][8] == 0) && \result == 0) && !(buf == 0)) && #memory_$Pointer$[buf][8] + 1 < buf) && \valid[buf] == 1) && !(\result == 0)) && unknown-#StackHeapBarrier-unknown < buf) && !(#memory_$Pointer$[buf][8] == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && 18446744073709551616 * (unknown-#memory_int-unknown[buf][16] / 18446744073709551616) + 1 <= unknown-#memory_int-unknown[buf][16]) && buf == 0) && buf == buf) - InvariantResult [Line: 7123]: Loop Invariant Derived loop invariant: ((buf == buf && buf == 0) && (((((((((((((((\result <= 1 && !(buf == 0)) && buf == buf) && 18446744073709551616 * (unknown-#memory_int-unknown[buf][16 + buf] / 18446744073709551616) + 1 <= unknown-#memory_int-unknown[buf][16 + buf]) && 1 <= \result) && buf == 0) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0) || (((((((((((!(buf == 0) && buf == buf) && buf == 0) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && n == unknown-#memory_int-unknown[buf][16 + buf]) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0)) || ((((((((((((!(unknown-#memory_int-unknown[buf][16 + buf] % 18446744073709551616 == 0) && !(buf == 0)) && buf == buf) && buf == 0) && sp + 1 < buf) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0))) && buf == buf - InvariantResult [Line: 7179]: Loop Invariant Derived loop invariant: ((((((((((((((\result <= 1 && buf == buf) && 18446744073709551616 * (unknown-#memory_int-unknown[buf][16 + buf] / 18446744073709551616) + 1 <= unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && buf == buf) && 1 <= \result) && buf == 0) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == 0) && buf == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == 0) && buf == buf - InvariantResult [Line: 7179]: Loop Invariant [2021-11-22 19:20:46,806 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:20:46,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:20:46,808 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((\result <= 1 && buf == buf) && #memory_$Pointer$[buf][buf + 24] == 0) && buf == buf) && buf == buf) && 1 <= \result) && buf == 0) && unknown-#memory_int-unknown[buf][buf + 16] == 0) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && #memory_$Pointer$[buf][buf + 24] == 0) && 0 == #memory_$Pointer$[buf][buf + 8]) && !(0 == buf)) && buf == buf) && buf == buf) && buf == buf) && buf == 0) && buf == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == 0) && buf == buf - InvariantResult [Line: 7117]: Loop Invariant [2021-11-22 19:20:46,808 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_831,QUANTIFIED] [2021-11-22 19:20:46,808 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_833,QUANTIFIED] [2021-11-22 19:20:46,808 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_831,QUANTIFIED] [2021-11-22 19:20:46,808 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_833,QUANTIFIED] [2021-11-22 19:20:46,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_831,QUANTIFIED] [2021-11-22 19:20:46,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_833,QUANTIFIED] [2021-11-22 19:20:46,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_831,QUANTIFIED] [2021-11-22 19:20:46,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_833,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((\result <= 1 && !(buf == 0)) && buf == buf) && 18446744073709551616 * (i / 18446744073709551616) + n <= 18446744073709551615 + 18446744073709551616 * (n / 18446744073709551616)) && 1 <= \result) && buf == 0) && !(buf == 0)) && 1 <= i) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && n == unknown-#memory_int-unknown[buf][16 + buf]) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0) && (forall v_ArrVal_831 : [int]int, v_ArrVal_833 : int :: !(unknown-#memory_int-unknown[sp := v_ArrVal_831][buf][buf := v_ArrVal_833][16 + buf] % 18446744073709551616 == 0))) || (((((((((((((((\result <= 1 && !(buf == 0)) && buf == buf) && 1 <= \result) && buf == 0) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && n == unknown-#memory_int-unknown[buf][16 + buf]) && 18446744073709551616 * ((n / 18446744073709551616 * -18446744073709551616 + n) / 18446744073709551616) + 2 + 18446744073709551616 * (n / 18446744073709551616) <= n) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0) && (forall v_ArrVal_831 : [int]int, v_ArrVal_833 : int :: !(unknown-#memory_int-unknown[sp := v_ArrVal_831][buf][buf := v_ArrVal_833][16 + buf] % 18446744073709551616 == 0)))) || ((((((((((((!(buf == 0) && buf == buf) && 18446744073709551616 * (unknown-#memory_int-unknown[buf][16 + buf] / 18446744073709551616) + 1 <= unknown-#memory_int-unknown[buf][16 + buf]) && buf == 0) && sp + 1 < buf) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0)) || ((((((((((((((\result <= 1 && !(buf == 0)) && buf == buf) && 18446744073709551616 * (unknown-#memory_int-unknown[buf][16 + buf] / 18446744073709551616) + 1 <= unknown-#memory_int-unknown[buf][16 + buf]) && 1 <= \result) && buf == 0) && !(buf == sp)) && !(buf == 0)) && 18446744073709551616 * (n / 18446744073709551616) + 1 <= n) && !(\result == 0)) && !(0 == buf)) && buf == buf) && buf == buf) && buf == 0) && buf == 0)) && buf == buf) && buf == 0) && buf == buf - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((buf == buf && \valid[buf] == 1) && unknown-#StackHeapBarrier-unknown < buf) && !(0 == buf)) && buf == buf) && buf == 0 RESULT: Ultimate proved your program to be correct! [2021-11-22 19:20:46,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE